Sammenlign metoder

	Ensemble Association Rules	Associeringsregler	Boosting
Fagområde	Maskinlæring	Maskinlæring	Maskinlæring
Familie	Machine learning	Machine learning	Machine learning
Oprindelsesår	late 1990s–2000s	1993	1990–1997
Ophavsperson	Various (applied ensemble philosophy from Breiman and others to association rule mining)	Agrawal, R., Imielinski, T., & Swami, A.	Schapire, R. E.; Freund, Y.
Type	Ensemble meta-learning over association rule learners	Unsupervised pattern discovery	Sequential ensemble (iterative reweighting)
Oprindelig kilde	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.	Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139.
Aliasser	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	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
Relaterede	6	4	6
Resumé	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.	Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.