Using greedy algorithm to learn graphical model for digit recognition
Graphical model, the marriage between graph theory and probability theory, has been drawing increasing attention because of its many attractive features. In this paper, we consider the problem of learning the structure of graphical model based on observed data through a greedy forward-backward algor...
Main Author: | Yang, Jisong |
---|---|
Format: | Others |
Language: | en |
Published: |
2015
|
Subjects: | |
Online Access: | http://hdl.handle.net/2152/28131 |
Similar Items
-
Greedy structure learning of Markov Random Fields
by: Johnson, Christopher Carroll
Published: (2011) -
mgm: Estimating Time-Varying Mixed Graphical Models in High-Dimensional Data
by: Jonas M. B. Haslbeck, et al.
Published: (2020-04-01) -
A Python implementation of graphical models
by: Gouws, Almero
Published: (2010) -
Random Fields in Physics, Biology and Data Science
by: Enrique Hernández-Lemus, et al.
Published: (2021-04-01) -
On a Class of Tensor Markov Fields
by: Enrique Hernández-Lemus
Published: (2020-04-01)