English  |  正體中文  |  简体中文  |  Items with full text/Total items : 888/888 (100%)
Visitors : 13062823      Online Users : 220
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://ccur.lib.ccu.edu.tw/handle/A095B0000Q/545

    Title: 一個有效率的方法去找到高中介度中心性的點;An efficient method for finding vertices of high betweenness
    Authors: 陳暐杰;CHEN, WEI-JIE
    Contributors: 資訊工程研究所
    Keywords: 中介度中心性;社會網路;betweenness centrality;social network
    Date: 2017
    Issue Date: 2019-07-17
    Publisher: 資訊工程研究所
    Abstract: 中心性是一種量化點在社會網路上的重要性的一種指標,一個點的中介度是它在最短路徑上的次數,然而,計算中介度中心性的計算量是非常龐大的。在許多實際應用中,我們並不是要求出一個點正確的中介度中心性的值,我們想要得到的是中介度中心性的排名,因此,我們設計一個有效率的方法去合併點來得到一個比較少點和邊的網路,然後就去估計每個點的中介度中心性,便可取得中介度中心性的排名。
    Centralities are crucial in quantifying the roles and the position of vertices in social networks. The betweenness centrality of a vertex is based on the number of shortest paths passing through it. However, the computation of betweenness centrality is expensive. In many practical applications, the ranking of betweenness centralities is more importance than the exact values, so we developed a novel algorithm that efficiently combines vertices to reduce the size of the network. Then, we compute vertices of high betweenness centralities quickly in the modified network to get the top-k vertices.
    Appears in Collections:[資訊工程學系] 學位論文

    Files in This Item:

    File Description SizeFormat

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

    版權聲明 © 國立中正大學圖書館網頁內容著作權屬國立中正大學圖書館


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback