The Complexity of Distinguishing Markov Random Fields-Reference-Cited by-同舟云学术

The Complexity of Distinguishing Markov Random Fields

Published: Issue: Volume: Page:331-342
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bogdanov Andrej,Mossel Elchanan,Vadhan Salil

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-85363-3_27.pdf

Reference23 articles.

1. Friedman, N.: Infering cellular networks using probalistic graphical models. Science (2004)

2. Kasif, S.: Bayes networks and graphical models in computational molecular biology and bioinformatics, survey of recent research (2007), http://genomics10.bu.edu/bioinformatics/kasif/bayes-net.html

3. Felsenstein, J.: Inferring Phylogenies. Sinauer, New York (2004)

4. Mathematics and its Applications series;C. Semple,2003

5. Erdös, P.L., Steel, M.A., Székely, L.A., Warnow, T.A.: A few logs suffice to build (almost) all trees (part 1). Random Structures Algorithms 14(2), 153–184 (1999)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Understanding financial distress by using Markov random fields on linked administrative data;Statistical Journal of the IAOS;2023-12-15

3. Graph Learning Over Partially Observed Diffusion Networks: Role of Degree Concentration;IEEE Open Journal of Signal Processing;2022

4. Learning restricted Boltzmann machines via influence maximization;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23

5. Communication Complexity of Statistical Distance;ACM Transactions on Computation Theory;2018-01-30