mlsanityData to 7 Oct 2026

Bayesian Learning of Clique Tree Structure

arXiv 1708.07025 ↗First posted 23 Aug 2017cs.LG math.PR stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 23 Aug 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1.

1 paper.