Constraint-free Graphical Model with Fast Learning Algorithm

2012/06/17 by Kazuya Takabatake, Takabatake, Kazuya, Shotaro Akaho +1
Computer Science · #FOS: Computer and information sciences #Face and Expression Recognition #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Neural Networks and Applications #Rough Sets and Fuzzy Logic

paper · pdf · doi:10.48550/arxiv.1206.3721

openalex publication_date 2012/06/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we propose a simple, versatile model for learning the structure and parameters of multivariate distributions from a data set. Learning a Markov network from a given data set is not a simple problem, because Markov networks rigorously represent Markov properties, and this rigor imposes complex constraints on the design of the networks. Our proposed model removes these constraints, acquiring important aspects from the information geometry. The proposed parameter- and structure-learning algorithms are simple to execute as they are based solely on local computation at each node. Experiments demonstrate that our algorithms work appropriately.

Related

• Learning non-parametric Markov networks with mutual information
• Learning Markov Network Structure using Brownian Distance Covariance
• Efficient Bayesian network structure learning via local Markov boundary\n search
• Structure Learning in Graphical Modeling
• Learning Gaussian Graphical Models via Multiplicative Weights