Mining community structures in Peer-to-peer environments

Ching Hua Yu, Wen Chih Peng, Wang Chien Lee

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

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
DOIs
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

Fingerprint

Merging

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

@article{e5a80a76941044b7b8515541e89907d3,
title = "Mining community structures in Peer-to-peer environments",
abstract = "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.",
author = "Yu, {Ching Hua} and Peng, {Wen Chih} and Lee, {Wang Chien}",
year = "2008",
month = "12",
day = "1",
doi = "10.1109/ICPADS.2008.93",
language = "English (US)",
pages = "351--358",
journal = "Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS",
issn = "1521-9097",

}

Mining community structures in Peer-to-peer environments. / Yu, Ching Hua; Peng, Wen Chih; Lee, Wang Chien.

In: Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS, 01.12.2008, p. 351-358.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Mining community structures in Peer-to-peer environments

AU - Yu, Ching Hua

AU - Peng, Wen Chih

AU - Lee, Wang Chien

PY - 2008/12/1

Y1 - 2008/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=60649106963&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=60649106963&partnerID=8YFLogxK

U2 - 10.1109/ICPADS.2008.93

DO - 10.1109/ICPADS.2008.93

M3 - Conference article

AN - SCOPUS:60649106963

SP - 351

EP - 358

JO - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

JF - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

SN - 1521-9097

M1 - 4724339

ER -