Using complex network features for fast clustering in the web

Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011

Volumn , Issue , 2011, Pages 133-134

  Tang, Jintao ^a,b   Wang, Ting ^a   Wang, Ji ^c   Lu, Qin ^b   Li, Wenjie ^b  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

complex networks; graph clustering; parameter estimation

Indexed keywords

ADJUSTED RAND INDEX; COMPLEX NETWORKS; GRAPH CLUSTERING; NOVEL METHODS; PERFORMANCE OPTIMIZATIONS; PRIOR KNOWLEDGE; REAL-WORLD NETWORKS; RUN-TIME EFFICIENCY; SCALABILITY ISSUE; TOPOLOGICAL FEATURES;

CLUSTERING ALGORITHMS; OPTIMIZATION; WORLD WIDE WEB;

PARAMETER ESTIMATION;

EID: 79955147514     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1963192.1963260     Document Type: Conference Paper

References (8)

1. S. Milgram. The small world problem. 1967. Psychol Today 2, 60-67.
2. D. J. Watts and S. H. Strogatz. 1998. Collective dynamics of 'small-world' networks. Nature 393, 440-442.
3. A-L. Barabási, R. Albert. 1999.Emergence of scaling in random networks. Science 286, 509-512.
4. Leonard Kaufman and Peter J. Rousseeuw. 1990. Finding groups in data: an introduction to cluster analysis. WILEY SER PROB STAT. Wiley.
5. M. Girvan and M. E. J. Newman. 2002. Community structure in social and biological networks.PNAS 99 (12), 7821-7826.
6. Jintao Tang,Ting Wang, Ji Wang, and Dengping Wei. 2009. Efficient social network approximate analysis on blogosphere based on network structure characteristics. In Proc. SNA-KDD 09.
7. M. E. J. Newmanand M. Girvan. 2004. Finding and evaluating community structure in networks. PHYS REV E 69 (2), 026113.
8. A. McCallum, K. Nigam, J. Rennie, and K.Seymore. 1999. A Machine Learning Approach to Building Domain-Specific Search Engines. In Proc.IJCAI '99. 662-667.