Mining Community Structures in Peer-to-Peer Environments

檔案

日期

2008

期刊名稱

PROCEEDINGS OF THE 2008 14TH IEEE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS

卷期與頁次

頁 351–358

ISBN

978-0-7695-3434-3

語言

英文

摘要

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 asynchronous fashion. Experimental results show that ACM is able to discover community structures with high quality while outperforming the existing approaches.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Yu, C.-H., Peng, W.-C., & Lee, W.-C. (2008). Mining Community Structures in Peer-to-Peer Environments. PROCEEDINGS OF THE 2008 14TH IEEE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, 351–358. https://doi.org/10.1109/ICPADS.2008.93

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/1153