방법 비교

	앙상블 연관 규칙	Apriori 알고리즘
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	late 1990s–2000s	1994
창시자	Various (applied ensemble philosophy from Breiman and others to association rule mining)	Agrawal, R. & Srikant, R.
유형	Ensemble meta-learning over association rule learners	Frequent itemset and association rule mining algorithm
원전	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.	Agrawal, R. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 487–499.
별칭	Ensemble ARM, aggregated association rules, combined frequent-pattern mining, multi-run association rule learning	Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining
관련	6	5
요약	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.	The Apriori algorithm, introduced by Agrawal and Srikant in 1994, is the foundational method for discovering frequent itemsets and association rules in transactional databases. It uses a breadth-first, level-wise search guided by the anti-monotone property of support to efficiently enumerate all item combinations that co-occur above a user-set minimum threshold, then extracts interpretable if-then rules from those patterns.