Fulan Qian, Cunliang Zhu, Xi Chen, Shu Zhao, Yanping Zhang
{"title":"PRNSGA-II:基于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":"{\"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}","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}
PRNSGA-II: A Novel Approach for Influence Maximization and Cost Minimization Based on NSGA-II
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.