A novel similarity measure SF-IPF for CBKNN with implicit feedback data

IF 1.7 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Rajalakshmi Sivanaiah, Mirnalinee T T, Sakaya Milton R
{"title":"A novel similarity measure SF-IPF for CBKNN with implicit feedback data","authors":"Rajalakshmi Sivanaiah, Mirnalinee T T, Sakaya Milton R","doi":"10.1108/dta-07-2023-0370","DOIUrl":null,"url":null,"abstract":"<h3>Purpose</h3>\n<p>The increasing popularity of music streaming services also increases the need to customize the services for each user to attract and retain customers. Most of the music streaming services will not have explicit ratings for songs; they will have only implicit feedback data, i.e user listening history. For efficient music recommendation, the preferences of the users have to be infered, which is a challenging task.</p><!--/ Abstract__block -->\n<h3>Design/methodology/approach</h3>\n<p>Preferences of the users can be identified from the users' listening history. In this paper, a hybrid music recommendation system is proposed that infers features from user's implicit feedback and uses the hybrid of content-based and collaborative filtering method to recommend songs. A Content Boosted K-Nearest Neighbours (CBKNN) filtering technique was proposed, which used the users' listening history, popularity of songs, song features, and songs of similar interested users for recommending songs. The song features are taken as content features. Song Frequency–Inverse Popularity Frequency (SF-IPF) metric is proposed to find the similarity among the neighbours in collaborative filtering. Million Song Dataset and Echo Nest Taste Profile Subset are used as data sets.</p><!--/ Abstract__block -->\n<h3>Findings</h3>\n<p>The proposed CBKNN technique with SF-IPF similarity measure to identify similar interest neighbours performs better than other machine learning techniques like linear regression, decision trees, random forest, support vector machines, XGboost and Adaboost. The performance of proposed SF-IPF was tested with other similarity metrics like Pearson and Cosine similarity measures, in which SF-IPF results in better performance.</p><!--/ Abstract__block -->\n<h3>Originality/value</h3>\n<p>This method was devised to infer the user preferences from the implicit feedback data and it is converted as rating preferences. The importance of adding content features with collaborative information is analysed in hybrid filtering. A new similarity metric SF-IPF is formulated to identify the similarity between the users in collaborative filtering.</p><!--/ Abstract__block -->","PeriodicalId":56156,"journal":{"name":"Data Technologies and Applications","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Data Technologies and Applications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1108/dta-07-2023-0370","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Purpose

The increasing popularity of music streaming services also increases the need to customize the services for each user to attract and retain customers. Most of the music streaming services will not have explicit ratings for songs; they will have only implicit feedback data, i.e user listening history. For efficient music recommendation, the preferences of the users have to be infered, which is a challenging task.

Design/methodology/approach

Preferences of the users can be identified from the users' listening history. In this paper, a hybrid music recommendation system is proposed that infers features from user's implicit feedback and uses the hybrid of content-based and collaborative filtering method to recommend songs. A Content Boosted K-Nearest Neighbours (CBKNN) filtering technique was proposed, which used the users' listening history, popularity of songs, song features, and songs of similar interested users for recommending songs. The song features are taken as content features. Song Frequency–Inverse Popularity Frequency (SF-IPF) metric is proposed to find the similarity among the neighbours in collaborative filtering. Million Song Dataset and Echo Nest Taste Profile Subset are used as data sets.

Findings

The proposed CBKNN technique with SF-IPF similarity measure to identify similar interest neighbours performs better than other machine learning techniques like linear regression, decision trees, random forest, support vector machines, XGboost and Adaboost. The performance of proposed SF-IPF was tested with other similarity metrics like Pearson and Cosine similarity measures, in which SF-IPF results in better performance.

Originality/value

This method was devised to infer the user preferences from the implicit feedback data and it is converted as rating preferences. The importance of adding content features with collaborative information is analysed in hybrid filtering. A new similarity metric SF-IPF is formulated to identify the similarity between the users in collaborative filtering.

隐式反馈数据 CBKNN 的新型相似性测量 SF-IPF
目的随着音乐流媒体服务的日益普及,为每个用户定制服务以吸引和留住客户的需求也随之增加。大多数音乐流媒体服务都没有明确的歌曲评级,只有隐含的反馈数据,即用户的收听历史。为了实现高效的音乐推荐,必须推断出用户的偏好,而这是一项具有挑战性的任务。本文提出了一种混合音乐推荐系统,它能从用户的隐式反馈中推断出特征,并使用基于内容和协同过滤的混合方法来推荐歌曲。本文提出了一种内容增强 K 近邻(CBKNN)过滤技术,该技术利用用户的收听历史、歌曲流行度、歌曲特征以及类似兴趣用户的歌曲来推荐歌曲。歌曲特征被视为内容特征。提出了歌曲频率-反向流行频率(SF-IPF)指标,用于查找协作过滤中相邻用户之间的相似性。研究结果与线性回归、决策树、随机森林、支持向量机、XGboost 和 Adaboost 等其他机器学习技术相比,利用 SF-IPF 相似性度量来识别相似兴趣邻域的 CBKNN 技术表现更好。提议的 SF-IPF 的性能与其他相似度量(如皮尔逊和余弦相似度量)进行了测试,其中 SF-IPF 的性能更好。分析了在混合过滤中添加内容特征与协作信息的重要性。提出了一种新的相似度量 SF-IPF,用于识别协同过滤中用户之间的相似性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Data Technologies and Applications
Data Technologies and Applications Social Sciences-Library and Information Sciences
CiteScore
3.80
自引率
6.20%
发文量
29
期刊介绍: Previously published as: Program Online from: 2018 Subject Area: Information & Knowledge Management, Library Studies
×
引用
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学术官方微信