পদ্ধতির তুলনা করুন

	এনসেম্বল অ্যাসোসিয়েশন রুলস	ভোটিং এনসেম্বল
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	late 1990s–2000s	1990s–2004
প্রবর্তক	Various (applied ensemble philosophy from Breiman and others to association rule mining)	Lam & Suen; Kuncheva, L. I. (systematic treatment)
ধরন	Ensemble meta-learning over association rule learners	Ensemble (combination of multiple classifiers by vote)
মৌলিক উৎস	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.	Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8
অপর নাম	Ensemble ARM, aggregated association rules, combined frequent-pattern mining, multi-run association rule learning	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
সম্পর্কিত	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.	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.