首页> 外文期刊>Journal of High Speed Networks >Prediction optimization of diffusion paths in social networks using integration of ant colony and densest subgraph algorithms
【24h】

Prediction optimization of diffusion paths in social networks using integration of ant colony and densest subgraph algorithms

机译:蚁群集成和最密码子图算法的社交网络扩散路径预测优化

获取原文
获取原文并翻译 | 示例
       

摘要

One of the most important challenges of social networks is to predict information diffusion paths. Studying and modeling the propagation routes is important in optimizing social network-based platforms. In this paper, a new method is proposed to increase the prediction accuracy of diffusion paths using the integration of the ant colony and densest subgraph algorithms. The proposed method consists of 3 steps; clustering nodes, creating propagation paths based on ant colony algorithm and predicting information diffusion on the created paths. The densest subgraph algorithm creates a subset of maximum independent nodes as clusters from the input graph. It also determines the centers of clusters. When clusters are identified, the final information diffusion paths are predicted using the ant colony algorithm in the network. After the implementation of the proposed method, 4 real social network datasets were used to evaluate the performance. The evaluation results of all methods showed a better outcome for our method.
机译:社交网络最重要的挑战之一是预测信息扩散路径。学习和建模传播路线对于优化基于社交网络的平台很重要。在本文中,提出了一种新方法来增加使用蚁群和最密度的子图算法的集成来增加扩散路径的预测精度。该方法由3个步骤组成;聚类节点,基于蚁群算法创建传播路径和预测创建路径上的信息扩散。最密集的子图算法为来自输入图的群集创建最大独立节点的子集。它还决定了集群的中心。识别簇时,使用网络中的蚁群算法预测最终信息扩散路径。在实现提出的方法后,使用4个真实的社交网络数据集来评估性能。所有方法的评估结果显示了我们的方法更好的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号