Graph model selection using maximum likelihood

ICML 2006 - Proceedings of the 23rd International Conference on Machine Learning

Volumn 2006, Issue , 2006, Pages 105-112

  Bezáková, Ivona ^a   Kalai, Adam ^b   Santhanam, Rahul ^c  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^c SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH MODEL SELECTION; INTERNET TOPOLOGY; PROBABILITY DISTRIBUTION; RANDOM GRAPH MODEL;

INTERNET; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY; RANDOM PROCESSES; TOPOLOGY;

GRAPH THEORY;

EID: 33749265505     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Aiello, W., Chung, F., & Lu, L. (2000). A random graph model for massive graphs. Proceedings of ACM Symposium on Theory of Computing.
2. Barabási, A., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286, 509-512.
3. Barabási, A. L., Albert, R., & Jeong, H. (2000). Scale-free characteristics of random networks: topology of the world-wide web. Physica A, 281, 69.
4. Barabási, A.-L., & Oltvai, Z. (2004). Network biology: Understanding the cells functional organization. Nature Reviews Genetics, 5, 101-113.
5. Bollobás, B. (1985). Random graphs. Academic Press.
6. Bork, P., Jensen, L., von Mering, C., Ramani, A., Lee, I., & Marcotte, E. (2004). Protein interaction networks from yeast to human. Current Opinion in Structural Biology, June 14(3), 292-9.
7. Bu, T., & Towsley, D. F. (2002). On distinguishing between internet power law topology generators. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM-02) (pp. 638-647).
8. Chen, S., Beeeferman, D., & Rosenfeld, R. (1998). Evaluation metrics for language models. DARPA Broadcast News Transcription and Understanding Workshop.
9. Chen, S., & Rosenfeld, R. (1999). Efficient sampling and feature selection in whole sentence maximum entropy language models. Proceedings of ICASSP '99.
10. CONDOR (2005). University of Wisconsin at Madison. http://www.cs.wisc.edu/condor/.
11. Gao, L. (2001). On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on Networking, 9, 733-745.
12. Kleinberg, J. (2000). The small-world phenomenon: an algorithm perspective. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (pp. 163-170).
13. Kubica, J., Moore, A., Cohn, D., & Schneider, J. (2003). Finding underlying connections: A fast graph-based method for link analysis and collaboration queries. Proceedings of Twentieth International Conference on Machine Learning.
14. 4) volume algorithm. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computing (pp. 650-).
15. Medina, A., Matta, I., & Byers, J. (2000). On the origin of power laws in internet topologies. Computer Communications Review, 30, 18-28.
16. Mitzenmacher, M. (2001). A brief history of generative models for power law and log normal distributions. Proceedings of the 39th Annual Allerton Conference on Communication, Control, and Computing (pp. 182-191).
17. NLANR (2001). National Laboratory for Applied Network Research Routing data. http://moat.nlanr.net/Routing/rawdata/.
18. Rissanen, J. (1978). Modeling by shortest data description. Automatica, 14, 265-271.
19. Siganos, G., Faloutsos, M., Faloutsos, P., & Faloutsos, C. (2003). Power laws and the AS-level internet topology. IEEE/ACM Transactions on Networking, 11, 514-524.
20. Tangmunarunkit, H., Govindan, R., Shenker, S., Jamin, S., & Willinger, W. (2002). Network topology generators: Degree-based vs. structural. Proceedings of ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (pp. 147-160).
21. Watts, D., & Strogatz, S. (1998). Collective dynamics of 'small-world' networks. Nature, 393, 440-442.