PRNSGA-II: A Novel Approach for Influence Maximization and Cost Minimization Based on NSGA-II

Fulan Qian, Cunliang Zhu, Xi Chen, Shu Zhao, Yanping Zhang
{"title":"PRNSGA-II: A Novel Approach for Influence Maximization and Cost Minimization Based on NSGA-II","authors":"Fulan Qian, Cunliang Zhu, Xi Chen, Shu Zhao, Yanping Zhang","doi":"10.1109/ICBK50248.2020.00063","DOIUrl":null,"url":null,"abstract":"Influence maximization aims to extract a k-size seed node set to get a maximum influence spread under a specific propagation model which is a popular research topic in viral marketing these years. Companies want to select influential people to help them increase the sales of productions. With the limited budget, companies are unable to afford the huge cost of finding influential people. Thus, how to solve the multi-objective problem i.e. influence maximization problem and cost minimization problem (IM-CM) attracts more researchers attentions. In this paper, we propose a novel framework called PRNSGA-II to solve IM-CM. As an important index in complex networks, PageRank describes the importance of nodes. So we add PageRank to our first objective function to improve the quality of seed nodes. Then to calculate the cost of nodes, we use the degree centrality as our second objective function. Finally, we adopt NSGA-II which is a classical and effective multi-objective framework to solve IM-CM. We use three public datasets to verify our algorithm. The results of experiments demonstrate the effectiveness of our algorithm.","PeriodicalId":432857,"journal":{"name":"2020 IEEE International Conference on Knowledge Graph (ICKG)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Knowledge Graph (ICKG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBK50248.2020.00063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Influence maximization aims to extract a k-size seed node set to get a maximum influence spread under a specific propagation model which is a popular research topic in viral marketing these years. Companies want to select influential people to help them increase the sales of productions. With the limited budget, companies are unable to afford the huge cost of finding influential people. Thus, how to solve the multi-objective problem i.e. influence maximization problem and cost minimization problem (IM-CM) attracts more researchers attentions. In this paper, we propose a novel framework called PRNSGA-II to solve IM-CM. As an important index in complex networks, PageRank describes the importance of nodes. So we add PageRank to our first objective function to improve the quality of seed nodes. Then to calculate the cost of nodes, we use the degree centrality as our second objective function. Finally, we adopt NSGA-II which is a classical and effective multi-objective framework to solve IM-CM. We use three public datasets to verify our algorithm. The results of experiments demonstrate the effectiveness of our algorithm.
PRNSGA-II:基于NSGA-II的影响最大化和成本最小化新方法
影响最大化是指在特定的传播模式下,提取k大小的种子节点集,使影响传播达到最大,是近年来病毒营销研究的热点。公司想要挑选有影响力的人来帮助他们增加产品的销售。由于预算有限,公司无法承担寻找有影响力的人的巨大成本。因此,如何解决多目标问题,即影响最大化问题和成本最小化问题(IM-CM)越来越受到研究者的关注。在本文中,我们提出了一个新的框架PRNSGA-II来解决IM-CM问题。作为复杂网络中的重要指标,PageRank描述了节点的重要性。因此,我们将PageRank添加到第一个目标函数中,以提高种子节点的质量。然后计算节点的代价,我们使用度中心性作为我们的第二个目标函数。最后,我们采用经典有效的多目标框架NSGA-II来解决IM-CM问题。我们使用三个公共数据集来验证我们的算法。实验结果证明了算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信