Alert button
Picture for J. Ryan Carr

J. Ryan Carr

Alert button

Bayesian Learning of Clique Tree Structure

Add code
Bookmark button
Alert button
Aug 23, 2017
Cetin Savkli, J. Ryan Carr, Philip Graff, Lauren Kennell

Figure 1 for Bayesian Learning of Clique Tree Structure
Figure 2 for Bayesian Learning of Clique Tree Structure
Figure 3 for Bayesian Learning of Clique Tree Structure
Figure 4 for Bayesian Learning of Clique Tree Structure

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.

* Proceedings of the International Conference on Data Mining (DMIN). The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp). p 201, 2016  
* 7 pages, 11 figures; see http://worldcomp-proceedings.com/proc/p2016/DMIN16_Contents.html 
Viaarxiv icon
Github IconAccess Paper or Ask Questions
Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon