Võrdle meetodeid

	Apriori algoritm	Assotsiatsioonireeglid	Boosting
Valdkond	Masinõpe	Masinõpe	Masinõpe
Perekond	Machine learning	Machine learning	Machine learning
Tekkeaasta	1994	1993	1990–1997
Looja	Agrawal, R. & Srikant, R.	Agrawal, R., Imielinski, T., & Swami, A.	Schapire, R. E.; Freund, Y.
Tüüp	Frequent itemset and association rule mining algorithm	Unsupervised pattern discovery	Sequential ensemble (iterative reweighting)
Algallikas	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.	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.
Rööpnimetused	Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining	market basket analysis, association rule mining, frequent itemset mining, affinity analysis	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
Seotud	5	4	6
Kokkuvõte	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.	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.