Studies of community structure and evolution in large social networks require fast and accurate algorithms for community detection. Among the existing algorithms for community detection, the label propagation algorithm (LPA) and the Newman modularity Q algorithm (NMA) have been widely used and studied in the community detection in large social networks, since the LPA has the advantages of near-linear running time, easy implementation and without requiring parameters, and the NMA is a relatively fast algorithm and has a clear metrics to measure community structure. However, the LPA has the shortcomings that the result of the community detection is instable and has a low quality. At the same time, disadvantages of the NMA are that it bases its decisions on purely local information about individual communities and gets the local optimal solution. In this paper, combined with these two algorithms, we propose a new community detection algorithm (LP-NMA), which extends the above two algorithms (the LPA and the NMA is a special case of the new algorithm respectively). The new algorithm not only retains the advantages of these two algorithms, but also has improved the stability and quality of community detection. Experiments on real social networks have proved that this method is better than the original LPA and NMA.
목차
Abstract 1. Introduction 1.1. Splitting Algorithm 1.2. Aggregating Algorithms 1.3. Other Algorithms 2. Related Work 2.1. Case Study of LPA 2.2. The NM Modularity Clustering Algorithm 3. The LP-NMA 4. Evaluation of Performance 4.1. Time Complexity 4.2. Tests on Real-World Social Networks 5. Conclusion Acknowledgement References
키워드
Community DetectionLabel Propagation AlgorithmModularity
저자
Junheng Huang [ School of Computer Science and Technology, Harbin Institute of Technology, Weihai 264209, China ]
Yushan Sun [ School of Computer Science and Technology, Harbin Institute of Technology, Weihai 264209, China ]
Yang Liu [ School of Computer Science and Technology, Harbin Institute of Technology, Weihai 264209, China ]
Bailing Wang [ School of Computer Science and Technology, Harbin Institute of Technology, Weihai 264209, China ]
보안공학연구지원센터(IJUNESST) [Science & Engineering Research Support Center, Republic of Korea(IJUNESST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of u- and e- Service, Science and Technology
간기
격월간
pISSN
2005-4246
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of u- and e- Service, Science and Technology Vol.8 No.1