Online influence maximization using rapid continuous time independent cascade model

Annu Kumari, S. Singh
{"title":"Online influence maximization using rapid continuous time independent cascade model","authors":"Annu Kumari, S. Singh","doi":"10.1109/CONFLUENCE.2017.7943175","DOIUrl":null,"url":null,"abstract":"Do one really know the meaning of Online Influence (OI) Maximization? Do you know why do we need to calculate the influence of social networking sites? How to measure the influence of online maximization? How does it really works? If you have been pondering for the answers of the questions then this paper will assist you to identify and connect with influences of online maximization. Influence Maximization is the problem in which subset of seed nodes are found within the social networks which maximizes influence on other nodes in their ties and relationships. Influence maximization has been developed to find out how influence gets propagated through its network. The concept of Influence Maximization lies in the selection of minimal set of seed nodes which propagates maximum of its influenciality within a network. This paper firstly comprises of previous models used in appropriate selection of seed nodes i.e. Linearly Threshold Model (LT), Classic Cascade Independent s Model(IC), Extended Classic Independent Model(EIC). Then, I proposed a new Model Rapid Continuous Time (RCT) Independent Cascade Model that can be used in the Classic Independent Model(IC).","PeriodicalId":6651,"journal":{"name":"2017 7th International Conference on Cloud Computing, Data Science & Engineering - Confluence","volume":"35 6 1","pages":"356-361"},"PeriodicalIF":0.0000,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 7th International Conference on Cloud Computing, Data Science & Engineering - Confluence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONFLUENCE.2017.7943175","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Do one really know the meaning of Online Influence (OI) Maximization? Do you know why do we need to calculate the influence of social networking sites? How to measure the influence of online maximization? How does it really works? If you have been pondering for the answers of the questions then this paper will assist you to identify and connect with influences of online maximization. Influence Maximization is the problem in which subset of seed nodes are found within the social networks which maximizes influence on other nodes in their ties and relationships. Influence maximization has been developed to find out how influence gets propagated through its network. The concept of Influence Maximization lies in the selection of minimal set of seed nodes which propagates maximum of its influenciality within a network. This paper firstly comprises of previous models used in appropriate selection of seed nodes i.e. Linearly Threshold Model (LT), Classic Cascade Independent s Model(IC), Extended Classic Independent Model(EIC). Then, I proposed a new Model Rapid Continuous Time (RCT) Independent Cascade Model that can be used in the Classic Independent Model(IC).
利用快速连续时间无关级联模型实现在线影响最大化
我们真的知道在线影响力最大化的含义吗?你知道为什么我们需要计算社交网站的影响吗?如何衡量在线最大化的影响?它到底是如何运作的?如果你一直在思考这些问题的答案,那么这篇论文将帮助你识别和连接在线最大化的影响。影响最大化是指在社交网络中发现的种子节点子集,其对其联系和关系中的其他节点的影响最大化。影响力最大化的发展是为了找出影响力如何通过其网络传播。影响最大化的概念在于选择最小的种子节点集,使其在网络中传播最大的影响力。本文首先梳理了前人用于种子节点合理选择的模型,即线性阈值模型(LT)、经典级联独立模型(IC)、扩展经典独立模型(EIC)。然后,我提出了一个新的模型快速连续时间(RCT)独立级联模型,可用于经典独立模型(IC)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信