Friend Recommendation Engine for Facebook Users via Collaborative Filtering

Mohammed Sanad Alshammari, Aadil Alshammari
{"title":"Friend Recommendation Engine for Facebook Users via Collaborative Filtering","authors":"Mohammed Sanad Alshammari, Aadil Alshammari","doi":"10.15837/ijccc.2023.2.4998","DOIUrl":null,"url":null,"abstract":"\nToday’s internet consists of an abundant amount of information that makes it difficult for recommendation engines to produce satisfying outputs. This huge stream of unrelated data increases its sparsity, which makes the recommender system’s job more challenging. Facebook’s main recommendation task is to recommend a friendship connection based on the idea that a friend of a friend is also a friend; however, the majority of recommendations using this approach lead to little to no interaction. We propose a model using the matrix factorization technique that leverages interactions between Facebook users and generates a list of friendship connections that are very likely to be interactive. We tested our model using a real dataset with over 33 million interactions between users. The accuracy of the proposed algorithm is measured using the error rate of the predicted number of interactions between possible friends in comparison to the actual values.\n","PeriodicalId":179619,"journal":{"name":"Int. J. Comput. Commun. Control","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Comput. Commun. Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15837/ijccc.2023.2.4998","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Today’s internet consists of an abundant amount of information that makes it difficult for recommendation engines to produce satisfying outputs. This huge stream of unrelated data increases its sparsity, which makes the recommender system’s job more challenging. Facebook’s main recommendation task is to recommend a friendship connection based on the idea that a friend of a friend is also a friend; however, the majority of recommendations using this approach lead to little to no interaction. We propose a model using the matrix factorization technique that leverages interactions between Facebook users and generates a list of friendship connections that are very likely to be interactive. We tested our model using a real dataset with over 33 million interactions between users. The accuracy of the proposed algorithm is measured using the error rate of the predicted number of interactions between possible friends in comparison to the actual values.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过协同过滤的Facebook用户好友推荐引擎
今天的互联网包含了大量的信息,这使得推荐引擎很难产生令人满意的输出。这种巨大的不相关数据流增加了它的稀疏性,这使得推荐系统的工作更具挑战性。Facebook的主要推荐任务是基于“朋友的朋友也是朋友”这一理念来推荐朋友关系;然而,使用这种方法的大多数建议几乎没有交互。我们提出了一个使用矩阵分解技术的模型,利用Facebook用户之间的互动,并生成一个很可能是互动的友谊联系列表。我们使用真实的数据集测试了我们的模型,其中包含了用户之间超过3300万次的交互。所提出的算法的准确性是用预测的可能朋友之间的互动次数与实际值的错误率来衡量的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Design and Development of an Efficient Demographic-based Movie Recommender System using Hybrid Machine Learning Techniques Resource manager for heterogeneous processors Fault Diagnosis and Localization of Transmission Lines Based on R-Net Algorithm Optimized by Feature Pyramid Network Holiday Peak Load Forecasting Using Grammatical Evolution-Based Fuzzy Regression Approach A Data-Driven Assessment Model for Metaverse Maturity
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1