Порівняння методів

	Ансамблеві правила асоціацій	Алгоритм Apriori	Бустинг
Галузь	Машинне навчання	Машинне навчання	Машинне навчання
Родина	Machine learning	Machine learning	Machine learning
Рік появи	late 1990s–2000s	1994	1990–1997
Автор методу	Various (applied ensemble philosophy from Breiman and others to association rule mining)	Agrawal, R. & Srikant, R.	Schapire, R. E.; Freund, Y.
Тип	Ensemble meta-learning over association rule learners	Frequent itemset and association rule mining algorithm	Sequential ensemble (iterative reweighting)
Основоположне джерело	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. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 487–499.	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.
Інші назви	Ensemble ARM, aggregated association rules, combined frequent-pattern mining, multi-run association rule learning	Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
Пов'язані	6	5	6
Підсумок	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.	The Apriori algorithm, introduced by Agrawal and Srikant in 1994, is the foundational method for discovering frequent itemsets and association rules in transactional databases. It uses a breadth-first, level-wise search guided by the anti-monotone property of support to efficiently enumerate all item combinations that co-occur above a user-set minimum threshold, then extracts interpretable if-then rules from those patterns.	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.