社會(huì)網(wǎng)絡(luò)影響力最大化算法及其傳播模型研究
[Abstract]:In recent years, with the rapid development of software and hardware and the popularity of personal computers and the Internet, networks based on acquaintance relationships such as WeChat, Various online social platforms, such as Renren based on classmate relationship and Weibo based on concern, are popular and occupy almost all of our spare time. These platforms can generate huge amounts of data. It brings an unprecedented opportunity to the analysis of social network, so it attracts a large number of researchers to study and analyze the spatial structure of social network, the law of communication and so on. Among them, how to choose the TOP-K node with maximum influence in social network and how to select the communication model of social network have become the hot choice of academic research. In this paper, based on the previous studies, the existing algorithms of maximizing the influence of social networks are improved. Secondly, the independent cascade model and the linear threshold model are analyzed in detail. By introducing the phenomenon that people will react differently when they receive information for the first time and then receive the information again, and the law of forgetting, a new social network communication model is proposed. The main contents are as follows: (1) A linear attenuation centrality algorithm based on the three-degree influence principle. According to the principle of three degrees of influence, influence is mainly effective within three degrees of separation, more than three degrees of separation, and the influence is almost close to 0. Therefore, linear attenuation centrality measures the actual influence of nodes by the potential influence of nodes within three degrees, and this potential influence propagates from the source node outward to the distance of 2. The propagation to the distance of 3 again attenuates 尾 times, in which 0 偽, 尾 1. After calculating the centrality of linear attenuation, this paper verifies the validity of the algorithm on four common data sets from three different angles. (2) Hybrid propagation model. In a real network of relationships, there is the fact that when people first come into contact with certain information, it often depends on the information itself, and after the first rejection, The acceptance of each time in the future depends on whether the cumulative influence of the person who has been rejected or recommended now is greater than its own threshold and that the cumulative influence follows the law of forgetting will continue to decline with the advance of time. Based on these facts and absorbing the essence of the independent cascade model and the linear threshold model, a new communication model is proposed, which is more consistent with the law of social network influence transmission. Two different verification methods are used to verify the validity of the hybrid propagation model on the Wikipedia voting data set.
【學(xué)位授予單位】:哈爾濱工程大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2016
【分類號】:G206;TP301.6
【參考文獻(xiàn)】
相關(guān)期刊論文 前6條
1 郭靜;曹亞男;周川;張鵬;郭莉;;基于線性閾值模型的影響力傳播權(quán)重學(xué)習(xí)[J];電子與信息學(xué)報(bào);2014年08期
2 李棟;徐志明;李生;劉挺;王秀文;;在線社會(huì)網(wǎng)絡(luò)中信息擴(kuò)散[J];計(jì)算機(jī)學(xué)報(bào);2014年01期
3 薛一波;鮑媛媛;易成岐;;SPNR:社交網(wǎng)絡(luò)中的新型謠言傳播模型[J];信息網(wǎng)絡(luò)安全;2014年01期
4 吳凱;季新生;郭進(jìn)時(shí);劉彩霞;;基于微博網(wǎng)絡(luò)的影響力最大化算法[J];計(jì)算機(jī)應(yīng)用;2013年08期
5 易成岐;鮑媛媛;薛一波;姜京池;;新浪微博的大規(guī)模信息傳播規(guī)律研究[J];計(jì)算機(jī)科學(xué)與探索;2013年06期
6 潘新;鄧貴仕;佟斌;;基于社會(huì)網(wǎng)絡(luò)的輿情傳播模型構(gòu)建與分析[J];運(yùn)籌與管理;2011年02期
相關(guān)博士學(xué)位論文 前1條
1 劉曉東;大規(guī)模社會(huì)網(wǎng)絡(luò)中影響最大化問題高效處理技術(shù)研究[D];國防科學(xué)技術(shù)大學(xué);2013年
相關(guān)碩士學(xué)位論文 前2條
1 陳浩;基于閾值的社會(huì)網(wǎng)絡(luò)影響力最大化算法[D];復(fù)旦大學(xué);2012年
2 田家堂;在線社會(huì)網(wǎng)絡(luò)中影響最大化問題的研究[D];復(fù)旦大學(xué);2012年
,本文編號:2174718
本文鏈接:http://sikaile.net/kejilunwen/ruanjiangongchenglunwen/2174718.html