Porównaj metody

	Algorytm Apriori	Reguły asocjacyjne	Bagging (agregacja bootstrapowa)
Dziedzina	Uczenie maszynowe	Uczenie maszynowe	Uczenie maszynowe
Rodzina	Machine learning	Machine learning	Machine learning
Rok powstania	1994	1993	1996
Twórca	Agrawal, R. & Srikant, R.	Agrawal, R., Imielinski, T., & Swami, A.	Breiman, L.
Typ	Frequent itemset and association rule mining algorithm	Unsupervised pattern discovery	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)
Źródło pierwotne	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.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.
Inne nazwy	Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining	market basket analysis, association rule mining, frequent itemset mining, affinity analysis	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor
Pokrewne	5	4	5
Podsumowanie	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.	Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.