So sánh phương pháp

	Quy tắc kết hợp	Voting Ensemble
Lĩnh vực	Học máy	Học máy
Họ	Machine learning	Machine learning
Năm ra đời	1993	1990s–2004
Người khởi xướng	Agrawal, R., Imielinski, T., & Swami, A.	Lam & Suen; Kuncheva, L. I. (systematic treatment)
Loại	Unsupervised pattern discovery	Ensemble (combination of multiple classifiers by vote)
Công trình gốc	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
Tên gọi khác	market basket analysis, association rule mining, frequent itemset mining, affinity analysis	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
Liên quan	4	5
Tóm tắt	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.