Linganisha mbinu

	Algoriti ya Ensemble Apriori	Bagging (Bootstrap Aggregating)	FP-Growth (Frequent Pattern Growth)
Nyanja	Ujifunzaji wa Mashine	Ujifunzaji wa Mashine	Ujifunzaji wa Mashine
Familia	Machine learning	Machine learning	Machine learning
Mwaka wa asili	1994 (Apriori base); ensemble extensions 2000s–2010s	1996	2000
Mwanzilishi	Agrawal, R. & Srikant, R. (Apriori base); ensemble extension by multiple researchers	Breiman, L.	Jiawei Han, Jian Pei & Yiwen Yin
Aina	Ensemble / Frequent Pattern Mining	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Frequent-itemset mining algorithm
Chanzo asilia	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.	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12.
Majina mbadala	Ensemble Apriori, Ensemble Association Rule Mining, EAR mining, Distributed Apriori Ensemble	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme
Zinazohusiana	5	5	4
Muhtasari	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.	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.