השוואת שיטות

	כללי כללי אסוציאציה למידה פעילה	אלגוריתם Apriori
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	2010s	1994
הוגה השיטה	Dzyuba, V. & van Leeuwen, M.; Boley, M. et al.	Agrawal, R. & Srikant, R.
סוג	Interactive pattern mining	Frequent itemset and association rule mining algorithm
מקור מכונן	Dzyuba, V., & van Leeuwen, M. (2017). Interactive Discovery of Interesting Association Rules by Subjective Interestingness. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD). Springer.	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.
כינויים	interactive association rule mining, active rule mining, query-driven association rule discovery, user-guided association rules	Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining
קשורות	5	5
תקציר	Active learning association rules combines the iterative query-and-label loop of active learning with association rule mining, allowing a human expert to guide the discovery process interactively. Instead of exhaustively enumerating all rules above a fixed support-confidence threshold, the system selects the most informative rule candidates and asks the user to judge their interestingness, focusing the search on subjectively useful patterns.	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.