...
首页> 外文期刊>Karbala International Journal of Modern Science >Influence Maximization based on a Non-dominated Sorting Genetic Algorithm
【24h】

Influence Maximization based on a Non-dominated Sorting Genetic Algorithm

机译:基于非统治分类遗传算法影响最大化

获取原文
   

获取外文期刊封面封底 >>

       

摘要

Influence Maximization (IM) is a problem represented by a set of users who are specified in advance and are usually called the seed. The latter can influence their friends, who can in turn influence others and so on until it reaches the largest number of users within the network. This issue is of ultimate importance in a variety of fields. In the current study, a Non-dominated Sorting Genetic Algorithm II (NSGA-II) has been adopted in influence maximization to produce the so-called NSGAII based IM algorithm (NSGAII-IM). Principally, the population should be represented with individuals of variable lengths as the seed group, and the diffusion model should be designed so as to formulate its multi-objective function. In the context of individual representation, the nodes have been pseudo-randomly chosen using the centrality measures (based on high centrality nodes as degree, closeness, and eigenvector). As for the multi-objective function, increasing the coverage size of influence and decreasing the number of seed nodes as far as possible have been set as the conflicting objectives. Weighted Integration Cascade (WIC) has been suggested as an improved version of the Independent Cascade (IC) diffusion model. It has proven to be effective in the performance of the NSGAII-IM algorithm. In evaluating the proposed optimization model, two real-world social network datasets have been used: Facebook wall posts, and Digg networks. The algorithm showed promising results as it could relatively improve the solutions as compared with other methods, with an increased average of influential spread. Additionally, the WIC model has proven to be effective through the evaluation of the performance of the NSGAII-IM algorithm with other diffusion models.
机译:影响最大化(IM)是由预先指定的一组用户表示的问题,通常称为种子。后者可以影响他们的朋友,谁可以反过来影响他人,直到它到达网络中最多的用户数量。这个问题是各种领域的最终重要性。在目前的研究中,已经采用了非主导的分类遗传算法II(NSGA-II)在影响最大化以产生所谓的NSGaii基于IM算法(NSGaii-IM)。主要是,群体应与作为种子组的可变长度的个体表示,扩散模型应设计成配制其多目标函数。在个人表示的上下文中,节点已经使用中心度测量(基于高中心点,接近和特征向量)而被伪随机选择。至于多目标函数,尽可能地增加了影响的覆盖范围和减少种子节点的数量,因此被设定为冲突的目标。已经建议加权集成级联(WIC)作为独立级联(IC)扩散模型的改进版本。已证明在NSGAII-IM算法的性能方面是有效的。在评估所提出的优化模型时,已经使用了两个现实世界的社交网络数据集:Facebook Wall Posts和Digg Networks。该算法显示出有前途的结果,与其他方法相比,可以相对改善解决方案,其影响的平均值增加。此外,通过评估NSGaii-IM算法与其他扩散模型的性能,证明了WIC模型。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号