방법 비교

	앙상블 아프리오리 알고리즘	배깅 (Bootstrap Aggregating)
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1994 (Apriori base); ensemble extensions 2000s–2010s	1996
창시자	Agrawal, R. & Srikant, R. (Apriori base); ensemble extension by multiple researchers	Breiman, L.
유형	Ensemble / Frequent Pattern Mining	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)
원전	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.
별칭	Ensemble Apriori, Ensemble Association Rule Mining, EAR mining, Distributed Apriori Ensemble	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor
관련	5	5
요약	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.