Network inference from co-occurrences

IEEE Transactions on Information Theory

Volumn 54, Issue 9, 2008, Pages 4053-4068

  Rabbat, Michael G ^a   Figueiredo, Mário A T ^b   Nowak, Robert D ^c  

^a MCGILL UNIVERSITY   (Canada)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^c University of Wisconsin Madison   (United States)

Author keywords

Expectation maximization (EM) algorithm; Graphical models; Importance sampling; Markov models; Network inference; Network tomography

Indexed keywords

BLIND SOURCE SEPARATION; BOOLEAN FUNCTIONS; COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL TRANSFORMATIONS; PARAMETER ESTIMATION; RANDOM PROCESSES;

EXPECTATION-MAXIMIZATION (EM) ALGORITHM; GRAPHICAL MODELS; IMPORTANCE SAMPLING; MARKOV MODELS; NETWORK INFERENCE; NETWORK TOMOGRAPHY;

COMPUTER NETWORKS;

EID: 51349143697     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.926315     Document Type: Article

References (29)

1. M. G. Rabbat, J. R. Treichler, S. L. Wood, and M. G. Larimore, "Understanding the topology of a telephone network via internally-sensed network tomography," in Proc. IEEE Int. Conf. Acoust. Speech Signal Process., Philadelphia, PA, Mar. 2005, vol. 3, pp. 977-980.
2. M. Coates, A. O. Hero, R. Nowak, and B. Yu, "Internet tomography," IEEE Signal Process. Mag., vol. 19, no. 3, pp. 47-65, May 2002.
3. E. Klipp, R. Herwig, A. Kowald, C. Wierling, and H. Lehrach, Systems Biology in Practice: Concepts, Implementation and Application. New York: Wiley, 2005.
4. B. O. Palsson, Systems Biology: Properties of Reconstructed Networks Cambridge, U.K.: Cambridge Univ. Press, 2006.
5. S. Wasserman, K. Faust, D. Iacobucci, and M. Granovetter, Social Network Analysis: Methods and Applications. Cambridge, U.K.: Cambridge Univ. Press, 1994.
6. M. Newman, A. L. Barabasi, and D. J. Watts, The Structure and Dynamics of Networks. Princeton, NJ: Princeton Univ. Press, 2006.
7. O. Sporns and G. Tononi, "Classes of network connectivity and dynamics," Complexity, vol. 7, no. 1, pp. 28-38, 2002.
8. O. Sporns, D. R. Chialvo, M. Kaiser, and C. C. Hilgetag, "Organization, development and function of complex brain networks," Trends Cogn. Sci., vol. 8, no. 9, 2004.
9. D. Zhu, A. O. Hero, H. Cheng, R. Khanna, and A. Swaroop, "Network constrained clustering for gene microarray data," Bioinformatics, vol. 21, no. 21, pp. 4014-4020, 2005.
10. Y. Liu and H. Zhao, "A computational approach for ordering signal transduction pathway components from genomics and proteonmics data," BMC Bioinformatics, vol. 5, no. 158, Oct. 2004.
11. J. Kubica, A. Moore, D. Cohn, and J. Schneider, "cGraph: A fast graph-based method for link analysis and queries," in Proc. IJCAIText-Mining Link-Anal. Workshop, Acapulco, Mexico, Aug. 2003, pp. 22-31.
12. D. Justice and A. O. Hero, "Estimation of message source and destination from link intercepts," IEEE Trans. Inf. Forens. Secur. vol. 1, no. 3, pp. 374-385, Sep. 2006.
13. D. Heckerman, D. Geiger, and D. Chickering, "Learning Bayesian networks: The combination of knowledge and statistical data," Mach. Learn., vol. 20, pp. 197-243, 1995.
14. N. Friedman and D. Koller, "Being Bayesian about Bayesian network structure: A Bayesian approach to structure discovery in Bayesian networks," Mach. Learn., vol. 50, no. 1-2, pp. 95-125, 2003.
15. M. Teyssier and D. Koller, "Ordering-based search: A simple and effective algorithm for learning Bayesian networks," in Proc. Conf. Uncertainty Artif. Intell., Edinburgh, Scotland, Jul. 2005, pp. 584-590.
16. J. Bernardo and A. Smith, Bayesian Theory. New York: Wiley, 1994.
17. G. C. G. Wei and M. A. Tanner, "A Monte Carlo implementation of the EM algorithm and the poor man's data augmentation algorithms," J. Amer. Statist. Assoc., vol. 85, pp. 699-704, 1990.
18. W. Jank, "Stochastic variants of the EM algorithm: Monte Carlo, quasi-Monte Carlo and more," in Proc. Joint Statistical Meetings, Minneapolis, MN, Aug. 2005.
19. G. Fort and E. Moulines, "Convergence of the Monte Carlo expectation maximization for curved exponential families," Ann. Statist., vol. 31, no. 4, pp. 1220-1259, 2003.
20. J. G. Booth, J. P. Hobert, and W. S. Jank, "A survey of Monte Carlo algorithms for maximizing the likelihood of a two-stage hierarchical model," Statist. Model., vol. 1, pp. 333-349, 2001.
21. C. Robert and G. Casella, Monte Carlo Statistical Methods. New York: Springer-Verlag, 1999.
22. J. S. Liu, Monte Carlo Strategies in Scientific Computing. New York: Springer-Verlag, 2001.
23. M. G. Rabbat, M. A. T. Figueiredo, and R. D. Nowak, "Network inference from co-occurrences" Dept. Electr. Comput. Eng., Univ. Wisconsin-Madison, Tech. Rep. ECE-06-02, 2006.
24. C. F. J. Wu, "On the convergence properties of the EM algorithm," Ann. Statist., vol. 11, no. 1, pp. 95-103, 1983.
25. R. A. Boyles, "On the convergence of the EM algorithm," J. Roy. Statist. Soc. B, vol. 45, no. 1, pp. 47-50, 1983.
26. B. S. Caffo, W. Jank, and G. L. Jones, "Ascent-based Monte Carlo EM," J. Roy. Statist. Soc. B, vol. 67, no. 2, pp. 235-252, 2005.
27. P. Gupta and P. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
28. D. Justice and A. Hero, "Online methods for network endpoint localization," IEEE Trans. Inf. Theory, Apr. 2007, submitted for publication.
29. W. J. Hoeffding, "Probability inequalities for sums of bounded random variables," J. Amer. Statist. Assoc., vol. 58, pp. 713-721, 1963.