Salīdzināt metodes

	Algoritms Ensemble Apriori	Apriori algoritms	Pastiprināšana
Nozare	Mašīnmācīšanās	Mašīnmācīšanās	Mašīnmācīšanās
Saime	Machine learning	Machine learning	Machine learning
Izcelsmes gads	1994 (Apriori base); ensemble extensions 2000s–2010s	1994	1990–1997
Autors	Agrawal, R. & Srikant, R. (Apriori base); ensemble extension by multiple researchers	Agrawal, R. & Srikant, R.	Schapire, R. E.; Freund, Y.
Tips	Ensemble / Frequent Pattern Mining	Frequent itemset and association rule mining algorithm	Sequential ensemble (iterative reweighting)
Pirmavots	Agrawal, R. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 1215, 487–499.	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.
Citi nosaukumi	Ensemble Apriori, Ensemble Association Rule Mining, EAR mining, Distributed Apriori Ensemble	Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
Saistītās	5	5	6
Kopsavilkums	The Ensemble Apriori Algorithm applies ensemble principles to the classic Apriori frequent-pattern miner by running multiple Apriori instances on different data partitions or parameter settings and merging their rule sets. This approach improves coverage, reduces sensitivity to the minimum-support threshold, and scales association rule mining to larger transactional datasets.	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.