To read this content please select one of the options below:

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

Rajalakshmi Sivanaiah (Department of Computer Science and Engineering, Sri Sivasubramaniya Nadar College of Engineering, Chennai, India)
Mirnalinee T T (Department of Computer Science and Engineering, Sri Sivasubramaniya Nadar College of Engineering, Chennai, India)
Sakaya Milton R (Department of Computer Science and Engineering, Sri Sivasubramaniya Nadar College of Engineering, Chennai, India)

Data Technologies and Applications

ISSN: 2514-9288

Article publication date: 4 June 2024

Issue publication date: 4 November 2024

41

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.

Keywords

Citation

Sivanaiah, R., T T, M. and Milton R, S. (2024), "A novel similarity measure SF-IPF for CBKNN with implicit feedback data", Data Technologies and Applications, Vol. 58 No. 5, pp. 742-767. https://doi.org/10.1108/DTA-07-2023-0370

Publisher

:

Emerald Publishing Limited

Copyright © 2024, Emerald Publishing Limited

Related articles