Efficient algorithms for mining significant substructures in graphs with quality guarantees

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2007, Pages 163-172

  He, Huahai ^a   Singh, Ambuj K ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; DATA MINING; DECISION SUPPORT SYSTEMS; GRAPH THEORY; INFORMATION MANAGEMENT; MINING; POLYNOMIAL APPROXIMATION; SEARCH ENGINES;

APPROXIMATION RATIOS; EFFICIENT ALGORITHMS; INTERNATIONAL CONFERENCES; LARGE GRAPHS; LOCAL SUBSTRUCTURES; MINIMUM SPANNING TREE; MST PROBLEM; SCIENTIFIC DATA;

APPROXIMATION ALGORITHMS;

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

References (33)

1. R. Albert, H. Jeong, and A.-L. Barabasi. Diameter of the world-wide web. In Nature, pages 401:130-131, 1999.
2. S. Arora and G. Karakostas. A 2 + ∈ approximation algorithm for the k-MST problem. In Proc. of ACM-SIAM symposium on Discrete algorithms (SODA '00), pages 754-759, 2000.
3. S. Arya and H. Ramesh. A 2.5-factor approximation algorithm for the fc-MST problem. Information Processing Letters, 65(3):117-118, 1998.
4. B. Awerbuch, Y. Azar, A. Blum, and S. Vempala. Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. In Proc. of ACM Symposium on Theory Of Computing (STOC), pages 277-283, 1995.
5. L. Backstrom, D. P. Huttenlocher, J. M. Kleinberg, and X. Lan. Group formation in large social networks: membership, growth, and evolution. In KDD, pages 44-54, 2006.
6. G. Bader and C. Hogue. An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics, 4:2, 2003.
7. A. Blum, R. Ravi, and S. Vempala. A constant-factor approximation algorithm for the fc-MST problem. In Proc. of ACM symposium on Theory of computing (STOC '96), pages 442-448, 1996.
8. J. Chen, W. Hsu, M.-L. Lee, and S.-K. Ng. NeMoFinder: dissecting genome-wide protein-protein interactions with mesoscale network motifs. In KDD, pages 106-115, 2006.
9. Y. Chi, Y. Yang, and R. R. Muntz. Indexing and mining free trees. In ICDM, 2003.
10. S. Dongen. Graph Clustering by Flow Simulation. Phd thesis, University of Utrecht, May 2000.
11. R. Fagin, R. V. Guha, R. Kumar, J. Novak, D. Sivakumar, and A. Tomkins. Multi-structural databases. In Proc. of PODS, pages 184-195, 2005.
12. C. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In Proc. of KDD '04, 2004.
13. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In SIGCOMM, 1999.
14. N. Garg. A 3-approximation for the minimum tree spanning k vertices. In Proc. of Symposium on Foundations of Computer Science (FOCS '96), 1996.
15. N. Garg. Saving an epsilon: a 2-approximation for the k-MST problem in graphs. In Proc. of ACM symposium on Theory of computing (STOC '05), pages 396-402, 2005.
16. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296-317, 1995.
17. J. Hu, X. Shen, Y. Shao, C. Bystroff, and M. J. Zaki. Mining protein contact maps. In BIOKDD, 2002.
18. R. Jin, C. Wang, D. Polshakov, S. Parthasarathy, and G. Agrawal. Discovering frequent topological structures from graph datasets. In KDD, pages 606-611, 2005.
19. KEGG. http://www.genome.ad.jp/kegg/.
20. Y. Koren, S. C. North, and C. Volinsky. Measuring and extracting proximity in networks. In Proc. of KDD '06, 2006.
21. R. Kumar, K. Punera, and A. Tomkins. Hierarchical topic segmentation of websites. In Proc. of KDD '06, pages 257-266, 2006.
22. I. Lee, S. V. Date, A. T. Adai, and E. M. Marcotte. A probabilistic functional network of yeast genes. Science, 306:1555-1558, 2004.
23. J. Lee, J. Oh, and S. Hwang. STRG-index: Spatio-temporal region graph indexing for large video databases. In Proc. of SIGMOD, 2005.
24. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: Densification laws, shrinking diameters and possible explanations. In KDD, 2005.
25. R. Milo et al. Network motifs: Simple building blocks of complex networks. Science, October 2002.
26. J. Pei, D. Jiang, and A. Zhang. On mining cross-graph quasicliques. In KDD, pages 228-238, 2005.
27. S. Rajagopalan and V. Vazirani. Logarithmic approximation of minimum weight k trees. In Unpublished Manuscript, 1995.
28. E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A.-L. Barabasi. Hierarchical organization of modularity in metabolic networks. Science, volume 297, August 2002.
29. R. Ravi, R. Sundaram, M. Marathe, D. Rosenkrantz, and S. Ravi. Spanning trees short or small. In Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA), 1994.
30. C. Roberts et al. Signaling and circuitry of multiple MAPK pathways revealed by a matrix of global gene expression profiles. Science, 287:873-880, 2000.
31. J. Scott, T. Ideker, R. M. Karp, and R. Sharan. Efficient algorithms for detecting signaling pathways in protein interaction networks. In Proc. of RECOMB, pages 1-13, 2005.
32. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM, 2002.
33. X. Yan and J. Han. CloseGraph: Mining closed frequent graph patterns. In KDD, 2003.