arXiv:1708.07025
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Self-supervised Learning of Echocardiographic Video Representations via Online Cluster Distillation
MADCluster: Model-agnostic Anomaly Detection with Self-supervised Clustering Network
Industrial Image Anomaly Localization Based on Gaussian Clustering of Pretrained Feature
Experiment-based detection of service disruption attacks in optical networks using data analytics and unsupervised learning
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
Car Object Counting and Position Estimation via Extension of the CLIP-EBC Framework
토론
이 논문과 연결된 포럼 글이 아직 없습니다.