基于机器学习的人口统计过滤电影推荐系统

Lee Jia Yin, Noor Zuraidin Mohd Safar, H. Kamaludin, N. Abdullah, Mohd Azahari Mohd Yusof, Catur Supriyanto
{"title":"基于机器学习的人口统计过滤电影推荐系统","authors":"Lee Jia Yin, Noor Zuraidin Mohd Safar, H. Kamaludin, N. Abdullah, Mohd Azahari Mohd Yusof, Catur Supriyanto","doi":"10.30880/jscdm.2023.04.01.001","DOIUrl":null,"url":null,"abstract":"In this era of big data explosion, humans widely use the movie recommendation system as an information tool. There are two common issues found in the machine learning movie recommendation system that is still undeniable: first, cold start, and second, data sparsity. To minimize the problems, a research study is conducted to find a decision-making algorithm to solve the complex start problem in a movie recommendation system with precise parameters. It involves the implementation of the proposed demographics filtering technique with the k-means clustering method. The research findings present the effects of demographic filtering for movie recommendations. Demographic filtering can group users into clusters based on gender, age group, and occupation. The clusters distribution representative group based on the top 100 results of the experiment. The user with the least distance to the cluster center is chosen as the usual group in that cluster. Three clusters were experimented: Cluster 0, Cluster 1, and Cluster 2. Cluster 0 has a representative group of male, college, or graduate students aged 25 to 34. Cluster 1 has a representative group of females, executive or managerial, aged 25 to 34. Cluster 2 has a representative group of males, sales or marketing aged 35 to 44. It is shown that user from different collection has various preferred movie genre. The preferred movie genre in Cluster 0 is action, adventure, comedy, drama, and war. Cluster 1 has preferred comedy, crime, drama, horror, romance, and sci-fi movie genres. Cluster 2 has chosen action, comedy, drama, film-noir, mystery, and thriller movie genres. This research has contributed to the demographic filtering studies as an alternative solution for future technical development work.","PeriodicalId":415396,"journal":{"name":"Journal of Soft Computing and Data Mining","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Adopting Machine Learning in Demographic Filtering for Movie Recommendation System\",\"authors\":\"Lee Jia Yin, Noor Zuraidin Mohd Safar, H. Kamaludin, N. Abdullah, Mohd Azahari Mohd Yusof, Catur Supriyanto\",\"doi\":\"10.30880/jscdm.2023.04.01.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this era of big data explosion, humans widely use the movie recommendation system as an information tool. There are two common issues found in the machine learning movie recommendation system that is still undeniable: first, cold start, and second, data sparsity. To minimize the problems, a research study is conducted to find a decision-making algorithm to solve the complex start problem in a movie recommendation system with precise parameters. It involves the implementation of the proposed demographics filtering technique with the k-means clustering method. The research findings present the effects of demographic filtering for movie recommendations. Demographic filtering can group users into clusters based on gender, age group, and occupation. The clusters distribution representative group based on the top 100 results of the experiment. The user with the least distance to the cluster center is chosen as the usual group in that cluster. Three clusters were experimented: Cluster 0, Cluster 1, and Cluster 2. Cluster 0 has a representative group of male, college, or graduate students aged 25 to 34. Cluster 1 has a representative group of females, executive or managerial, aged 25 to 34. Cluster 2 has a representative group of males, sales or marketing aged 35 to 44. It is shown that user from different collection has various preferred movie genre. The preferred movie genre in Cluster 0 is action, adventure, comedy, drama, and war. Cluster 1 has preferred comedy, crime, drama, horror, romance, and sci-fi movie genres. Cluster 2 has chosen action, comedy, drama, film-noir, mystery, and thriller movie genres. This research has contributed to the demographic filtering studies as an alternative solution for future technical development work.\",\"PeriodicalId\":415396,\"journal\":{\"name\":\"Journal of Soft Computing and Data Mining\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Soft Computing and Data Mining\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.30880/jscdm.2023.04.01.001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Soft Computing and Data Mining","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30880/jscdm.2023.04.01.001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在这个大数据爆炸的时代,人类广泛使用电影推荐系统作为一种信息工具。在机器学习电影推荐系统中发现了两个不可否认的常见问题:第一,冷启动,第二,数据稀疏性。为了最大限度地减少问题,研究寻找一种决策算法来解决具有精确参数的电影推荐系统中复杂的启动问题。它涉及到用k均值聚类方法实现所提出的人口统计过滤技术。研究结果显示了人口统计过滤对电影推荐的影响。人口统计过滤可以根据性别、年龄组和职业将用户分组。基于前100个实验结果的聚类分布代表组。选择与集群中心距离最小的用户作为该集群中的常规组。实验了三个集群:集群0、集群1和集群2。聚类0的代表群体是年龄在25到34岁之间的男性、大学生或研究生。第1组有一组具有代表性的女性,她们是行政人员或管理人员,年龄在25至34岁之间。集群2有代表性的男性群体,年龄在35岁至44岁之间,从事销售或营销工作。结果表明,来自不同收藏的用户有不同的偏好电影类型。最受欢迎的电影类型是动作、冒险、喜剧、戏剧和战争。集群1偏爱喜剧、犯罪、戏剧、恐怖、爱情和科幻电影类型。第二组选择了动作片、喜剧、剧情片、黑色电影、悬疑片和惊悚片。这项研究有助于人口过滤研究,作为未来技术发展工作的另一种解决办法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Adopting Machine Learning in Demographic Filtering for Movie Recommendation System
In this era of big data explosion, humans widely use the movie recommendation system as an information tool. There are two common issues found in the machine learning movie recommendation system that is still undeniable: first, cold start, and second, data sparsity. To minimize the problems, a research study is conducted to find a decision-making algorithm to solve the complex start problem in a movie recommendation system with precise parameters. It involves the implementation of the proposed demographics filtering technique with the k-means clustering method. The research findings present the effects of demographic filtering for movie recommendations. Demographic filtering can group users into clusters based on gender, age group, and occupation. The clusters distribution representative group based on the top 100 results of the experiment. The user with the least distance to the cluster center is chosen as the usual group in that cluster. Three clusters were experimented: Cluster 0, Cluster 1, and Cluster 2. Cluster 0 has a representative group of male, college, or graduate students aged 25 to 34. Cluster 1 has a representative group of females, executive or managerial, aged 25 to 34. Cluster 2 has a representative group of males, sales or marketing aged 35 to 44. It is shown that user from different collection has various preferred movie genre. The preferred movie genre in Cluster 0 is action, adventure, comedy, drama, and war. Cluster 1 has preferred comedy, crime, drama, horror, romance, and sci-fi movie genres. Cluster 2 has chosen action, comedy, drama, film-noir, mystery, and thriller movie genres. This research has contributed to the demographic filtering studies as an alternative solution for future technical development work.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
5.60
自引率
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学术官方微信