【摘要】：自然界中,復(fù)雜網(wǎng)絡(luò)系統(tǒng)隨處可見。不管是人們可以感知的經(jīng)濟(jì)系統(tǒng)、引文網(wǎng)絡(luò)系統(tǒng)、食物鏈網(wǎng)絡(luò)系統(tǒng),還是人們不可感知的生物化學(xué)系統(tǒng),這些復(fù)雜網(wǎng)絡(luò)系統(tǒng)都擁有著各自的屬性和聯(lián)系。為了充分地研究這些復(fù)雜網(wǎng)絡(luò)系統(tǒng),學(xué)者們抽象出一種模型—復(fù)雜網(wǎng)絡(luò)。近年來,復(fù)雜網(wǎng)絡(luò)的崛起引起了相關(guān)領(lǐng)域?qū)＜覀兊母叨汝P(guān)注,也迅速成為他們研究的重點(diǎn)內(nèi)容。學(xué)者們通過進(jìn)一步地研究和分析,發(fā)現(xiàn)不同的現(xiàn)實(shí)網(wǎng)絡(luò)模型卻有著相同的特性。社團(tuán)結(jié)構(gòu)是描述復(fù)雜網(wǎng)絡(luò)的一個(gè)關(guān)鍵特征,也是網(wǎng)絡(luò)中最普通且最關(guān)鍵的一個(gè)拓?fù)鋵傩�。研究社團(tuán)結(jié)構(gòu)不僅具有重要的理論意義,而且具有實(shí)際應(yīng)用價(jià)值。社團(tuán)結(jié)構(gòu)可以幫助人們更好地認(rèn)識(shí)和了解網(wǎng)絡(luò)的拓?fù)浣Y(jié)構(gòu)、復(fù)雜網(wǎng)絡(luò)的功能模塊、節(jié)點(diǎn)之間的隱藏關(guān)系,也可以預(yù)測(cè)網(wǎng)絡(luò)系統(tǒng)的變化趨勢(shì)。在復(fù)雜網(wǎng)絡(luò)的社團(tuán)結(jié)構(gòu)識(shí)別過程中,模塊度度量和其衍生出的度量指標(biāo)起了很重要的作用,并催生了一大批重要的社團(tuán)識(shí)別算法。但這種通過一般模塊度優(yōu)化方法來獲取復(fù)雜網(wǎng)絡(luò)的社團(tuán)結(jié)構(gòu)存在分辨率問題,影響了模塊度優(yōu)化方法的準(zhǔn)確性和應(yīng)用廣度。針對(duì)模塊度優(yōu)化時(shí)所產(chǎn)生的分辨率問題,本文將提出應(yīng)用增強(qiáng)模塊度優(yōu)化方法,從而有效地避免分辨率問題。由于社團(tuán)結(jié)構(gòu)的劃分和聚類算法的思想類似,可以探索使用數(shù)據(jù)挖掘的方法和理論來研究復(fù)雜網(wǎng)絡(luò)的社團(tuán)結(jié)構(gòu)問題。因此,本文將已成熟的聚類算法應(yīng)用到復(fù)雜網(wǎng)絡(luò)社團(tuán)識(shí)別問題上。本文的主要工作如下:(1)基于增強(qiáng)模塊度社團(tuán)識(shí)別算法:首先,該算法應(yīng)用隨機(jī)游走理論把無向無權(quán)網(wǎng)絡(luò)通過預(yù)處理轉(zhuǎn)化為無向有權(quán)網(wǎng)絡(luò),預(yù)處理后的網(wǎng)絡(luò)社團(tuán)之間的連邊權(quán)值小,社團(tuán)內(nèi)部中連邊的權(quán)值大。然后,使用CNM算法對(duì)實(shí)際網(wǎng)絡(luò)進(jìn)行劃分,并使用無向有權(quán)網(wǎng)絡(luò)的模塊度公式來衡量劃分結(jié)果的好壞。本文提出了一種將隨機(jī)游走理論與CNM算法結(jié)合的社團(tuán)識(shí)別算法,其劃分結(jié)果表明這種算法可以有效地避免模塊度優(yōu)化時(shí)所產(chǎn)生的分辨率問題。將該算法應(yīng)用到人工網(wǎng)絡(luò)或社團(tuán)結(jié)構(gòu)較為顯著的現(xiàn)實(shí)網(wǎng)絡(luò)中,識(shí)別出的社團(tuán)效果較好。(2)基于聚類算法思想的社團(tuán)結(jié)構(gòu)識(shí)別算法:基于邊的信息中心度,本文提出了節(jié)點(diǎn)親密度的概念,并構(gòu)建了節(jié)點(diǎn)親密度矩陣。然后,采用聚類思想對(duì)節(jié)點(diǎn)親密度矩陣進(jìn)行聚類,從而形成了一種基于聚類思想的社團(tuán)結(jié)構(gòu)發(fā)現(xiàn)新算法。鑒于聚類算法對(duì)初始值選取敏感,本文制訂了一些選取規(guī)則,有效地避免了此類問題。最后,通過經(jīng)典網(wǎng)絡(luò)模型證明了該算法的有效性。
[Abstract]:In nature, complex network systems can be found everywhere. Whether it is the economic system, the citation network system, the food chain network system or the biochemistry system that people can not perceive, these complex network systems all have their own properties and connections. In order to fully study these complex network systems, scholars abstract a model-complex network. In recent years, the rise of complex networks has attracted the attention of experts in related fields, and has quickly become the focus of their research. Through further research and analysis, scholars find that different real network models have the same characteristics. Community structure is a key feature in describing complex networks, and it is also the most common and key topological attribute in networks. The study of community structure not only has important theoretical significance, but also has practical application value. Community structure can help people better understand the topology of network, the function module of complex network, the hidden relationship between nodes, and predict the change trend of network system. In the process of community structure recognition in complex networks, modularity metric and its derived metrics play an important role, and give birth to a large number of important community recognition algorithms. However, the community structure of complex networks obtained by the general modular optimization method has the problem of resolution, which affects the accuracy and application breadth of the modular degree optimization method. Aiming at the resolution problem caused by modularity optimization, this paper proposes an enhanced modularity optimization method, which can effectively avoid the resolution problem. Because the division of community structure is similar to the idea of clustering algorithm, the method and theory of data mining can be used to study the problem of community structure in complex networks. Therefore, this paper applies the mature clustering algorithm to the complex network community recognition problem. The main work of this paper is as follows: (1) based on the enhanced modular degree community recognition algorithm: firstly, the algorithm applies random walk theory to transform the undirected unauthorized network into an undirected weighted network by preprocessing. After pretreatment, the weight of the connected edges is small and the weight of the connected edges in the communities is large. Then, the actual network is divided by CNM algorithm, and the module degree formula of undirected weighted network is used to measure the result of partition. In this paper, a community recognition algorithm based on random walk theory and CNM algorithm is proposed. The partition results show that this algorithm can effectively avoid the resolution problem caused by modularity optimization. The algorithm is applied to artificial network or real network with obvious community structure. (2) Community structure recognition algorithm based on clustering algorithm: edge based information center degree. In this paper, the concept of node affinity is proposed and the node affinity matrix is constructed. Then, the cluster idea is used to cluster the node affinity matrix, and a new community structure discovery algorithm based on clustering theory is formed. Since the clustering algorithm is sensitive to the selection of initial values, this paper formulates some selection rules to effectively avoid this kind of problem. Finally, the effectiveness of the algorithm is proved by classical network model.
【學(xué)位授予單位】：蘭州理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：O157.5

