基于改进的密度网络模型的有效电影推荐

IF 0.6 Q4 COMPUTER SCIENCE, THEORY & METHODS
V. Lakshmi Chetana, Raj Kumar Batchu, Prasad Devarasetty, Srilakshmi Voddelli, Varun Prasad Dalli
{"title":"基于改进的密度网络模型的有效电影推荐","authors":"V. Lakshmi Chetana, Raj Kumar Batchu, Prasad Devarasetty, Srilakshmi Voddelli, Varun Prasad Dalli","doi":"10.3233/mgs-230012","DOIUrl":null,"url":null,"abstract":"In recent times, recommendation systems provide suggestions for users by means of songs, products, movies, books, etc. based on a database. Usually, the movie recommendation system predicts the movies liked by the user based on attributes present in the database. The movie recommendation system is one of the widespread, useful and efficient applications for individuals in watching movies with minimal decision time. Several attempts are made by the researchers in resolving these problems like purchasing books, watching movies, etc. through developing a recommendation system. The majority of recommendation systems fail in addressing data sparsity, cold start issues, and malicious attacks. To overcome the above-stated problems, a new movie recommendation system is developed in this manuscript. Initially, the input data is acquired from Movielens 1M, Movielens 100K, Yahoo Y-10-10, and Yahoo Y-20-20 databases. Next, the data are rescaled using a min-max normalization technique that helps in handling the outlier efficiently. At last, the denoised data are fed to the improved DenseNet model for a relevant movie recommendation, where the developed model includes a weighting factor and class-balanced loss function for better handling of overfitting risk. Then, the experimental result indicates that the improved DenseNet model almost reduced by 5 to 10% of error values, and improved by around 2% of f-measure, precision, and recall values related to the conventional models on the Movielens 1M, Movielens 100K, Yahoo Y-10-10, and Yahoo Y-20-20 databases.","PeriodicalId":43659,"journal":{"name":"Multiagent and Grid Systems","volume":"71 1","pages":"0"},"PeriodicalIF":0.6000,"publicationDate":"2023-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Effective movie recommendation based on improved densenet model\",\"authors\":\"V. Lakshmi Chetana, Raj Kumar Batchu, Prasad Devarasetty, Srilakshmi Voddelli, Varun Prasad Dalli\",\"doi\":\"10.3233/mgs-230012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent times, recommendation systems provide suggestions for users by means of songs, products, movies, books, etc. based on a database. Usually, the movie recommendation system predicts the movies liked by the user based on attributes present in the database. The movie recommendation system is one of the widespread, useful and efficient applications for individuals in watching movies with minimal decision time. Several attempts are made by the researchers in resolving these problems like purchasing books, watching movies, etc. through developing a recommendation system. The majority of recommendation systems fail in addressing data sparsity, cold start issues, and malicious attacks. To overcome the above-stated problems, a new movie recommendation system is developed in this manuscript. Initially, the input data is acquired from Movielens 1M, Movielens 100K, Yahoo Y-10-10, and Yahoo Y-20-20 databases. Next, the data are rescaled using a min-max normalization technique that helps in handling the outlier efficiently. At last, the denoised data are fed to the improved DenseNet model for a relevant movie recommendation, where the developed model includes a weighting factor and class-balanced loss function for better handling of overfitting risk. Then, the experimental result indicates that the improved DenseNet model almost reduced by 5 to 10% of error values, and improved by around 2% of f-measure, precision, and recall values related to the conventional models on the Movielens 1M, Movielens 100K, Yahoo Y-10-10, and Yahoo Y-20-20 databases.\",\"PeriodicalId\":43659,\"journal\":{\"name\":\"Multiagent and Grid Systems\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Multiagent and Grid Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/mgs-230012\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Multiagent and Grid Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/mgs-230012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

近年来,推荐系统以数据库为基础,通过歌曲、产品、电影、书籍等方式为用户提供建议。通常,电影推荐系统根据数据库中存在的属性来预测用户喜欢的电影。电影推荐系统是一个广泛的、有用的、高效的应用程序,为个人在最短的决策时间内观看电影。研究人员尝试通过开发推荐系统来解决这些问题,如购买书籍,看电影等。大多数推荐系统在处理数据稀疏性、冷启动问题和恶意攻击方面失败。为了克服上述问题,本文开发了一个新的电影推荐系统。最初,输入数据从Movielens 1M、Movielens 100K、Yahoo Y-10-10和Yahoo Y-20-20数据库获取。接下来,使用最小-最大归一化技术重新缩放数据,这有助于有效地处理离群值。最后,将去噪后的数据馈送到改进的DenseNet模型中进行相关的电影推荐,其中开发的模型包含加权因子和类平衡损失函数,以便更好地处理过拟合风险。实验结果表明,改进后的DenseNet模型在Movielens 1M、Movielens 100K、Yahoo Y-10-10和Yahoo Y-20-20数据库上,与传统模型相比,误差值几乎降低了5% ~ 10%,f-measure、精度和召回率提高了2%左右。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Effective movie recommendation based on improved densenet model
In recent times, recommendation systems provide suggestions for users by means of songs, products, movies, books, etc. based on a database. Usually, the movie recommendation system predicts the movies liked by the user based on attributes present in the database. The movie recommendation system is one of the widespread, useful and efficient applications for individuals in watching movies with minimal decision time. Several attempts are made by the researchers in resolving these problems like purchasing books, watching movies, etc. through developing a recommendation system. The majority of recommendation systems fail in addressing data sparsity, cold start issues, and malicious attacks. To overcome the above-stated problems, a new movie recommendation system is developed in this manuscript. Initially, the input data is acquired from Movielens 1M, Movielens 100K, Yahoo Y-10-10, and Yahoo Y-20-20 databases. Next, the data are rescaled using a min-max normalization technique that helps in handling the outlier efficiently. At last, the denoised data are fed to the improved DenseNet model for a relevant movie recommendation, where the developed model includes a weighting factor and class-balanced loss function for better handling of overfitting risk. Then, the experimental result indicates that the improved DenseNet model almost reduced by 5 to 10% of error values, and improved by around 2% of f-measure, precision, and recall values related to the conventional models on the Movielens 1M, Movielens 100K, Yahoo Y-10-10, and Yahoo Y-20-20 databases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Multiagent and Grid Systems
Multiagent and Grid Systems COMPUTER SCIENCE, THEORY & METHODS-
CiteScore
1.50
自引率
0.00%
发文量
13
×
引用
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学术官方微信