Hybrid music recommendation based on different dimensions of audio content and an entropy measure

Z. Cataltepe, B. Altinel
{"title":"Hybrid music recommendation based on different dimensions of audio content and an entropy measure","authors":"Z. Cataltepe, B. Altinel","doi":"10.5281/ZENODO.40394","DOIUrl":null,"url":null,"abstract":"Our music recommendation system recommends a song to a user, at a certain time, based on the listening history of the user. Based on different sets of audio features (MFCC, MPITCH, BEAT, STFT) of all available songs, different clusterings of songs are obtained. Users are given recommendations from one of these clusterings. The right clustering for a user is determined based on the Shannon entropy of the distribution of songs the user listened in each clustering. Using this content based recommendation scheme, as opposed to a static set of features resulted in upto 60 percent increase in recommendation success. In addition to the audio features (content) of songs user listened, the singers for the songs and also the most popular songs at the time of recommendation are also available. We introduce two recommendation algorithms that decide on the weight of content cluster, singer cluster and popularity adaptively for each user, based on the user history. Our experiments on user session data consisting of 2000 to 500 sessions and of length 5 to 15 indicate that these adaptive recommendation schemes give better recommendation results than using only content based recommendation.","PeriodicalId":176384,"journal":{"name":"2007 15th European Signal Processing Conference","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 15th European Signal Processing Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5281/ZENODO.40394","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Our music recommendation system recommends a song to a user, at a certain time, based on the listening history of the user. Based on different sets of audio features (MFCC, MPITCH, BEAT, STFT) of all available songs, different clusterings of songs are obtained. Users are given recommendations from one of these clusterings. The right clustering for a user is determined based on the Shannon entropy of the distribution of songs the user listened in each clustering. Using this content based recommendation scheme, as opposed to a static set of features resulted in upto 60 percent increase in recommendation success. In addition to the audio features (content) of songs user listened, the singers for the songs and also the most popular songs at the time of recommendation are also available. We introduce two recommendation algorithms that decide on the weight of content cluster, singer cluster and popularity adaptively for each user, based on the user history. Our experiments on user session data consisting of 2000 to 500 sessions and of length 5 to 15 indicate that these adaptive recommendation schemes give better recommendation results than using only content based recommendation.
基于音频内容不同维度和熵测度的混合音乐推荐
我们的音乐推荐系统根据用户的收听历史,在特定时间向用户推荐一首歌曲。基于所有可用歌曲的不同音频特征集(MFCC、MPITCH、BEAT、STFT),得到不同的歌曲聚类。用户将从这些聚类中的一个中获得建议。用户的正确聚类是基于用户在每个聚类中听到的歌曲分布的香农熵来确定的。使用这种基于内容的推荐方案,而不是静态的功能集,推荐成功率提高了60%。除了用户听过的歌曲的音频功能(内容)外,还提供了该歌曲的歌手以及推荐时最流行的歌曲。我们引入了两种推荐算法,基于用户历史,自适应地确定每个用户的内容簇、歌手簇和流行度的权重。我们对用户会话数据(2000 ~ 500个会话,长度为5 ~ 15)的实验表明,这些自适应推荐方案比仅使用基于内容的推荐效果更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信