咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Information and Influence Prop... 收藏

Information and Influence Propagation in Social Networks

信息和影响的传播

丛 书 名:Synthesis Lectures on Data Management

作     者:Chen, Wei Castillo, Carlos Lakshmanan, Laks V. S. 

I S B N:(纸本) 9781627051156 

出 版 社:Morgan & Claypool Publishers 

出 版 年:2013年

主 题 词:Computer Science 

学科分类:08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)] 

摘      要:Research on social networks has exploded over the last decade. To a large extent, this has been fueled by the spectacular growth of social media and online social networking sites, which continue growing at a very fast pace, as well as by the increasing availability of very large social network datasets for purposes of research. A rich body of this research has been devoted to the analysis of the propagation of information, influence, innovations, infections, practices and customs through networks. Can we build models to explain the way these propagations occur? How can we validate our models against any available real datasets consisting of a social network and propagation traces that occurred in the past? These are just some questions studied by researchers in this area. Information propagation models find applications in viral marketing, outbreak detection, finding key blog posts to read in order to catch important stories, finding leaders or trendsetters, information feed ranking, etc. A number of algorithmic problems arising in these applications have been abstracted and studied extensively by researchers under the garb of influence maximization. This book starts with a detailed description of well-established diffusion models, including the independent cascade model and the linear threshold model, that have been successful at explaining propagation phenomena. We describe their properties as well as numerous extensions to them, introducing aspects such as competition, budget, and time-criticality, among many others. We delve deep into the key problem of influence maximization, which selects key individuals to activate in order to influence a large fraction of a network. Influence maximization in classic diffusion models including both the independent cascade and the linear threshold models is computationally intractable, more precisely #P-hard, and we describe several approximation algorithms and scalable heuristics that have been proposed in the literature. F

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分