השוואת שיטות

	אלגוריתם Ensemble Apriori	אלגוריתם Apriori
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1994 (Apriori base); ensemble extensions 2000s–2010s	1994
הוגה השיטה	Agrawal, R. & Srikant, R. (Apriori base); ensemble extension by multiple researchers	Agrawal, R. & Srikant, R.
סוג	Ensemble / Frequent Pattern Mining	Frequent itemset and association rule mining algorithm
מקור מכונן	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.
כינויים	Ensemble Apriori, Ensemble Association Rule Mining, EAR mining, Distributed Apriori Ensemble	Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining
קשורות	5	5
תקציר	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.