Efficient identification of overlapping communities

Lecture Notes in Computer Science

Volumn 3495, Issue , 2005, Pages 27-36

  Baumes, Jeffrey ^a   Goldberg, Mark ^a   Magdon Ismail, Malik ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; SOCIAL ASPECTS; SOCIETIES AND INSTITUTIONS;

CLUSTERS; COMMUNICATION GRAPH; SOCIAL NETWORKS;

IDENTIFICATION (CONTROL SYSTEMS);

EID: 24944526294     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427995_3     Document Type: Conference Paper

References (10)

1. J. Baumes, M. Goldberg, M. Krishnamoorty, M. Magdon-Ismail, and N. Preston. Finding communities by clustering a graph into overlapping subgraphs. Proceedings of IADIS Applied Computing 2005, pages 97-104, February 2005.
2. J. Baumes, M. Goldberg, M. Magdon-Ismail, and W. Wallace. Discovering hidden groups in communication networks. 2nd NSF/NIJ Symposium on Intelligence and Security Informatics, 2004.
3. J. Berry and M. Goldberg. Path optimization for graph partitioning problem. Discrete Applied Mathematics, 90:27-50, 1999.
4. U. Brandes, M. Gaertler, and D. Wagner. Experiments on graph clustering algorithms. Lecture Notes in Comuter Science, Di Battista and U. Zwick (Eds.):568-579, 2003.
5. P. Drineas, R. Kannan, A. Frieze, S. Vempala, and V. Vinay. Clustering in large graphs and matrices. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999.
6. G.W. Flake, K. Tsioutsiouliklis, and R.E. Tarjan. Graph clustering techniques based on minimum cut trees. Technical report, NEC, Princeton, NJ, 2002.
7. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice-Hall, 1988.
8. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49:291-307, 1970.
9. M. E. J. Newman. The structure and function of complex networks. SIAM Reviews, 45(2):167-256, June 2003.
10. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Stanford Digital Libraries Working Paper, 1998.