방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 베이지안 연관 규칙× | 베이즈 가우시안 혼합 모델× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1994–1995 | 1999–2006 |
| 창시자≠ | Heckerman, D. et al.; Agrawal, R. & Srikant, R. | Attias, H.; Bishop, C. M. |
| 유형≠ | Probabilistic rule mining | Probabilistic clustering / density estimation |
| 원전≠ | Heckerman, D., Geiger, D., & Chickering, D. M. (1995). Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20(3), 197–243. DOI ↗ | Bishop, C. M. (2006). Pattern Recognition and Machine Learning (Ch. 10). Springer. ISBN: 978-0-387-31073-2 |
| 별칭 | Bayesian rule learning, probabilistic association rules, Bayesian itemset mining, BAR | Bayesian GMM, Variational Gaussian Mixture, VBGMM, Dirichlet Process Gaussian Mixture |
| 관련≠ | 6 | 4 |
| 요약≠ | 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 Bayesian Gaussian Mixture Model places prior distributions over all mixture parameters and infers their posteriors — typically via Variational Bayes or MCMC — rather than fitting fixed point estimates. This yields principled uncertainty quantification, automatic selection of the effective number of components, and resistance to overfitting small datasets. |
| ScholarGate데이터셋 ↗ |
|
|