Center-piece subgraphs: Problem definition and fast solutions

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn 2006, Issue , 2006, Pages 404-413

  Tong, Hanghang ^a   Faloutsos, Christos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Center piece subgraph; Goodness score; K_softAND

Indexed keywords

CENTER PIECE SUBGRAPH; DATASETS; K_SOFTAND; SOCIAL NETWORKS;

ALGORITHMS; APPROXIMATION THEORY; GENETIC ENGINEERING; LOGIC DESIGN; PROBLEM SOLVING; QUERY LANGUAGES;

GRAPH THEORY;

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

References (28)

1. B. Aditya, G. Bhalotia, S. Chakrabarti, A. Hulgeri, G. Nakhe, and S. S. Parag. Banks: Browsing and keyword searching in relational databases. In VLDB, pages 1083-1086, 2002.
2. R. Albert, H. Jeong, and A.-L. Barabasi. Diameter of the world wide web. Nature, (401):130-131, 1999.
3. A. Balmin, V. Hristidis, and Y. Papakonstantinou. Objectrank: Authority-based keyword search in databases. In VLDB, pages 564-575, 2004.
4. I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 03) Washington, DC, August 24-27 2003.
5. S. Dorogovtsev and J. Mendes. Evolution of networks. Advances in Physics, 51:1079-1187, 2002.
6. G. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In KDD, pages 118-127, 2004.
7. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. SIGCOMM, pages 251-262, Aug-Sept. 1999.
8. G. Flake, S. Lawrence, and C. Giles. Efficient identification of web communities. In KDD, pages 150-160, 2000.
9. G. Flake, S. Lawrence, C. L. Giles, and F. Coetzee. Self-organization and identification of web communities. IEEE Computer, 35(3), Mar. 2002.
10. F. Geerts, H. Mannila, and E. Terzi. Relational link-based ranking. In VLDB, pages 552-563, 2004.
11. D. Gibson, J. Kleinberg, and P. Raghavan. Inferring web communities from link topology. In Ninth ACM Conference on Hypertext and Hypermedia, pages 225-234, New York, 1998.
12. M. Girvan and M. E. J. Newman. Community structure is social and biological networks.
13. M. Grötschel, C. L. Monma, and M. Stoer. Design of survivable networks. In Handbooks in Operations Research and Management Science 7: Network Models. North Holland, 1993.
14. T. H. Haveliwala. Topic-sensitive pagerank. WWW, pages 517-526, 2002.
15. J. He, M. Li, H. Zhang, H. Tong, and C. Zhang. Manifold-ranking based image retrieval. In ACM Multimedia, pages 9-16, 2004.
16. G. Jeh and J. Widom. Simrank: A measure of structural-context similarity. In KDD, pages 538-543, 2002.
17. G. Karypis and V. Kumar. Parallel multilevel k-way partitioning for irregular graphs. SIAM Review, 41(2):278-300, 1999.
18. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. KDD, 2003.
19. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In Proc. CIKM, 2003.
20. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167-256, 2003.
21. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, pages 849-856, 2001.
22. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998. Paper SIDL-WP-1999-0120 (version of 11/11/1999).
23. C. R. Palmer and C. Faloutsos. Electricity based external similarity of categorical attributes. PAKDD 2003, April-May 2003.
24. J.-Y. Pan, H.-J, Yang, C. Faloutsos, and P. Duygulu. Automatic multimedia cross-modal correlation discovery. In KDD, pages 653-658, 2004.
25. C. Ramakrishnan, W. Milnor, M. Perry, and A. Sheth. Discovering informative connection subgraphs in multi-relational graphs. SIGKDD Explorations Special Issue on Link Mining, 2005.
26. J. Sun, H. Qu, D. Chakrabarti, and C. Faloutsos. Neighborhood formation and anomaly detection in bipartite graphs. In ICDM, pages 418-425, 2005.
27. D. Xin, J. Han, X. Yan, and H. Cheng. Mining compressed frequent-pattern sets. In VLDB, pages 709-720, 2005.
28. D. Zhou, O. Bousquet, T. Lal, J. Weston, and B. Scholkopf. Learning with local and global consistency. In NIPS, 2003.