...
首页> 外文期刊>Physica, A. Statistical mechanics and its applications >Link prediction based on temporal similarity metrics using continuous action set learning automata
【24h】

Link prediction based on temporal similarity metrics using continuous action set learning automata

机译:使用连续动作集学习自动机基于时间相似性度量的链接预测

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

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

       

摘要

Link prediction is a social network research area that tries to predict future links using network structure. The main approaches in this area are based on predicting future links using network structure at a specific period, without considering the links behavior through different periods. For example, a common traditional approach in link prediction calculates a chosen similarity metric for each non-connected link and outputs the links with higher similarity scores as the prediction result. In this paper, we propose a new link prediction method based on temporal similarity metrics and Continuous Action set Learning Automata (CALA). The proposed method takes advantage of using different similarity metrics as well as different time periods. In the proposed algorithm, we try to model the link prediction problem as a noisy optimization problem and use a team of CALAs to solve the noisy optimization problem. CALA is a reinforcement based optimization tool which tries to learn the optimal behavior from the environment feedbacks. To determine the importance of different periods and similarity metrics on the prediction result, we define a coefficient for each of different periods and similarity metrics and use a CALA for each coefficient. Each CALA tries to learn the true value of the corresponding coefficient. Final link prediction is obtained from a combination of different similarity metrics in different times based on the obtained coefficients. The link prediction results reported here show satisfactory of the proposed method for some social network data sets. (C) 2016 Elsevier B.V. All rights reserved.
机译:链接预测是一个社交网络研究领域,它试图使用网络结构来预测未来的链接。该领域的主要方法是基于在特定时期内使用网络结构预测将来的链接,而不考虑不同时期内的链接行为。例如,链路预测中的一种常见的传统方法为每个未连接的链路计算一个选定的相似性度量,并输出具有较高相似性得分的链路作为预测结果。在本文中,我们提出了一种基于时间相似性度量和连续动作集学习自动机(CALA)的新的链接预测方法。所提出的方法利用了使用不同的相似性度量以及不同的时间段的优势。在提出的算法中,我们尝试将链接预测问题建模为噪声优化问题,并使用一组CALA来解决噪声优化问题。 CALA是基于增强的优化工具,它试图从环境反馈中学习最佳行为。为了确定不同时期和相似度指标对预测结果的重要性,我们为每个不同时期和相似度指标定义一个系数,并对每个系数使用一个CALA。每个CALA都尝试学习相应系数的真实值。基于所获得的系数,在不同时间从不同相似性度量的组合获得最终链接预测。此处报告的链接预测结果表明,对于某些社交网络数据集,该方法令人满意。 (C)2016 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号