Compară metode

	Reguli de Asociere de Ansamblu	FP-Growth (Creștere Frecventă a Pattern-urilor)
Domeniu	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning
Anul apariției	late 1990s–2000s	2000
Autorul original	Various (applied ensemble philosophy from Breiman and others to association rule mining)	Jiawei Han, Jian Pei & Yiwen Yin
Tip	Ensemble meta-learning over association rule learners	Frequent-itemset mining algorithm
Sursa seminală	Domingos, P. (1999). MetaCost: A general method for making classifiers cost-sensitive. Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 155–164.	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12.
Denumiri alternative	Ensemble ARM, aggregated association rules, combined frequent-pattern mining, multi-run association rule learning	frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme
Înrudite	6	4
Rezumat	Ensemble Association Rules applies ensemble learning principles to association rule mining: multiple rule sets are discovered from different data subsamples or with varied parameters, then merged and weighted to produce a more stable and complete set of co-occurrence patterns. The approach reduces sensitivity to support and confidence threshold choices and improves robustness on noisy transactional data.	FP-Growth, introduced by Jiawei Han, Jian Pei, and Yiwen Yin in 2000, mines frequent itemsets from transaction data without generating candidate sets, the costly step that slows the classic Apriori algorithm. It compresses the database into a frequent-pattern tree (FP-tree) in two scans, then grows frequent patterns recursively from that structure, making it dramatically faster than Apriori on large, dense datasets.