A Class of Random Fields on Complete Graphs with Tractable Partition Function

The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising models with homogeneous pairwise potentials but arbitrary (inho...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on pattern analysis and machine intelligence 2013-09, Vol.35 (9), p.2304-2306
1. Verfasser:	Flach, B.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Approximation Approximation methods Bipartite graph Computation Computational modeling Computer science control theory systems Exact sciences and technology Graphs Information retrieval. Graph Labeling Markov random fields Mathematical analysis Mathematical models Partitioning algorithms Partitions Pattern analysis Polynomials Theoretical computing Time complexity
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!