The Community for Technology Leaders
Green Image
Issue No. 04 - Dec. (2014 vol. 2)
ISSN: 2168-6750
pp: 436-447
Yuqing Zhu , Dept. of Comput. Sci., California State Univ., Los Angeles, CA, USA
Deying Li , Sch. of Inf., Renmin Univ. of China, Beijing, China
Wen Xu , Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA
Weili Wu , Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA
Lidan Fan , Dept. of Comput. Sci., Univ. of Texas at Tyler, Tyler, TX, USA
James Willson , Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA
ABSTRACT
Social networks have shown increasing popularity in real-world applications. Community detection is one of the fundamental problems. In this paper, we study how to partition the social networks into communities from a novel perspective. We define the mutual closeness and strangeness between each vertex pairs, and formulate our problem as a semidefinite program considering both the tightness of the same community and the looseness across different communities. Two NP-hard issues are addressed. One is to partition the social networks into communities through maximizing the tightness within the same community and the looseness between different communities. In the other issue, we take community volume into consideration such that the obtained communities have similar sizes. We give the mathematical models and the objective functions, and then analyze the performance bounds of the proposed algorithms. At last, we validate our method's effectiveness by comparing them with a highly effective existing partitioning method on real-world and artificial data sets.
INDEX TERMS
social networking (online), computational complexity, network theory (graphs)
CITATION

Yuqing Zhu, Deying Li, Wen Xu, Weili Wu, Lidan Fan and J. Willson, "Mutual-Relationship-Based Community Partitioning for Social Networks," in IEEE Transactions on Emerging Topics in Computing, vol. 2, no. 4, pp. 436-447, 2015.
doi:10.1109/TETC.2014.2380391
269 ms
(Ver 3.3 (11022016))