Jämför metoder

	Bayesianska associationsregler	Bayesiansk Naiv Bayes
Ämnesområde	Maskininlärning	Maskininlärning
Familj	Machine learning	Machine learning
Ursprungsår	1994–1995	1960s (base); Bayesian parameter treatment formalized 2000s
Upphovsperson	Heckerman, D. et al.; Agrawal, R. & Srikant, R.	Naive Bayes: Maron & Kuhns (1960); full Bayesian treatment formalized by Murphy (2012) and Bishop (2006)
Typ	Probabilistic rule mining	Probabilistic generative classifier
Ursprungskälla	Heckerman, D., Geiger, D., & Chickering, D. M. (1995). Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20(3), 197–243.	Murphy, K. P. (2012). Machine Learning: A Probabilistic Perspective (Ch. 3, 4). MIT Press. ISBN: 978-0-262-01802-9
Alias	Bayesian rule learning, probabilistic association rules, Bayesian itemset mining, BAR	Bayesian NB, Naive Bayes with Bayesian parameter estimation, Dirichlet-Multinomial Naive Bayes, BNB
Närliggande	6	4
Sammanfattning	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.	Bayesian Naive Bayes applies a fully Bayesian treatment to the parameters of the classic Naive Bayes classifier: instead of estimating class-conditional distributions by maximum likelihood, it places conjugate priors (typically Dirichlet for categorical data or Gaussian-Gamma for continuous data) over the parameters and integrates them out, producing predictive posterior distributions that naturally quantify uncertainty and avoid overfitting on small datasets.