השוואת שיטות

	כללי אסוציאציות ניתנים להסבר	כללי אסוציאציה
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1993 (rules); 2010s (XAI framing)	1993
הוגה השיטה	Agrawal, R., Imielinski, T., & Swami, A. (foundational); XAI framing: broader community (2010s–present)	Agrawal, R., Imielinski, T., & Swami, A.
סוג	Interpretable pattern mining / XAI technique	Unsupervised pattern discovery
מקור מכונן	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.	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.
כינויים	XAI association rules, interpretable association rules, rule-based explanation mining, transparent association rule learning	market basket analysis, association rule mining, frequent itemset mining, affinity analysis
קשורות	6	4
תקציר	Explainable Association Rules leverages the inherently symbolic, if-then structure of association rule mining to provide human-readable explanations of data patterns or black-box model decisions. Because each rule explicitly states its antecedent and consequent together with support, confidence, and lift, the outputs are natively interpretable without requiring a secondary post-hoc surrogate.	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.