M-tree index for music search based on similarity of cosine contours and tags

G. Gombos, Zsolt Zoltán Sajti, J. Szalai-Gindl
{"title":"M-tree index for music search based on similarity of cosine contours and tags","authors":"G. Gombos, Zsolt Zoltán Sajti, J. Szalai-Gindl","doi":"10.1109/CITDS54976.2022.9914099","DOIUrl":null,"url":null,"abstract":"The similarity between songs is an important part of the MIR (Music Information Retrieval), but the definition of the similarity is very subjective. Similarity can be used, for example, in recommendation systems. These systems recommend similar songs based on the user history from a database. To find similar songs in a fast way we have to index the data. Most database indexes are created for exact item searches. GiST (Generalized Search Tree) gives us the possibility to create an index with a distance function between items. These distances can be used for similarity measures. In this paper, we show how can use music similarity for distance in M-tree, which is a distance-based index. Two similarity metrics are used to create an index of music data: song tags and cosine contour.","PeriodicalId":271992,"journal":{"name":"2022 IEEE 2nd Conference on Information Technology and Data Science (CITDS)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 2nd Conference on Information Technology and Data Science (CITDS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CITDS54976.2022.9914099","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The similarity between songs is an important part of the MIR (Music Information Retrieval), but the definition of the similarity is very subjective. Similarity can be used, for example, in recommendation systems. These systems recommend similar songs based on the user history from a database. To find similar songs in a fast way we have to index the data. Most database indexes are created for exact item searches. GiST (Generalized Search Tree) gives us the possibility to create an index with a distance function between items. These distances can be used for similarity measures. In this paper, we show how can use music similarity for distance in M-tree, which is a distance-based index. Two similarity metrics are used to create an index of music data: song tags and cosine contour.
基于余弦轮廓和标签相似性的音乐搜索m树索引
歌曲之间的相似度是音乐信息检索的重要组成部分,但相似度的定义是非常主观的。例如,在推荐系统中可以使用相似性。这些系统根据数据库中的用户历史推荐相似的歌曲。为了快速找到相似的歌曲,我们必须对数据进行索引。大多数数据库索引都是为精确的项搜索而创建的。GiST(广义搜索树)为我们提供了用项目之间的距离函数创建索引的可能性。这些距离可用于相似性度量。在本文中,我们展示了如何在m树中使用音乐相似度作为距离,这是一种基于距离的索引。使用两个相似度度量来创建音乐数据的索引:歌曲标签和余弦轮廓。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信