Research on Community Detection Algorithm Based on the UIR-Q

Zilong Jiang, Wei Dai, Liangchen Chen, Xiufeng Cao, Yanling Shao


Aiming at the current problems of community detection algorithm in which user’s property is not used; the community structure is not stable and the efficiency of the algorithm is low, this paper proposes a community detection algorithm based on the user influence and its parallelization method. In terms of the concept of user influence in the subject communication and the PageRank algorithm, this paper uses the properties of nodes of users in social networks to form the user influence factors. Then, the user with the biggest influence is set as the initial node of new community and and the local modularity is introduced into detecting the community structure.  in order to make the result of community detection quick and efficient. Many experiments show that the improved algorithm can efficiently detect the community structure with large scale users and the results are stable. Therefore, this algorithm will have a wide applied prospect.


social networks; community detection; user influence; PageRank algorithm; local modularity

Full Text:



Article Metrics

Abstract view : 288 times
PDF - 328 times


  • There are currently no refbacks.

Copyright (c) 2019 Universitas Ahmad Dahlan

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus, 9th Floor, LPPI Room
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120 ext. 4902, Fax: +62 274 564604