Metropolis algorithms for representative subgraph sampling

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2008, Pages 283-292

  Hübler, Christian ^a   Kriegel, Hans Peter ^a   Borgwardt, Karsten ^b   Ghahramani, Zoubin ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CHEMOINFORMATICS; CLASSIC ALGORITHM; DATA ANALYSIS; EFFICIENT ALGORITHM; GRAPH DATA; GRAPH PROPERTIES; GRAPH SIZES; LARGE GRAPHS; METROPOLIS ALGORITHMS; MINING FACE; SUBGRAPH; SYSTEMS BIOLOGY;

INFORMATION MANAGEMENT; MINING;

ALGORITHMS;

EID: 67049137972     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2008.124     Document Type: Conference Paper

References (17)

1. http://www.cs.cornell.edu/projects/kddcup/datasets.html
2. http://www.routeviews.org/
3. P. Dobson and A. Doig. Distinguishing enzymes structures from non-enzymes without alignments. In Journal of Molecular Biology, volume 330, pages 771-783, 2003.
4. A. Gilbert and K. Levchenko. Compressing network graphs. In Proceedings of the LinkKDD workshop at the 10th ACM Conference on KDD, 2004.
5. K. Hastings. Equation of state calculations by fast computing machines. In Biometrika. 57, pages 97-109, 1970.
6. S. Itzkovitz, R. Milo, N. Kashtan, G. Ziv, and U. Alon. Subgraphs in random networks. Physical Rev. E, 68, 2003.
7. S. Kirkpatrick, C. Gelatt, and M. Vecchi. Optimization by simulated annealing. In Science, Volume 220, Number 4598, pages 671-680, 1983.
8. V. Krishnamurthy, M. Faloutsos, M. Chrobak, L. Lao, J. Cui, and A. Percus. Reducing large internet topologies for faster simulations. In Proceedings of the IFIP Networking, Waterloo, Canada, 2005.
9. J. Leskovec and C. Faloutsos. Sampling from large graphs. In KDD, 2006.
10. J. Leskovec and C. Faloutsos. Scalable modeling of real graphs using kronecker multiplication. In ICML, pages 497- 504, New York, NY, USA, 2007. ACM.
11. N. Metropolis, A. Rosenbluth, N. Rosenbluth, and A. Teller. Equation of state calculations by fast computing machines. In The Journal of Chemical Physics, Volume 21, Number 6, pages 1087-1092, 1953.
12. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network motifs: Simple building blocks of complex networks. Science, 298:824-827, 2002. (Pubitemid 35231534)
13. R. M. Neal. Probabilistic inference using Markov chain Monte Carlo methods. Technical Report CRG-TR-93-1, University of Toronto, 1993.
14. N. Przulj, D. G. Corneil, and I. Jurisica. Modeling interactome: scale-free or geometric? In Bioinformatics 2004 20(18), pages 3508-3515, 2004. (Pubitemid 40136786)
15. D. Rafiei and S. Curial. Effectively visualizing large networks through sampling. In Proc. of the IEEE Visualization Conference, 2005.
16. L. Salwinski, C.Miller, A. Smith, J. Pettit, F.and Bowie, and D. Eisenberg. The database of interacting proteins: 2004 update. 2004.
17. S. Wernicke. Efficient detection of network motifs. IEEE/ACM Trans. Comput. Biol. Bioinformatics, 3(4):347-359, 2006. (Pubitemid 44950084)