基于概率方法的大型社交媒体平台推荐引擎模型

IF 1.5 0 ENGINEERING, MULTIDISCIPLINARY Engineering, Technology & Applied Science Research Pub Date : 2023-10-13 DOI:10.48084/etasr.6325
Aadil Alshammari, Mohammed Alshammari
{"title":"基于概率方法的大型社交媒体平台推荐引擎模型","authors":"Aadil Alshammari, Mohammed Alshammari","doi":"10.48084/etasr.6325","DOIUrl":null,"url":null,"abstract":"Existing recommender system algorithms often find it difficult to interpret and, as a result, to extract meaningful recommendations from social media. Because of this, there is a growing demand for more powerful algorithms that are able to extract information from low-dimensional spaces. One such approach would be the cutting-edge matrix factorization technique. Facebook is one of the most widely used social networking platforms. It has more than one billion monthly active users who engage with each other on the platform by sharing status updates, images, events, and other types of content. Facebook's mission includes fostering stronger connections between individuals, and to that end, the platform employs techniques from recommender systems in an effort to better comprehend the actions and patterns of its users, after which it suggests forming new connections with other users. However, relatively little study has been done in this area to investigate the low-dimensional spaces included within the black box system by employing methods such as matrix factorization. Using a probabilistic matrix factorization approach, the interactions that users have with the posts of other users, such as liking, commenting, and other similar activities, were utilized in an effort to generate a list of potential friends that the user who is the focus of this work may not yet be familiar with. The proposed model performed better in terms of suggestion accuracy in comparison to the original matrix factorization, which resulted in the creation of a recommendation list that contained more correct information.","PeriodicalId":11826,"journal":{"name":"Engineering, Technology & Applied Science Research","volume":"68 1","pages":"0"},"PeriodicalIF":1.5000,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Recommendation Engine Model for Giant Social Media Platforms using a Probabilistic Approach\",\"authors\":\"Aadil Alshammari, Mohammed Alshammari\",\"doi\":\"10.48084/etasr.6325\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Existing recommender system algorithms often find it difficult to interpret and, as a result, to extract meaningful recommendations from social media. Because of this, there is a growing demand for more powerful algorithms that are able to extract information from low-dimensional spaces. One such approach would be the cutting-edge matrix factorization technique. Facebook is one of the most widely used social networking platforms. It has more than one billion monthly active users who engage with each other on the platform by sharing status updates, images, events, and other types of content. Facebook's mission includes fostering stronger connections between individuals, and to that end, the platform employs techniques from recommender systems in an effort to better comprehend the actions and patterns of its users, after which it suggests forming new connections with other users. However, relatively little study has been done in this area to investigate the low-dimensional spaces included within the black box system by employing methods such as matrix factorization. Using a probabilistic matrix factorization approach, the interactions that users have with the posts of other users, such as liking, commenting, and other similar activities, were utilized in an effort to generate a list of potential friends that the user who is the focus of this work may not yet be familiar with. The proposed model performed better in terms of suggestion accuracy in comparison to the original matrix factorization, which resulted in the creation of a recommendation list that contained more correct information.\",\"PeriodicalId\":11826,\"journal\":{\"name\":\"Engineering, Technology & Applied Science Research\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2023-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Engineering, Technology & Applied Science Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48084/etasr.6325\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering, Technology & Applied Science Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48084/etasr.6325","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

现有的推荐系统算法通常很难解释,因此很难从社交媒体中提取有意义的推荐。正因为如此,对能够从低维空间中提取信息的更强大的算法的需求不断增长。其中一种方法是先进的矩阵分解技术。Facebook是使用最广泛的社交网络平台之一。它拥有超过10亿的月活跃用户,他们通过分享状态更新、图片、事件和其他类型的内容在平台上相互交流。Facebook的使命包括加强个人之间的联系,为此,该平台采用了推荐系统的技术,以更好地理解用户的行为和模式,然后建议与其他用户建立新的联系。然而,在这一领域,利用矩阵分解等方法研究黑箱系统中包含的低维空间的研究相对较少。使用概率矩阵分解方法,利用用户与其他用户的帖子之间的交互,例如点赞、评论和其他类似的活动,来生成潜在朋友的列表,而作为这项工作重点的用户可能还不熟悉这些列表。与原始的矩阵分解相比,该模型在建议准确性方面表现更好,从而创建了包含更多正确信息的推荐列表。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Recommendation Engine Model for Giant Social Media Platforms using a Probabilistic Approach
Existing recommender system algorithms often find it difficult to interpret and, as a result, to extract meaningful recommendations from social media. Because of this, there is a growing demand for more powerful algorithms that are able to extract information from low-dimensional spaces. One such approach would be the cutting-edge matrix factorization technique. Facebook is one of the most widely used social networking platforms. It has more than one billion monthly active users who engage with each other on the platform by sharing status updates, images, events, and other types of content. Facebook's mission includes fostering stronger connections between individuals, and to that end, the platform employs techniques from recommender systems in an effort to better comprehend the actions and patterns of its users, after which it suggests forming new connections with other users. However, relatively little study has been done in this area to investigate the low-dimensional spaces included within the black box system by employing methods such as matrix factorization. Using a probabilistic matrix factorization approach, the interactions that users have with the posts of other users, such as liking, commenting, and other similar activities, were utilized in an effort to generate a list of potential friends that the user who is the focus of this work may not yet be familiar with. The proposed model performed better in terms of suggestion accuracy in comparison to the original matrix factorization, which resulted in the creation of a recommendation list that contained more correct information.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Engineering, Technology & Applied Science Research
Engineering, Technology & Applied Science Research ENGINEERING, MULTIDISCIPLINARY-
CiteScore
3.00
自引率
46.70%
发文量
222
审稿时长
11 weeks
期刊最新文献
Malware Attack Detection in Large Scale Networks using the Ensemble Deep Restricted Boltzmann Machine Enhancement of Power System Security by the Intelligent Control of a Static Synchronous Series Compensator Mix Design of Fly Ash and GGBS based Geopolymer Concrete activated with Water Glass A New Approach on the Egyptian Black Sand Ilmenite Alteration Processes Boric Acid as a Safe Insecticide for Controlling the Mediterranean Fruit Fly Ceratitis Capitata Wiedemann (Diptera: Tephritidae)
×
引用
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