Bayesian Learning of Clique Tree Structure
Machine Learning
2017-08-24 v1 Probability
Machine Learning
Abstract
The problem of categorical data analysis in high dimensions is considered. A discussion of the fundamental difficulties of probability modeling is provided, and a solution to the derivation of high dimensional probability distributions based on Bayesian learning of clique tree decomposition is presented. The main contributions of this paper are an automated determination of the optimal clique tree structure for probability modeling, the resulting derived probability distribution, and a corresponding unified approach to clustering and anomaly detection based on the probability distribution.
Cite
@article{arxiv.1708.07025,
title = {Bayesian Learning of Clique Tree Structure},
author = {Cetin Savkli and J. Ryan Carr and Philip Graff and Lauren Kennell},
journal= {arXiv preprint arXiv:1708.07025},
year = {2017}
}
Comments
7 pages, 11 figures; see http://worldcomp-proceedings.com/proc/p2016/DMIN16_Contents.html