社交网络中链接预测方法的实证评价

Ba-Hien Tran, T. Ho
{"title":"社交网络中链接预测方法的实证评价","authors":"Ba-Hien Tran, T. Ho","doi":"10.1109/NICS.2018.8606903","DOIUrl":null,"url":null,"abstract":"Link prediction in social network has attracted increasing attention from a broad range of communities. In this study, we examine the predictive performance and time-efficiency of two group of methods for this problem. The first group consists of similarity metrics, including Jaccard Coefficient (JC), Adamic-Adar Coefficient (AA), Preferential Attachment (PA) and Personalized PageRank (PPR). The second group comprises embedding methods, including Laplacian Eigenmaps (LE), Node2Vec and Variational Graph Auto-Encoders (VGAE). All methods were evaluated extensively on Facebook EgoNets dataset. We observe that Node2Vec is the most efficient method in terms of training time and accuracy on many types of graph. Besides, we also give insights into the properties of these methods, which can be a basis for further research on this topic.","PeriodicalId":137666,"journal":{"name":"2018 5th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Empirical Evaluation of Link Prediction Methods in Social Networks\",\"authors\":\"Ba-Hien Tran, T. Ho\",\"doi\":\"10.1109/NICS.2018.8606903\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Link prediction in social network has attracted increasing attention from a broad range of communities. In this study, we examine the predictive performance and time-efficiency of two group of methods for this problem. The first group consists of similarity metrics, including Jaccard Coefficient (JC), Adamic-Adar Coefficient (AA), Preferential Attachment (PA) and Personalized PageRank (PPR). The second group comprises embedding methods, including Laplacian Eigenmaps (LE), Node2Vec and Variational Graph Auto-Encoders (VGAE). All methods were evaluated extensively on Facebook EgoNets dataset. We observe that Node2Vec is the most efficient method in terms of training time and accuracy on many types of graph. Besides, we also give insights into the properties of these methods, which can be a basis for further research on this topic.\",\"PeriodicalId\":137666,\"journal\":{\"name\":\"2018 5th NAFOSTED Conference on Information and Computer Science (NICS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 5th NAFOSTED Conference on Information and Computer Science (NICS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NICS.2018.8606903\",\"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 5th NAFOSTED Conference on Information and Computer Science (NICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NICS.2018.8606903","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

社交网络中的链接预测越来越受到社会各界的广泛关注。在本研究中,我们检验了两组方法对该问题的预测性能和时间效率。第一组由相似性指标组成,包括Jaccard系数(JC)、adam - adar系数(AA)、preference Attachment (PA)和personalpagerank (PPR)。第二组包括嵌入方法,包括拉普拉斯特征映射(LE)、Node2Vec和变分图自编码器(VGAE)。所有方法都在Facebook EgoNets数据集上进行了广泛的评估。我们观察到,在许多类型的图上,Node2Vec在训练时间和准确率方面是最有效的方法。此外,我们还对这些方法的性质进行了分析,为本课题的进一步研究奠定了基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Empirical Evaluation of Link Prediction Methods in Social Networks
Link prediction in social network has attracted increasing attention from a broad range of communities. In this study, we examine the predictive performance and time-efficiency of two group of methods for this problem. The first group consists of similarity metrics, including Jaccard Coefficient (JC), Adamic-Adar Coefficient (AA), Preferential Attachment (PA) and Personalized PageRank (PPR). The second group comprises embedding methods, including Laplacian Eigenmaps (LE), Node2Vec and Variational Graph Auto-Encoders (VGAE). All methods were evaluated extensively on Facebook EgoNets dataset. We observe that Node2Vec is the most efficient method in terms of training time and accuracy on many types of graph. Besides, we also give insights into the properties of these methods, which can be a basis for further research on this topic.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信