在线社交网络中好友推荐的关系相似性模型

Miraj Mohajireen, Charith Ellepola, Madura Perera, Indika Kahanda, Upulee Kanewala
{"title":"在线社交网络中好友推荐的关系相似性模型","authors":"Miraj Mohajireen, Charith Ellepola, Madura Perera, Indika Kahanda, Upulee Kanewala","doi":"10.1109/ICIINFS.2011.6038090","DOIUrl":null,"url":null,"abstract":"Suggesting friends is a very important aspect in any online social network. In this paper, we present a relational similarity model for suggesting friends in online social networks, which uses relational features as opposed to the non-relational features that are used in current friend suggestion applications. We take a supervised learning approach and build a model that uses information of not only the two central users but also of their current neighborhoods. We use a dataset from Facebook to evaluate the accuracy of our model by comparing the performance of feature sets belonging to relational/non-relational categories and boolean and numerical sub categories. We show experimentally that the relational information improves the accuracy of boolean features but does not affect the performance of numerical features. Moreover, we show that our overall model is highly accurate in recommending people in online social networks.","PeriodicalId":353966,"journal":{"name":"2011 6th International Conference on Industrial and Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Relational similarity model for suggesting friends in online social networks\",\"authors\":\"Miraj Mohajireen, Charith Ellepola, Madura Perera, Indika Kahanda, Upulee Kanewala\",\"doi\":\"10.1109/ICIINFS.2011.6038090\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Suggesting friends is a very important aspect in any online social network. In this paper, we present a relational similarity model for suggesting friends in online social networks, which uses relational features as opposed to the non-relational features that are used in current friend suggestion applications. We take a supervised learning approach and build a model that uses information of not only the two central users but also of their current neighborhoods. We use a dataset from Facebook to evaluate the accuracy of our model by comparing the performance of feature sets belonging to relational/non-relational categories and boolean and numerical sub categories. We show experimentally that the relational information improves the accuracy of boolean features but does not affect the performance of numerical features. Moreover, we show that our overall model is highly accurate in recommending people in online social networks.\",\"PeriodicalId\":353966,\"journal\":{\"name\":\"2011 6th International Conference on Industrial and Information Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 6th International Conference on Industrial and Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIINFS.2011.6038090\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 6th International Conference on Industrial and Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIINFS.2011.6038090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

在任何在线社交网络中,推荐朋友都是一个非常重要的方面。在本文中,我们提出了一个用于在线社交网络中推荐朋友的关系相似性模型,该模型使用关系特征而不是当前朋友建议应用中使用的非关系特征。我们采用监督学习的方法,建立一个模型,不仅使用两个中心用户的信息,还使用他们当前的邻居的信息。我们使用来自Facebook的数据集,通过比较属于关系/非关系类别和布尔和数字子类别的特征集的性能来评估我们模型的准确性。实验表明,关系信息提高了布尔特征的准确性,但不影响数值特征的性能。此外,我们证明了我们的整体模型在在线社交网络中推荐人员时是高度准确的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Relational similarity model for suggesting friends in online social networks
Suggesting friends is a very important aspect in any online social network. In this paper, we present a relational similarity model for suggesting friends in online social networks, which uses relational features as opposed to the non-relational features that are used in current friend suggestion applications. We take a supervised learning approach and build a model that uses information of not only the two central users but also of their current neighborhoods. We use a dataset from Facebook to evaluate the accuracy of our model by comparing the performance of feature sets belonging to relational/non-relational categories and boolean and numerical sub categories. We show experimentally that the relational information improves the accuracy of boolean features but does not affect the performance of numerical features. Moreover, we show that our overall model is highly accurate in recommending people in online social networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Selective load control to provide primary frequency response in the wake of introducing new large thermal power plants to Sri Lanka A trust computing mechanism for cloud computing with multilevel thresholding Distributed beamforming techniques for dual-hop decode-and-forward MIMO relay networks Performance comparison of optical receivers using different filtering algorithms and modulation schemes A radial basis function neural network approach for multi-hour short term load-price forecasting with type of day parameter
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1