Mining community structures in Peer-to-peer environments

Ching Hua Yu, Wen Chih Peng, Wang Chien Lee

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations


Most social networks exhibit community structures, in which nodes are tightly connected to each other within a community but only loosely connected to nodes in other communities. Researches on community mining have received a lot of attention; however, most of them are based on a centralized system model and thus not applicable to the distributed model of P2P networks. In this paper, we propose a distributed community mining algorithm, namely Asynchronous Clustering and Merging scheme (ACM), for computing environments. Due to the dynamic and distributed nature of P2P networks, The ACM scheme employs an asynchronous strategy such that local clustering is executed without requiring an expensive global clustering to be performed in a synchronous fashion. Experimental results show that ACM is able to discover community structures with high quality while outperforming the existing approaches.

Original languageEnglish (US)
Article number4724339
Pages (from-to)351-358
Number of pages8
JournalProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
StatePublished - Dec 1 2008
Event2008 14th IEEE International Conference on Parallel and Distributed Systems, ICPADS'08 - Melbourne, VIC, Australia
Duration: Dec 8 2008Dec 10 2008

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture


Dive into the research topics of 'Mining community structures in Peer-to-peer environments'. Together they form a unique fingerprint.

Cite this