A decision-making based feature for link prediction in signed social networks

Tuyen-Thanh-Thi Ho, H. Vu, H. Le
{"title":"A decision-making based feature for link prediction in signed social networks","authors":"Tuyen-Thanh-Thi Ho, H. Vu, H. Le","doi":"10.1109/RIVF.2013.6719888","DOIUrl":null,"url":null,"abstract":"We are interested in signed link prediction where relationships should be predicted as positive (friendship, fan, like, etc) or negative (opposition, anti-fan, dislike, etc). In this problem, feature extraction is an essential step to encode the information needed for prediction. While most current features are based on balance or status theory, we consider the problem of link prediction in the different view of decision-making theory. Our main contribution is a novel feature called Positive-Negative Ratio feature (PNR) which is the ratio between positive and negative links. Our PNR feature, which is based on the strong theory of decision-making, reveals many advantages compared to existing features. It uses a two-dimensional feature but can defeat existing methods at least 3% in classification accuracy and AUC in all three standard databases (Epinions, Slashdot and Wikipedia), even training and testing databases are different. Furthermore, PNR is 5, 1.3 and 1.5 times faster than the other methods in extraction, training and prediction steps, respectively.","PeriodicalId":121216,"journal":{"name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIVF.2013.6719888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We are interested in signed link prediction where relationships should be predicted as positive (friendship, fan, like, etc) or negative (opposition, anti-fan, dislike, etc). In this problem, feature extraction is an essential step to encode the information needed for prediction. While most current features are based on balance or status theory, we consider the problem of link prediction in the different view of decision-making theory. Our main contribution is a novel feature called Positive-Negative Ratio feature (PNR) which is the ratio between positive and negative links. Our PNR feature, which is based on the strong theory of decision-making, reveals many advantages compared to existing features. It uses a two-dimensional feature but can defeat existing methods at least 3% in classification accuracy and AUC in all three standard databases (Epinions, Slashdot and Wikipedia), even training and testing databases are different. Furthermore, PNR is 5, 1.3 and 1.5 times faster than the other methods in extraction, training and prediction steps, respectively.
基于决策的签名社交网络链接预测特征
我们对签名链接预测感兴趣,其中关系应该被预测为积极的(友谊,粉丝,喜欢等)或消极的(反对,反粉丝,不喜欢等)。在这个问题中,特征提取是编码预测所需信息的关键步骤。虽然目前大多数特征都是基于平衡或状态理论,但我们从决策理论的不同角度来考虑链路预测问题。我们的主要贡献是一种称为正负比特征(PNR)的新特征,它是正负链接之间的比率。我们的PNR特征基于强大的决策理论,与现有特征相比显示出许多优势。它使用一个二维特征,但在所有三个标准数据库(Epinions、Slashdot和Wikipedia)中,它的分类准确率和AUC都能超过现有方法至少3%,甚至训练和测试数据库也不同。在提取步骤、训练步骤和预测步骤上,PNR分别比其他方法快5倍、1.3倍和1.5倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信