방법 비교

	앙상블 연관 규칙	연관 규칙
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	late 1990s–2000s	1993
창시자	Various (applied ensemble philosophy from Breiman and others to association rule mining)	Agrawal, R., Imielinski, T., & Swami, A.
유형	Ensemble meta-learning over association rule learners	Unsupervised pattern discovery
원전	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., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207–216.
별칭	Ensemble ARM, aggregated association rules, combined frequent-pattern mining, multi-run association rule learning	market basket analysis, association rule mining, frequent itemset mining, affinity analysis
관련	6	4
요약	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.	Association rule learning is an unsupervised technique that discovers co-occurrence patterns — 'if X then Y' implications — within large transactional datasets. Originally formalized by Agrawal, Imielinski, and Swami (1993) for supermarket basket analysis, it is now widely applied in e-commerce recommendation, health informatics, bioinformatics, and behavioral research.