簡易檢索 / 詳目顯示

研究生: 張又升
You-sheng Chang
論文名稱: 分散式社群偵測的研究
An Algorithm for Distributed Community Detection
指導教授: 陳秋華
Chyou-Hwa Chen
口試委員: 李育杰
Yuh-Jye Lee
鄧惟中
Wei-Chung Teng
項天瑞
Tien-Ruey Hsiang
學位類別: 碩士
Master
系所名稱: 電資學院 - 資訊工程系
Department of Computer Science and Information Engineering
論文出版年: 2012
畢業學年度: 100
語文別: 中文
論文頁數: 42
中文關鍵詞: P2P網路局部社群社群偵測
外文關鍵詞: P2P networks, local community, community detection
相關次數: 點閱:196下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 至目前為止有相當多的研究領域在辨認網絡中的群聚(community),像是全球資訊網(World Wide Web),大型社群網絡,要求一個演算法完全完成群聚的定義是不切實際的。
    因此,一系列的分散式群聚偵測演算法被提了出來,然而這些演算法的效能仍然有進步的空間。在這篇論文裡,我在局部社群結構(local community structure)的基礎上提出了一套新的演算法。我們使用合成和真實世界的網路資訊,如美式足球比賽,並將結果跟以往的分散式群聚偵測演算法做比較,實驗結果驗證了我們演算法的有效性。


    There has been much recent interest on identifying communities in networks. For some networks, e.g. the World Wide Web, large online social networks, algorithms that require complete network information is impractical. Therefore, a number of distributed community detection algorithms have been proposed. However, their performance still leaves something to be desired. In this paper, we propose a new distributed community detection algorithm based on local community structure. We compare our results with previous methods experimentally using both synthetic and real world network datasets such as the National Collegiate Athletic Association (NCAA) football. Experimental results verify the effectiveness of our approach.

    誌謝 摘要 Abstract 目錄 圖表目錄 1緒論 …………………………………………………………………………1 2社群測量方法………………………………………………………………3 2.1模組性Q ………………………………………………………………3 2.2傳導性φ………………………………………………………………5 3相關議題 …………………………………………………………………7 3.1集中式演算法…………………………………………………8 3.2分散式演算法 ………………………………………………9 4改良演算法 ………………………………………………………………10 4.1符號表示 ……………………………………………………………11 4.2演算法架構 …………………………………………………………11 4.3演算法範例 …………………………………………………………13 5實驗效能……………………………………………………………………27 5.1環境參數 ……………………………………………………………27 5.2實驗效能評估 ………………………………………………………29 6結論 ………………………………………………………………………36 7 參考文獻 ……………………………………………………………… 37

    1.Aaron Clauset, M. E. J. Newman, and Cristopher Moore,Finding community structure in very large networks,Phys. Rev. E 70, 066111 (2004).
    2.Guillaume-Jean Herbiet, Pascal Bouvry, "SHARC: Community-based partitioning for mobile ad hoc networks using neighborhood similarity." wowmom, pp.1-9, 2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2010
    3.Eleonora Borgia, Marco Conti, Andrea Passarella: Autonomic detection of dynamic social communities in Opportunistic Networks. Med-Hoc-Net 2011: 142-149
    4.P. Hui, E. Yoneki, S.-Y. Chan, and J. Crowcroft,“Distributed community detection in delay tolerant networks.” in Proceedings of MobiArch’07,2007.
    5.A. Clauset, “Finding local community structure in networks.”
    Physical Review E 72, 026132 (2005).
    6.F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and
    D. Parisi, Defining and identifying communities in networks.
    Proc. Natl. Acad. Sci. USA 101, 2658-2663(2004).
    7.M. E. J. Newman, Fast algorithm for detecting community
    structure in networks. Phys. Rev. E 69, 066133(2004).
    8.J. Xie and B. Szymanski, "Towards Linear Time Overlapping Community Detection in Social Networks", PAKDD 2012
    9.Finding and evaluating community structure in networks, M. E. J. Newman and M. Girvan, Phys. Rev. E 69, 026113 (2004)..
    10.M. Ding, X. Cheng, and G. Xue, Aggregation tree construction in sensor networks, Proc. Of IEEE VTC 2003, Vol. 4, pp. 2168-2172, Oct 6-9, 2003
    11. I. X. Y. Leung, P. Hui, P. Li`o, and J. Crowcroft, “Towards Real-Time Community Detection in Large Networks,” Physical Review E(Statistical, Nonlinear, and Soft Matter Physics), vol. 79, no. 6, pp.066 107+, 2009.

    無法下載圖示 全文公開日期 2017/08/06 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)
    全文公開日期 本全文未授權公開 (國家圖書館:臺灣博碩士論文系統)
    QR CODE