本文選題：加權網絡 + 結構洞占據者　； 參考：《安徽大學》2017年碩士論文

【摘要】：近年來,隨著各種網絡和計算機科學的飛速發(fā)展,網絡的規(guī)模呈指數級增長,在網絡中占據何種位置能夠獲益的想法已經得到許多人的關注。個體或者團體中的中間人可以獲得豐富的信息并控制他們的網絡關系,在網絡中占據結構洞位置的主體可以獲得豐厚的利益。作為網絡結構分析的重要概念,結構洞占據者在獲取網絡有效信息方面起著關鍵的作用。結構洞理論一經提出,受到社會學、心理學、經濟學等領域研究者們的重視和關注,并被廣泛應用于各個領域。處在結構洞位置上的節(jié)點可以獲得累加且非重復的信息,因此找到結構洞占據者并加以利用,是非常有意義的。目前,研究者們對于結構洞占據者挖掘的研究主要側重于無權網絡,對加權網絡的研究較少,在實際網絡中,邊的權重對網絡的性能有重要影響,邊的權重能更真實地反映網絡結構的特性。本文的主要工作包括兩個方面。一,以加權網絡為研究對象,將邊的權重引入網絡,提出一種基于加權中介中心性的結構洞占據者挖掘方法(W_BCHIS),用以挖掘加權網絡中的結構洞占據者。該方法首先利用社團發(fā)現算法求出加權網絡的社團,接著引入邊權改進中介中心性指標,以初始化節(jié)點的重要性,通過對節(jié)點的重要性和節(jié)點占據結構洞的可能性不斷地迭代直到收斂以挖掘出結構洞占據者。最后,在公用數據和實例數據上驗證本文所提算法的有效性。二,本文設計并實現一個結構洞占據者挖掘系統(tǒng),該系統(tǒng)主要包括社團劃分模塊和結構洞挖掘模塊,其中,社團劃分模塊實現了社團劃分算法,結構洞占據者挖掘模塊實現了本文提出的W_BCHIS算法、無權的HIS算法、無權的MaxD算法和加權W_HIS等算法。同時,用戶可通過系統(tǒng)進行不同的社團劃分方法和結構洞占據者挖掘方法的實現對比分析。本文工作如下:1.介紹結構洞占據者挖掘基本理論概念和相關算法。包括結構洞的定義、度量指標及基本算法。2.針對加權網絡的問題研究,提出基于加權中介中心性的結構洞占據者獲取方法(W_BCHIS)。本文以加權網絡為研究對象,將權重引入到中介中心性指標中,對現有的HIS算法進行改進,提出一種基于加權中介中心性的結構洞占據者挖掘算法(W_BCHIS),并將本文提出的W_BCHIS算法與其他算法在公用數據集上進行實驗對比與分析,驗證算法的有效性。3.設計并實現結構洞占據者挖掘系統(tǒng)。系統(tǒng)的主要功能模塊包括社團劃分模塊、結構洞占據者挖掘模塊和可視化圖表呈現模塊。該系統(tǒng)基于B/S架構,主要的開發(fā)語言采用Java,運用MVC設計模式對系統(tǒng)的主要功能進行實現。
[Abstract]:In recent years, with the rapid development of various networks and computer science, the scale of the network has increased exponentially.The middleman in the individual or group can obtain abundant information and control their network relationship, and the main body occupying the structure hole in the network can gain rich benefits.As an important concept of network structure analysis, structural hole occupants play a key role in obtaining effective network information.Once the theory of structural hole is put forward, it has been paid attention to by researchers in sociology, psychology, economics and so on, and has been widely used in various fields.Nodes in the position of structural holes can obtain cumulative and non-repeated information, so it is very meaningful to find the occupants of the structural holes and make use of them.At present, the researchers mainly focus on the structure hole occupant mining, but less on the weighted network. In the actual network, the weight of the edge has an important impact on the performance of the network.The weight of the edge can reflect the characteristics of the network structure more realistically.The main work of this paper includes two aspects.Firstly, taking the weighted network as the research object, introducing the weight of the edge into the network, this paper presents a method of structure hole occupant mining based on weighted intermediary centrality, which can be used to mine the occupants of the structural holes in the weighted network.In this method, the community of weighted network is obtained by using community discovery algorithm, and then the importance of initializing nodes by introducing edge weight to improve intermediary centrality index is introduced.The importance of nodes and the possibility of nodes occupying structural holes are iterated until they converge to excavate the occupants of structural holes.Finally, the effectiveness of the proposed algorithm is verified on public data and instance data.Second, this paper designs and implements a structure hole occupant mining system. The system mainly includes community partition module and structure hole mining module, among which, community partition module implements community partition algorithm.The structure hole occupant mining module implements the proposed W_BCHIS algorithm, unauthorized HIS algorithm, unauthorized MaxD algorithm and weighted W_HIS algorithm.At the same time, the user can carry on the different community division method and the structure hole occupant mining method through the system to carry on the contrast analysis.The work of this paper is as follows: 1.This paper introduces the basic theory concept and related algorithms of structure hole occupant mining.Including the definition of structural holes, metrics and basic algorithm. 2.In order to solve the problem of weighted network, this paper presents a new method of obtaining structural hole occupants based on weighted intermediary centrality.In this paper, the weighted network is taken as the research object, the weight is introduced into the intermediary central index, and the existing HIS algorithm is improved.In this paper, a new structure hole occupying algorithm based on weighted intermediary centrality is proposed. The W_BCHIS algorithm proposed in this paper is compared with other algorithms on the common data set to verify the validity of the algorithm.Design and implement the structure hole occupant mining system.The main function modules of the system include community division module, structure hole occupant mining module and visualization chart presentation module.The system is based on B / S architecture, the main development language is Java, and the main functions of the system are realized by MVC design pattern.
【學位授予單位】：安徽大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：O157.5

【參考文獻】

相關期刊論文 前10條

1 雷宏振;高揚眉;;結構洞文化異質性及其對群間信息傳播的影響研究[J];現代情報;2016年01期

2 蘇曉萍;宋玉蓉;;利用鄰域“結構洞”尋找社會網絡中最具影響力節(jié)點[J];物理學報;2015年02期

3 蘇曉萍;申情;宋玉蓉;蔣云良;;利用社會網絡上最有影響力節(jié)點實現高效病毒營銷[J];小型微型計算機系統(tǒng);2014年08期

4 方婧;;基于結構洞理論的社群網絡信息資源配置研究[J];網絡安全技術與應用;2014年06期

5 劉立;黨興華;;企業(yè)知識價值性、結構洞對網絡權力影響研究[J];科學學與科學技術管理;2014年06期

6 趙姝;劉倩倩;劉峰;張燕平;;基于加權合著網絡的結構洞特征分析[J];計算機工程與應用;2016年02期

7 關迎暉;向勇;陳康;;基于Gephi的可視分析方法研究與應用[J];電信科學;2013年S1期

8 廖麗平;胡仁杰;張光宇;;模糊社會網絡的結構洞分析方法[J];東南大學學報(自然科學版);2013年04期

9 趙炎;郭霞婉;;結構洞度對聯盟網絡中企業(yè)創(chuàng)新績效的影響研究——基于中國家用視聽設備制造業(yè)企業(yè)聯盟網絡[J];科技進步與對策;2012年17期

10 王國明;李夏苗;胡正東;蔡鑒明;曹曉東;;長株潭城市群交通網絡結構洞分析[J];計算機工程與應用;2012年15期

，

本文編號：1750187