विधियों की तुलना करें

	एन्सेम्बल एप्रीओरी एल्गोरिथम	बैगिंग (बूटस्ट्रैप एग्रीगेटिंग)	बूस्टिंग	एफपी-ग्रोथ (फ्रीक्वेंट पैटर्न ग्रोथ)
क्षेत्र	मशीन अधिगम	मशीन अधिगम	मशीन अधिगम	मशीन अधिगम
परिवार	Machine learning	Machine learning	Machine learning	Machine learning
उद्भव वर्ष	1994 (Apriori base); ensemble extensions 2000s–2010s	1996	1990–1997	2000
प्रवर्तक	Agrawal, R. & Srikant, R. (Apriori base); ensemble extension by multiple researchers	Breiman, L.	Schapire, R. E.; Freund, Y.	Jiawei Han, Jian Pei & Yiwen Yin
प्रकार	Ensemble / Frequent Pattern Mining	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Sequential ensemble (iterative reweighting)	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.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139.	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	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme
संबंधित	5	5	6	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.	Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.	Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.	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.