방법 비교

	베이지안 연관 규칙	Apriori 알고리즘
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1994–1995	1994
창시자	Heckerman, D. et al.; Agrawal, R. & Srikant, R.	Agrawal, R. & Srikant, R.
유형	Probabilistic rule mining	Frequent itemset and association rule mining algorithm
원전	Heckerman, D., Geiger, D., & Chickering, D. M. (1995). Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20(3), 197–243.	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.
별칭	Bayesian rule learning, probabilistic association rules, Bayesian itemset mining, BAR	Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining
관련	6	5
요약	Bayesian Association Rules extend classical association rule mining by placing a prior probability distribution over rules and scoring them by their posterior probability given the data. Rather than thresholding on raw support and confidence counts, this Bayesian framework naturally penalises complexity, corrects for multiple comparisons, and produces calibrated probabilistic rule strengths across transactional or categorical 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.