Focused community discovery

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2005, Pages 4-7

  Hildrum, Kirsten ^a   Yu, Philip S ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; GRAPH THEORY; SCALABILITY;

COMMUNITY DISCOVERY; FOCUSED SEARCH; SOCIAL NETWORKS;

DATA MINING;

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

References (5)

1. B. Aiello, C. Kalmanek, P. McDaniel, S. Sen, O. Spatscheck, and J. V. der Merwe. Analysis of communities of interest in data networks. In Proceedings of PAM, 2005.
2. C. Cortes, D. Pregibon, and C. Volinsky. Communities of interest. In Proceedings IDA2001, 2001.
3. G. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 150-160, Boston, MA, August 20-23 2000.
4. G. Flake, R. Tarjan, and K. Tsioutsiouliklis. Graph clustering and minimum cut trees. J. of Internet Mathematics.
5. H. Ino, M. Kudo, and A. Nakamura. Partitioning of web graphs by community topology. In WWW '05: Proceedings of the 14th international conference on World Wide Web, pages 661-669, 2005.