Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions

The problem of graphical model selection is to estimate the graph structure of a Markov random field given samples from it. We analyze the information-theoretic limitations of the problem of graph selection for binary Markov random fields under high-dimensional scaling, in which the graph size and t...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on information theory Ročník 58; číslo 7; s. 4117 - 4134
Hlavní autori:	Santhanam, Narayana P., Wainwright, Martin J.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY IEEE 01.07.2012 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Analytical models Applied sciences Coding theory Coding, codes Decoding Exact sciences and technology Graphical models Graphs High dimensional inference Image edge detection Information theory Information, signal and communications theory KL divergence between Ising models Markov analysis Markov processes Markov random fields Probability Random variables sample complexity Sample size Signal and communications theory structure of Ising models Telecommunications and information theory Vectors Error probability Probabilistic approach Necessary and sufficient condition Model selection structure of Ising models Decoding Markov model Markov random fields sample complexity Random field High dimensional inference Pairwise Markov model KL divergence between Ising models Ising model Information theory
ISSN:	0018-9448, 1557-9654
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!