Earticle

초록

영어

Most of the local community detection algorithms based on node similarity often simply count the number of common neighbors as the basis of selecting members of the community that cannot accurately measure the value of a common neighbor node in the information transmission of nodes. For this, we use the new concept of a common neighbor contribution; borrowed from the idea about the local modularity, put forward a new fast community detection algorithm. The algorithm accurately selects candidate nodes to join the community, according to the contribution of the common neighbor node, also without calculating local modularity for each common neighbor node, and greatly improved the accuracy and efficiency in merging Members. the experimental results of the computer-generated network and the real networks verified reliability and efficiency of the algorithm.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Algorithm
 4. Experimental Analysis
  4.1. Zachary Karate Club Network
  4.2. American Political Book Network
  4.3. American University Football Network
  4.4. Computer Generated Network
 5. Conclusion
 References

키워드

저자

• Tianhong Wang [ Department of Math , Xinzhou Teachers University, Xinzhou, China ]
• Xing Wu [ School of Computer Engineering and Science, Shanghai University, Shanghai, China ]
• Wangsen Lan [ Department of Math , Xinzhou Teachers University, Xinzhou, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605