เปรียบเทียบวิธี

	อัลกอริทึม Apriori แบบ Ensemble	FP-Growth (Frequent Pattern Growth)
สาขาวิชา	การเรียนรู้ของเครื่อง	การเรียนรู้ของเครื่อง
ตระกูล	Machine learning	Machine learning
ปีกำเนิด	1994 (Apriori base); ensemble extensions 2000s–2010s	2000
ผู้ริเริ่ม	Agrawal, R. & Srikant, R. (Apriori base); ensemble extension by multiple researchers	Jiawei Han, Jian Pei & Yiwen Yin
ประเภท	Ensemble / Frequent Pattern Mining	Frequent-itemset mining algorithm
แหล่งต้นตำรับ	Agrawal, R. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 1215, 487–499.	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12.
ชื่อเรียกอื่น	Ensemble Apriori, Ensemble Association Rule Mining, EAR mining, Distributed Apriori Ensemble	frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme
ที่เกี่ยวข้อง	5	4
สรุป	The Ensemble Apriori Algorithm applies ensemble principles to the classic Apriori frequent-pattern miner by running multiple Apriori instances on different data partitions or parameter settings and merging their rule sets. This approach improves coverage, reduces sensitivity to the minimum-support threshold, and scales association rule mining to larger transactional datasets.	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.