השוואת שיטות

	אלגוריתם Apriori	שק (Bootstrap Aggregating)
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1994	1996
הוגה השיטה	Agrawal, R. & Srikant, R.	Breiman, L.
סוג	Frequent itemset and association rule mining algorithm	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)
מקור מכונן	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.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.
כינויים	Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor
קשורות	5	5
תקציר	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.	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.