本文選題：在線社會網(wǎng)絡 + 社團發(fā)現(xiàn)　； 參考：《華中科技大學》2013年碩士論文

【摘要】：在線社會網(wǎng)絡是指人們以計算機和網(wǎng)絡為媒介進行社交、協(xié)作和信息共享所形成的人與人之間的社會網(wǎng)絡。近幾年，隨著Facebook、微博、微信等大規(guī)模在線社會網(wǎng)絡應用的成功，掀起了在線社會網(wǎng)絡的又一輪研究熱潮。 同社會網(wǎng)絡一樣，在線社會網(wǎng)絡也具有社團結構。探索在線社會網(wǎng)絡中的社團結構，可以幫助我們對目前的系統(tǒng)進行評估，并基于它來設計未來的在線社會網(wǎng)絡系統(tǒng)，以及幫助系統(tǒng)運營商有效的組織自己的門戶。另一方面，社區(qū)發(fā)現(xiàn)可以幫助產品或服務提供商快速準確的找到對其感興趣的用戶群體，以便于針對性的投放廣告信息。 本文綜合考慮用戶的顯式和隱式關系，提出一種基于局部模塊度的社團發(fā)現(xiàn)算法。首先根據(jù)在線社會網(wǎng)絡應用系統(tǒng)中的用戶的行為數(shù)據(jù)，分析其興趣愛好，構建用戶表示，計算用戶之間的相似度，根據(jù)一定閥值過濾后，得到用戶的隱式關系。然后，根據(jù)用戶的隱式關系擴展顯式關系網(wǎng)絡，從而得到一個綜合用戶顯式和隱式關系的網(wǎng)絡結構。最后以擴展后得到的網(wǎng)絡作為輸入，利用基于局部模塊度優(yōu)化的算法，劃分在線社會網(wǎng)絡的社區(qū)結構。本文最后在兩個真實數(shù)據(jù)集上將本文提出的算法與基于興趣相似度的社團發(fā)現(xiàn)算法進行了對比試驗，試驗結果表明本文提出的綜合顯式和隱式關系的算法具有更好的社團劃分效果。
[Abstract]:The online social network refers to the social network between people which is formed by the social communication, cooperation and information sharing between people with the media of computer and network. In recent years, with the success of Facebook, Weibo, WeChat and other large-scale online social network applications, there has been another wave of research on online social networks. Like social networks, online social networks also have community structures. Exploring the community structure in the online social network can help us to evaluate the current system, design the future online social network system based on it, and help system operators organize their own portal effectively. On the other hand, community discovery can help product or service providers quickly and accurately find the user groups interested in them, so as to facilitate targeted advertising information. In this paper, a community discovery algorithm based on local modularity is proposed considering the explicit and implicit relationships of users. Firstly, according to the behavior data of the users in the online social network application system, we analyze their interests and hobbies, construct the user representation, calculate the similarity between users, filter according to a certain threshold, and get the implicit relationship of the users. Then, the explicit relational network is extended according to the implicit relation of the user, and a network structure combining the explicit and implicit relationship between the user and the user is obtained. Finally, the extended network is used as the input, and the community structure of the online social network is divided by using the algorithm based on local modularity optimization. In the end of this paper, we compare the proposed algorithm with the community discovery algorithm based on interest similarity on two real data sets. The experimental results show that the proposed algorithm of combining explicit and implicit relations has a better effect on community division.
【學位授予單位】：華中科技大學
【學位級別】：碩士
【學位授予年份】：2013
【分類號】：O157.5;TP393.09

【參考文獻】

相關期刊論文 前8條

1 劉晉;王潛平;;個性化服務中用戶興趣模型相關技術的研究[J];電腦知識與技術(學術交流);2007年10期

2 劉蓉;陳鵬;張興艷;;個性化網(wǎng)頁推薦中基于神經網(wǎng)絡的自適應用戶模型研究[J];電子測量技術;2007年04期

3 趙方;馬嚴;羅海勇;林權;林琳;;一種基于網(wǎng)絡密度分簇的移動信標輔助定位方法[J];電子與信息學報;2009年12期

4 周濤;;在線電影點播中的人類動力學模式[J];復雜系統(tǒng)與復雜性科學;2008年01期

5 胡海波;王科;徐玲;汪小帆;;基于復雜網(wǎng)絡理論的在線社會網(wǎng)絡分析[J];復雜系統(tǒng)與復雜性科學;2008年02期

6 何麗;趙富強;饒俊;;基于社團服務鏈的Web服務組合方法[J];計算機應用;2013年01期

7 楊波;游新冬;段文奇;;復雜動態(tài)網(wǎng)絡演化社團結構探測分析的研究進展[J];計算機應用研究;2013年05期

8 李尚英;高玲;;復雜網(wǎng)絡社團劃分算法研究[J];信息技術與信息化;2012年01期

相關博士學位論文 前1條

1 張宇;在線社會網(wǎng)絡信任計算與挖掘分析中若干模型與算法研究[D];浙江大學;2009年

，

本文編號：2027506