【參考文獻(xiàn)】

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

1 GONG Zhi-lian;TANG Ya;;Impacts of reforestation on woody species composition,species diversity and community structure in dry-hot valley of the Jinsha River,southwestern China[J];Journal of Mountain Science;2016年12期

2 趙昆;;網(wǎng)絡(luò)化軟件的復(fù)雜網(wǎng)絡(luò)特性實(shí)證[J];電子技術(shù)與軟件工程;2016年15期

3 王靈莉;;復(fù)雜網(wǎng)絡(luò)社團(tuán)結(jié)構(gòu)穩(wěn)定性測(cè)試模型的仿真分析[J];計(jì)算機(jī)仿真;2016年06期

4 吳衛(wèi)江;周靜;李國(guó)和;;一種基于節(jié)點(diǎn)重要度的社團(tuán)劃分算法[J];中南民族大學(xué)學(xué)報(bào)(自然科學(xué)版);2016年01期

5 劉顯楠;;論在網(wǎng)絡(luò)方面的經(jīng)濟(jì)對(duì)全球貿(mào)易產(chǎn)生的作用[J];商場(chǎng)現(xiàn)代化;2016年01期

6 胡嘉驥;李新德;王豐羽;;基于夾角余弦的證據(jù)組合方法[J];模式識(shí)別與人工智能;2015年09期

7 陳建麗;田俊生;周玉枝;高曉霞;秦雪梅;;基于代謝網(wǎng)絡(luò)調(diào)控的逍遙散抗抑郁作用機(jī)制研究進(jìn)展[J];中草藥;2014年14期

8 吳運(yùn)建;丁有良;孫成訪;;基于復(fù)雜產(chǎn)品系統(tǒng)視角的智慧城市項(xiàng)目研究[J];城市發(fā)展研究;2013年04期

9 賈宗維;崔軍;王曉芳;;復(fù)雜網(wǎng)絡(luò)中社團(tuán)結(jié)構(gòu)的快速探測(cè)方法[J];科技通報(bào);2013年01期

10 繆莉莉;韓傳峰;劉亮;曹吉鳴;;基于模體的科學(xué)家合作網(wǎng)絡(luò)基元特征分析[J];科學(xué)學(xué)研究;2012年10期

相關(guān)博士學(xué)位論文 前1條

1 賴大榮;復(fù)雜網(wǎng)絡(luò)社團(tuán)結(jié)構(gòu)分析方法研究[D];上海交通大學(xué);2011年

相關(guān)碩士學(xué)位論文 前4條

1 王培英;社會(huì)網(wǎng)絡(luò)中的社區(qū)發(fā)現(xiàn)及協(xié)同過濾推薦技術(shù)研究[D];北京交通大學(xué);2016年

2 賈佳;基于社團(tuán)結(jié)構(gòu)的軟件測(cè)試用例聚類分析[D];燕山大學(xué);2015年

3 尹琦;基于復(fù)雜網(wǎng)絡(luò)理論的職教知識(shí)創(chuàng)新網(wǎng)絡(luò)設(shè)計(jì)與應(yīng)用[D];廣東技術(shù)師范學(xué)院;2013年

4 王占華;基于復(fù)雜網(wǎng)絡(luò)特征的聚類算法研究[D];西北師范大學(xué);2012年

，

本文編號(hào)：2345579