Hemant Balakrishnan
ABSTRACT
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely related. Extraction of these communities facilitates better understanding of such networks. Community related research has focused on two main problems, community discovery and community identification. Community discovery is the problem of extracting all the communities in a given network whereas community identification is the problem of identifying the community to which a given set of nodes from the network belong. In this paper we first perform a brief survey of the existing community-discovery algorithms and then propose a novel approach to discovering communities using bibliographic metrics. We also test the proposed algorithm on real-world networks and on computer-generated models with known community structures.
- D. Gibson, J. M. Kleinberg, and P. Raghavan, "Inferring Web Communities from Link Topology," presented at 9th ACM Conference on Hypertext and Hypermedia, Pittsburgh, PA, 1998. Google Scholar
Digital Library
- S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, "Extracting Large-Scale Knowledge Bases from the Web," presented at Proceedings of 25th International Conference on Very Large Data Bases, 1999. Google ScholarDigital Library
- G. W. Flake, S. Lawrence, and C. L. Giles, "Efficient Identification of Web Communities," presented at Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2000. Google ScholarDigital Library
- S. M. Hedetniemi, S. T. Hedetniemi, and P. Kristiansen, "Alliances in Graphs," Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 48, pp. 157--177, 2004.Google Scholar
- M. Girvan and M. E. J. Newman, "Community Structure in Social and Biological Networks," Proceedings of the National Academy of Sciences of the United States of America, vol. 99, pp. 7821--7826, 2002.Google ScholarCross Ref
- J. Scott, Social Network Analysis: A Handbook: Sage Publications, 2000.Google Scholar
- F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi, "Defining and Identifying Communities in Networks," Proceedings of the National Academy of Sciences, vol. 101, pp. 2658--2663, 2004.Google ScholarCross Ref
- M. E. J. Newman and M. Girvan, "Finding and Evaluating Community Structure in Networks," Physical Review E, vol. 69, pp. 026113--1, 2004.Google ScholarCross Ref
- F. Wu and B. A. Huberman, "Finding Communities in Linear Time: a Physics Approach," The European Physics Journal B, vol. 38, pp. 331--338, 2004.Google ScholarCross Ref
- M. Kessler, "Bibliographic coupling between scientific papers," American Documentation, vol. 14, pp. 10--25, 1963.Google ScholarCross Ref
- H. Small, "Co-citation in the scientific litrature: A new measure of the relationship between two documents.," Journal of American Society for Information Science, vol. 24, pp. 265--269, 1973.Google ScholarCross Ref
- W. W. Zachary, "An information flow model for conflict and fission in small groups.," Journal of Anthropological Research, vol. 33, pp. 452--473, 1977.Google ScholarCross Ref
Index Terms
- Discovering communities in complex networks
Recommendations
Bibliometric approach to community discovery
ACM-SE 43: Proceedings of the 43rd annual Southeast regional conference - Volume 2Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely related. Extracting these communities would lead to a better ...
A classification for community discovery methods in complex networks
Many real-world networks are intimately organized according to a community structure. Much research effort has been devoted to develop methods and algorithms that can efficiently highlight this hidden structure of a network, yielding a vast literature ...
Comments