本文選題：加權(quán)網(wǎng)絡(luò) + 結(jié)構(gòu)洞占據(jù)者�。� 參考：《安徽大學》2017年碩士論文

【摘要】：近年來,隨著各種網(wǎng)絡(luò)和計算機科學的飛速發(fā)展,網(wǎng)絡(luò)的規(guī)模呈指數(shù)級增長,在網(wǎng)絡(luò)中占據(jù)何種位置能夠獲益的想法已經(jīng)得到許多人的關(guān)注。個體或者團體中的中間人可以獲得豐富的信息并控制他們的網(wǎng)絡(luò)關(guān)系,在網(wǎng)絡(luò)中占據(jù)結(jié)構(gòu)洞位置的主體可以獲得豐厚的利益。作為網(wǎng)絡(luò)結(jié)構(gòu)分析的重要概念,結(jié)構(gòu)洞占據(jù)者在獲取網(wǎng)絡(luò)有效信息方面起著關(guān)鍵的作用。結(jié)構(gòu)洞理論一經(jīng)提出,受到社會學、心理學、經(jīng)濟學等領(lǐng)域研究者們的重視和關(guān)注,并被廣泛應(yīng)用于各個領(lǐng)域。處在結(jié)構(gòu)洞位置上的節(jié)點可以獲得累加且非重復的信息,因此找到結(jié)構(gòu)洞占據(jù)者并加以利用,是非常有意義的。目前,研究者們對于結(jié)構(gòu)洞占據(jù)者挖掘的研究主要側(cè)重于無權(quán)網(wǎng)絡(luò),對加權(quán)網(wǎng)絡(luò)的研究較少,在實際網(wǎng)絡(luò)中,邊的權(quán)重對網(wǎng)絡(luò)的性能有重要影響,邊的權(quán)重能更真實地反映網(wǎng)絡(luò)結(jié)構(gòu)的特性。本文的主要工作包括兩個方面。一,以加權(quán)網(wǎng)絡(luò)為研究對象,將邊的權(quán)重引入網(wǎng)絡(luò),提出一種基于加權(quán)中介中心性的結(jié)構(gòu)洞占據(jù)者挖掘方法(W_BCHIS),用以挖掘加權(quán)網(wǎng)絡(luò)中的結(jié)構(gòu)洞占據(jù)者。該方法首先利用社團發(fā)現(xiàn)算法求出加權(quán)網(wǎng)絡(luò)的社團,接著引入邊權(quán)改進中介中心性指標,以初始化節(jié)點的重要性,通過對節(jié)點的重要性和節(jié)點占據(jù)結(jié)構(gòu)洞的可能性不斷地迭代直到收斂以挖掘出結(jié)構(gòu)洞占據(jù)者。最后,在公用數(shù)據(jù)和實例數(shù)據(jù)上驗證本文所提算法的有效性。二,本文設(shè)計并實現(xiàn)一個結(jié)構(gòu)洞占據(jù)者挖掘系統(tǒng),該系統(tǒng)主要包括社團劃分模塊和結(jié)構(gòu)洞挖掘模塊,其中,社團劃分模塊實現(xiàn)了社團劃分算法,結(jié)構(gòu)洞占據(jù)者挖掘模塊實現(xiàn)了本文提出的W_BCHIS算法、無權(quán)的HIS算法、無權(quán)的MaxD算法和加權(quán)W_HIS等算法。同時,用戶可通過系統(tǒng)進行不同的社團劃分方法和結(jié)構(gòu)洞占據(jù)者挖掘方法的實現(xiàn)對比分析。本文工作如下:1.介紹結(jié)構(gòu)洞占據(jù)者挖掘基本理論概念和相關(guān)算法。包括結(jié)構(gòu)洞的定義、度量指標及基本算法。2.針對加權(quán)網(wǎng)絡(luò)的問題研究,提出基于加權(quán)中介中心性的結(jié)構(gòu)洞占據(jù)者獲取方法(W_BCHIS)。本文以加權(quán)網(wǎng)絡(luò)為研究對象,將權(quán)重引入到中介中心性指標中,對現(xiàn)有的HIS算法進行改進,提出一種基于加權(quán)中介中心性的結(jié)構(gòu)洞占據(jù)者挖掘算法(W_BCHIS),并將本文提出的W_BCHIS算法與其他算法在公用數(shù)據(jù)集上進行實驗對比與分析,驗證算法的有效性。3.設(shè)計并實現(xiàn)結(jié)構(gòu)洞占據(jù)者挖掘系統(tǒng)。系統(tǒng)的主要功能模塊包括社團劃分模塊、結(jié)構(gòu)洞占據(jù)者挖掘模塊和可視化圖表呈現(xiàn)模塊。該系統(tǒng)基于B/S架構(gòu),主要的開發(fā)語言采用Java,運用MVC設(shè)計模式對系統(tǒng)的主要功能進行實現(xiàn)。
[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

【參考文獻】

相關(guān)期刊論文 前10條

1 雷宏振;高揚眉;;結(jié)構(gòu)洞文化異質(zhì)性及其對群間信息傳播的影響研究[J];現(xiàn)代情報;2016年01期

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

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

4 方婧;;基于結(jié)構(gòu)洞理論的社群網(wǎng)絡(luò)信息資源配置研究[J];網(wǎng)絡(luò)安全技術(shù)與應(yīng)用;2014年06期

5 劉立;黨興華;;企業(yè)知識價值性、結(jié)構(gòu)洞對網(wǎng)絡(luò)權(quán)力影響研究[J];科學學與科學技術(shù)管理;2014年06期

6 趙姝;劉倩倩;劉峰;張燕平;;基于加權(quán)合著網(wǎng)絡(luò)的結(jié)構(gòu)洞特征分析[J];計算機工程與應(yīng)用;2016年02期

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

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

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

10 王國明;李夏苗;胡正東;蔡鑒明;曹曉東;;長株潭城市群交通網(wǎng)絡(luò)結(jié)構(gòu)洞分析[J];計算機工程與應(yīng)用;2012年15期

，

本文編號：1750187