中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/65644
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 78937/78937 (100%)
Visitors : 39425329      Online Users : 395
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/65644


    Title: 利用核心節點及區域社群以改善社群探勘之凝聚法技術的方法;A Novel method based on the agglomerative technique to improve the community detection by finding the core node and the local community
    Authors: 黃學惇;Huang,Hsueh-tun
    Contributors: 資訊管理學系
    Keywords: 社群探勘;核心節點;區域社群;凝聚法;居中度;相關性;community detection;core node;local community;agglomerative;betweenness;relation
    Date: 2014-07-11
    Issue Date: 2014-10-15 17:07:04 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 近年來,網路的快速發展與社群網路大量個崛起,造成現代人越來越依賴網路社群等相關軟體。過去在相關的社群探勘方面的研究,不外乎以K-means演算法的變形、凝聚法、圖形化的方式抑或是建立在Girvan-Newman所提出的演算法架構之下。其中凝聚法往往搭配著核心節點與區域社群的概念使用,其中的癥結點在於,利用核心節點與區域社群概念的凝聚法,往往會忽略掉在社群邊緣的節點,進而在做最後的分配時,未能將其作妥善的分群。因此,本研究基於現有的凝聚法相關研究,找出居中度及相關性作為新的凝聚依據,根據此二指標將社群作出妥善的分群,並與(Lim & Datta, 2013; Qiong & Ting-Ting, 2010; Tiantian & Bin, 2012)等學者我提出的方法作比較,進而證明其改善之效果。;Quick development of the Internet and huge explosion of the social network make people rely highly on the social network software in their daily life. Most researches on community detection in the past refer to K-means, agglomerative, graph or Girvan- Newman algorithm. The interest of this study has been directed to the algorithm of agglomerative. One possible deficiency of this method is that it always ignores the nodes which are on the edge of the community. Therefore, in the merging step, the nodes on the edge could be allocated to the wrong community. This study is aimed to improve the performance of the algorithm by finding the core node and the local community as new indexes for agglomerate. In the experiments, the results are compared with (Lim & Datta, 2013; Qiong & Ting-Ting, 2010; Tiantian & Bin, 2012) to show the effectiveness of the method developed in this study.
    Appears in Collections:[Graduate Institute of Information Management] Electronic Thesis & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML686View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明