基于特征的链路预测

Saoussen Aouay, Salma Jamoussi, F. Gargouri
{"title":"基于特征的链路预测","authors":"Saoussen Aouay, Salma Jamoussi, F. Gargouri","doi":"10.1109/AICCSA.2014.7073243","DOIUrl":null,"url":null,"abstract":"Under the different searches performed to analyzing social networks, much attention has been devoted to the problem of predicting links. It is a key technique in many applications such as recommendation systems which provide suggestions of potential links between nodes. Traditional link prediction methods use a single proximity metric. In this paper, we study link prediction as a supervised learning task where we try to combine multiple features as input data for classification. To improve the accuracy of prediction, we have been applying a select attributes algorithm. Experiments have been performed on two co-authorship data sets. Results demonstrate that Random Forest, k-nearest neighbors and Principal Component Analysis yield the best performances.","PeriodicalId":412749,"journal":{"name":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Feature based link prediction\",\"authors\":\"Saoussen Aouay, Salma Jamoussi, F. Gargouri\",\"doi\":\"10.1109/AICCSA.2014.7073243\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Under the different searches performed to analyzing social networks, much attention has been devoted to the problem of predicting links. It is a key technique in many applications such as recommendation systems which provide suggestions of potential links between nodes. Traditional link prediction methods use a single proximity metric. In this paper, we study link prediction as a supervised learning task where we try to combine multiple features as input data for classification. To improve the accuracy of prediction, we have been applying a select attributes algorithm. Experiments have been performed on two co-authorship data sets. Results demonstrate that Random Forest, k-nearest neighbors and Principal Component Analysis yield the best performances.\",\"PeriodicalId\":412749,\"journal\":{\"name\":\"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICCSA.2014.7073243\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICCSA.2014.7073243","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

在分析社交网络的各种搜索中,预测链接的问题一直是人们关注的焦点。它是许多应用中的关键技术,如推荐系统,提供节点之间潜在联系的建议。传统的链路预测方法使用单一的接近度量。在本文中,我们将链接预测作为一种监督学习任务进行研究,其中我们尝试将多个特征组合为输入数据进行分类。为了提高预测的准确性,我们一直在使用选择属性算法。实验在两个共同作者数据集上进行。结果表明,随机森林、k近邻和主成分分析方法的性能最好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Feature based link prediction
Under the different searches performed to analyzing social networks, much attention has been devoted to the problem of predicting links. It is a key technique in many applications such as recommendation systems which provide suggestions of potential links between nodes. Traditional link prediction methods use a single proximity metric. In this paper, we study link prediction as a supervised learning task where we try to combine multiple features as input data for classification. To improve the accuracy of prediction, we have been applying a select attributes algorithm. Experiments have been performed on two co-authorship data sets. Results demonstrate that Random Forest, k-nearest neighbors and Principal Component Analysis yield the best performances.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信