방법 비교

	연관 규칙	Voting Ensemble
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1993	1990s–2004
창시자	Agrawal, R., Imielinski, T., & Swami, A.	Lam & Suen; Kuncheva, L. I. (systematic treatment)
유형	Unsupervised pattern discovery	Ensemble (combination of multiple classifiers by vote)
원전	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.	Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8
별칭	market basket analysis, association rule mining, frequent itemset mining, affinity analysis	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
관련	4	5
요약	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.	A voting ensemble trains several diverse classifiers independently and combines their predictions by a vote: hard voting picks the class chosen by the most models, while soft voting averages their class-probability estimates, optionally with per-model weights. The combination usually outperforms any individual member, and requires no additional training after the base models are fitted.