Mining scale-free networks using geodesic clustering

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 719-724

  Wu, Andrew Y ^a   Garland, Michael ^a   Han, Jiawei ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

Clustering; Graphs; Scale free networks; Social networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA MINING; DATA REDUCTION; DATA STRUCTURES; MATHEMATICAL MODELS; SET THEORY; SOCIAL ASPECTS; VISUALIZATION;

CLUSTERING; GEODESIC CLUSTERING; SCALE-FREE NETWORKS; SOCIAL NETWORKS;

GRAPH THEORY;

EID: 12244258501     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014052.1014146     Document Type: Conference Paper

References (21)

1. A. L. Barabási, R. Albert, H. Jeong, and G. Bianconi. Power-law distribution of the world wide web. Science, 287, 2000.
2. B. Bollobas. Random Graphs. Cambridge University Press, second edition, 2001.
3. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. In Proceedings of the Seventh International Conference on World Wide Web 7, pages 107-117. Elsevier Science Publishers B. V., 1998.
4. P. Domingos and M. Richardson. Mining the network value of customers. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 57-66. ACM Press, 2001.
5. Z. Drezner and H. W. Hamacher. Facility Location: Applications and Theory. Springer, 2002.
6. M. Garland. Multiresolution modeling: Survey & future opportunities. In State of the Art Report, pages 111-131. Eurographics, Sept. 1999.
7. L. Holder, D. Cook, and S. Djoko. Substructure discovery in the subdue system. In Proceedings of the Workshop on Knowledge Discovery in Databases, pages 169-180, 1994.
8. H. Jeong, S. P. Mason, A. L. Barabási, and Z. Oltvai. Lethality and centrality in protein networks. In Nature, volume 411, pages 41-42, 2001.
9. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5):604-632, 1999.
10. V. Krebs. Mapping networks of terrorist cells. Connections, 24, 2001.
11. B. Mirkin. Mathematical Classification and Clustering. Kluwer Academic Publishers, 1996.
12. M. E. J. Newman. The structure and function of complex networks. In SIAM Review, volume 45, pages 167-256, 2003.
13. M. E. J. Newman. Detecting community structure in networks, In Eur. Phys. J. B., 2004.
14. J. O'Madadhain, D. Fisher, S. White, and Y. Bosy. The JUNG (Java Universal Network/Graph) framework. Technical report, UC Irvine, 2003.
15. M. Richardson and P. Domingos. Mining knowledge-sharing sites for viral marketing. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 61-70. ACM Press, 2002.
16. K. Schloegel, G. Karypis, and V. Kumar, Graph partitioning for high performance scientific simulations. In CRPC Parallel Computing Handbook. Morgan Kaufmann, 2000.
17. T. Washio and H. Motoda. State of the art of graph-based data mining. SIGKDD Explor. Newsl., 5(1):59-68, 2003.
18. S. Wasserman and K. Faust. Social network analysis. Cambridge University Press, Cambridge, 1994.
19. S. White and P. Smyth. Algorithms for estimating relative importance in networks. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 266-275. ACM Press, 2003.
20. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In Proc. 2002 Int. Conf. on Data Mining (ICDM'02), 2002.
21. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In ACM SIGMOD Intl. Conf. on Management of Data, pages 103-114, June 1996.