Bayesian Learning of Clique Tree Structure

08/23/2017
by   Cetin Savkli, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2021

Generating Negations of Probability Distributions

Recently it was introduced a negation of a probability distribution. The...
research
03/27/2013

A Combination of Cutset Conditioning with Clique-Tree Propagation in the Pathfinder System

Cutset conditioning and clique-tree propagation are two popular methods ...
research
01/23/2013

A General Algorithm for Approximate Inference and its Application to Hybrid Bayes Nets

The clique tree algorithm is the standard method for doing inference in ...
research
01/24/2022

Probability Distribution on Rooted Trees

The hierarchical and recursive expressive capability of rooted trees is ...
research
03/20/2013

Symbolic Probabilistic Inference with Evidence Potential

Recent research on the Symbolic Probabilistic Inference (SPI) algorithm[...
research
03/09/2022

A Method for Random Packing of Spheres with Application to Bonding Modeling in Powder Bed 3D Printing Process

A Matlab-based computational procedure is proposed to fill a given volum...
research
03/13/2013

Sidestepping the Triangulation Problem in Bayesian Net Computations

This paper presents a new approach for computing posterior probabilities...

Please sign up or login with your details

Forgot password? Click here to reset