首页> 外文会议>International Conference on Intelligent Human-Machine Systems and Cybernetics >Link Prediction Based on Random Forest in Signed Social Networks
【24h】

Link Prediction Based on Random Forest in Signed Social Networks

机译:基于随机林的签名社交网络链接预测

获取原文

摘要

The social network considering both positive (like, support, trust, etc.) and negative (dislike, opposition, distrust, etc.) relationships is called signed social network, the edge sign prediction problem of which has an important application value in the friend recommendation system. We, for the first time, apply random forest to predicting the signs of edges in the signed network drawn from Wikipedia, and achieve the accuracy over 85% (balanced data), which improves the prediction accuracy by nearly 5% over traditional algorithm, indeed, our result has outperformed most existing methods.
机译:考虑正面(比如,支持,信任等)和负(不喜欢,反对,不信任等)的社交网络被称为签名社交网络,其边缘标志预测问题在朋友中具有重要的应用价值推荐系统。我们首次应用随机森林来预测从维基百科汲取的签名网络中边缘的迹象,并达到85%(平衡数据)的准确性,这将通过传统算法提高预测精度近5%,确实如此,我们的结果表现优于现有的方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号