Volume 5 Number 10 (Oct. 2010)
Home > Archive > 2010 > Volume 5 Number 10 (Oct. 2010) >
JSW 2010 Vol.5(10): 1121-1127 ISSN: 1796-217X
doi: 10.4304/jsw.5.10.1121-1127

A New Community Division based on Coring Graph Clustering

Peng Ling, Xu Ting-rong, Lan Meng

College of computer science, Soochow university, Suzhou, 215006,China

Abstract—A new community finding algorithm, based on the greedy algorithm with graph clustering by computing the density variation sequence and identifying core nodes, number of communities, partition the certain nodes to some belonged community with the similarity of characteristics of communication behavior by continuous readjusting the centrality of the communities. The use of community density and effective diameter to measure the quality of the community partition on the real datasets of email corpus shows the feasibility and effectiveness of the proposed algorithm.

Index Terms—graph clustering; mail community partition; dynamic centering.

[PDF]

Cite: Peng Ling, Xu Ting-rong, Lan Meng, "A New Community Division based on Coring Graph Clustering," Journal of Software vol. 5, no. 10, pp. 1121-1127, 2010.

General Information

ISSN: 1796-217X (Online)
Frequency:  Quarterly
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, CNKIGoogle Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsweditorialoffice@gmail.com
  • Mar 01, 2024 News!

    Vol 19, No 1 has been published with online version    [Click]

  • Apr 26, 2021 News!

    Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec)     [Click]

  • Nov 18, 2021 News!

    Papers published in JSW Vol 16, No 1- Vol 16, No 6 have been indexed by DBLP   [Click]

  • Jan 04, 2024 News!

    JSW will adopt Article-by-Article Work Flow

  • Nov 02, 2023 News!

    Vol 18, No 4 has been published with online version   [Click]