基于大图的影响最大化算法研究

2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C) Pub Date : 2018-07-01 DOI:10.1109/QRS-C.2018.00096

Guigang Zhang, Chuanchuan You

{"title":"基于大图的影响最大化算法研究","authors":"Guigang Zhang, Chuanchuan You","doi":"10.1109/QRS-C.2018.00096","DOIUrl":null,"url":null,"abstract":"Unlike the traditional methods, such as the Independent Cascade Model and Liner Threshold Model. In this paper, we propose a kind of new Degree-priority heuristic IM algorithm in a big graph. We prove this algorithm. We do some experiments and make some comaparision between the Degree-priority heuristic IM algorithm and traditional IM algorithm.","PeriodicalId":199384,"journal":{"name":"2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Influence Maximization Algorithms Research Based on Big Graphs\",\"authors\":\"Guigang Zhang, Chuanchuan You\",\"doi\":\"10.1109/QRS-C.2018.00096\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Unlike the traditional methods, such as the Independent Cascade Model and Liner Threshold Model. In this paper, we propose a kind of new Degree-priority heuristic IM algorithm in a big graph. We prove this algorithm. We do some experiments and make some comaparision between the Degree-priority heuristic IM algorithm and traditional IM algorithm.\",\"PeriodicalId\":199384,\"journal\":{\"name\":\"2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/QRS-C.2018.00096\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/QRS-C.2018.00096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

不同于传统的方法，如独立级联模型和线性阈值模型。本文提出了一种新的大图下的度优先启发式IM算法。我们证明了这个算法。我们做了一些实验，并将度优先启发式IM算法与传统IM算法进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Influence Maximization Algorithms Research Based on Big Graphs

Unlike the traditional methods, such as the Independent Cascade Model and Liner Threshold Model. In this paper, we propose a kind of new Degree-priority heuristic IM algorithm in a big graph. We prove this algorithm. We do some experiments and make some comaparision between the Degree-priority heuristic IM algorithm and traditional IM algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)

自引率

0.00%

发文量