Abstract
One of the central problems in studying and understanding complex networks, such as online social networks or World Wide Web, is to discover hidden, either physically (e.g., interactions or hyperlinks) or logically (e.g., profiles or semantics) well-defined topological structures. From a practical point of view, a good example of such structures would be so-called network communities. Earlier studies have introduced various formulations as well as methods for the problem of identifying or extracting communities. While each of them has pros and cons as far as the effectiveness and efficiency are concerned, almost none of them has explicitly dealt with the potential relationship between the global topological property of a network and the local property of individual nodes. In order to study this problem, this paper presents a new algorithm, called ICS, which aims to discover natural network communities by inferring from the local information of nodes inherently hidden in networks based on a new centrality, that is, clustering centrality, which is a generalization of eigenvector centrality. As compared with existing methods, our method runs efficiently with a good clustering performance. Additionally, it is insensitive to its built-in parameters and prior knowledge.
- Bonacich, P. F. 1972. Factoring and weighting approaches to status scores and clique identification. J. Math. Sociol. 2, 113--120.Google Scholar
Cross Ref
- Bonacich, P. F. 1987. Power and centrality: A family of measures. Amer. J. Sociol. 92, 1170--1182.Google Scholar
Cross Ref
- Brandes, U. 2001. A faster algorithm for betweenness centrality. J. Mathe. Sociol. 25, 163-- 177.Google Scholar
Cross Ref
- Chakrabarti, D., Papadimitriou, S., Modha, D. S., and Faloutsos, C. 2004. Fully automatic cross-associations. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Seattle, WA. 79--88. Google Scholar
Digital Library
- Chakrabarti, S., van der Berg, M., and Dom, B. 1999. Focused crawling: A new approach to topic-specific Web resource discovery. In Proceedings of the 8th International Conference on World Wide Web. Toronto, Canada. Elsevier North-Holland. 1623--1640. Google Scholar
Digital Library
- Dhillon, I. S., Mallela, S., and Modha, D. S. 2003. Information-theoretic co-clustering. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Seattle, WA. 89--98. Google Scholar
Digital Library
- Fiedler, M. 1973. Algebraic connectivity of graphs. Czech. Math. J. 23, 298--305.Google Scholar
Cross Ref
- Flake, G.W., Lawrence, S., Giles, C. L., and Coetzee, F. 2002. Self-organization and identification of Web communities. IEEE Comput. 35, 66--71. Google Scholar
Digital Library
- Freeman, L. C. 1977. A set of measures of centrality based upon betweenness. Sociometry 40, 35--41.Google Scholar
- Girvan, M. and Newman, M. E. J. 2002. Community structure in social and biological networks. Proceedings of the National Academy of Sciences 99, 7821--7826.Google Scholar
Cross Ref
- Hotelling, H. 1936. Simplified calculation of principal component. Psychometrika 1, 27--35.Google Scholar
Cross Ref
- Imrich, W. and Klavzar, S. 2000. Product Graphs: Structure and Recognition, John Wiley.Google Scholar
- Kernighan, B. W. and Lin, S. 1970. An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. 49, 291--307.Google Scholar
Cross Ref
- Kleinberg, J. M. 1999. Authoritative sources in a hyperlinked environment. J. ACM 46, 604-- 632. Google Scholar
Digital Library
- Kumar, R., Raghavan, P., Rajagopalan, S., and Tomkins, A. 1999. Trawling the Web for emerging cyber communities. In Proceedings of the 8th International Conference on World Wide Web. Toronto, Canada. Elsevier North-Holland. 1481--1493. Google Scholar
Digital Library
- Liu, J., Jin, X. L., and Tsui, K. C. 2004. Autonomy Oriented Computing (AOC): From Problem Solving to Complex Systems Modeling. Kluwer Academic Publishers. Google Scholar
Digital Library
- Liu, J., Jin, X. L., and Tsui, K. C. 2005. Autonomy oriented computing (AOC): Formulating computational systems with autonomous components. IEEE Trans. Syst., Man, Cybern. Part A: Syst. Humans 35, 879--902. Google Scholar
Digital Library
- Lusseau, D. 2003. The emergent properties of a dolphin social network. In Proceedings of the Royal Society of London B 270, S186--S188.Google Scholar
Cross Ref
- Newman, M. E. J. 2001. Scientific collaboration networks II: Shortest paths, weighted networks, and centrality. Phys. Rev. E 64, 016132.Google Scholar
Cross Ref
- Newman, M. E. J. 2004a. Detecting community structure in networks. European Phys. J. B 38, 321--330.Google Scholar
Cross Ref
- Newman, M. E. J. 2004b. Fast algorithm for detecting community structure in networks. Phys. Rev. E, 69, 066133.Google Scholar
Cross Ref
- Newman, M. E. J. and Girvan, M. 2004. Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113.Google Scholar
Cross Ref
- Pirolli, P., Pitkow, J., and Rao, R. 1996. Silk from a sow's ear: Extracting usable structures from the Web. In Proceeding of Human Factors in Computing Systems. Vancouver, Canada. ACM Press, New York. 118--125. Google Scholar
Digital Library
- Pothen, A., Simon, H., and Liou, K. P. 1990. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11, 430--452. Google Scholar
Digital Library
- Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., and Parisi, D. 2004. Defining and identifying communities in networks. Proceedings of the National Academy of Sciences 101, 2658--2663.Google Scholar
Cross Ref
- Reichardt, J. and Bornholdt, S. 2004. Detecting fuzzy community structure in complex networks with a Potts model. Phys. Rev. Lett. 93, 218701.Google Scholar
Cross Ref
- Scott, J. 2000. Social Network Analysis: A Handbook. Sage Publications, London, UK.Google Scholar
- Shi, J. and Malik, J. 2000. Normalized cuts and image segmentation. IEEE Trans. Patt. Anal. Mach. Intell. 22, 888--904. Google Scholar
Digital Library
- Tyler, J. R., Wilkinson, D. M., and Huberman, B. A. 2003. Email as spectroscopy: automated discovery of community structure within organizations. In Proceeding of 1st International Conference on Communities and Technologies. Amsterdam, Netherlands, Sept. Huysman, M., Wenger, E., and Wulf, V. Eds. Kluwer. 81--96. Google Scholar
Digital Library
- Wu, F. and Huberman, B. A. 2004. Finding communities in linear time: A physics approach. European Phys. J. B 38, 331--338.Google Scholar
Cross Ref
- Yang, B., Cheung, W. K., and Liu, J. 2007. Community mining from signed social networks. IEEE Trans. Knowl. Data Engin. 19, 1333--1348. Google Scholar
Digital Library
- Yang, B. and Liu, J. 2007. An autonomy oriented computing (AOC) approach to distributed network community mining. In Proceedings of the 1st International Conference on Self-Adaptive and Self-Organizing Systems. Boston, MA. 151--160. Google Scholar
Digital Library
- Zachary, W. W. 1977. An information flow model for conflict and fission in small groups. J. Anthro. Res. 33, 452--473.Google Scholar
Cross Ref
Index Terms
Discovering global network communities based on local centralities
Recommendations
A Random Network Ensemble Model Based Generalized Network Community Mining Algorithm
ASONAM '11: Proceedings of the 2011 International Conference on Advances in Social Networks Analysis and MiningThe ability to discover community structures from explorative networks is useful for many applications. Most of the existing methods with regard to community mining are specifically designed for assortative networks, and some of them could be applied to ...
Centrality-based bipartite local community detection algorithm
ICC '17: Proceedings of the Second International Conference on Internet of things, Data and Cloud ComputingAs a kind of typical complex network, bipartite network has already received many specialized research. Local community detection is very useful for bipartite network, but it has not yet been systematically researched. To guarantee equivalent ...
Key Author Analysis in Research Professionals' Collaboration Network based on MST using Centrality Measures
ICTCS '16: Proceedings of the Second International Conference on Information and Communication Technology for Competitive StrategiesThe importance of an actor in the network is measured by the different type of centrality metrics of Social Network Analysis (SNA). In the research community, who are the most prominent author or key on the network is the major discussion or research ...






Comments