A new framework for collaborative filtering with p-moment-based similarity measure: Algorithm, optimization and application

作者:

Highlights:

摘要

In this paper, a general framework of user-based collaborative filtering (CF) is developed with a new p-moment-based similarity measure. The p-moment-based statistics (PMS) of individual rating data are employed to analyze the user rating habit, thereby facilitating the performance improvement of the CF algorithm. On the basis of the PMS, a new yet comprehensive similarity measure is proposed to quantify the distance between two users with focus on both the users’ preferences on items and their rating habits. Compared with the traditional ones, our proposed similarity measure is more general with clearer application insights in complicated situations. Furthermore, the weights of different statistics are regarded as adjustable parameters that are determined by utilizing the particle swarm optimization technique so as to achieve good prediction performance. Based on the proposed similarity measure with optimized weights, the neighborhood set consisting of similar users is formed and then the user-based rating prediction is eventually provided. The developed CF algorithm has advantages of high prediction accuracy and wide application potential. Moreover, this CF algorithm is applied on a real-world disease (Friedreich’s ataxia) assessment system in order to assist diagnosis for patients with uncertain/missing information. Experimental results demonstrate the validity and efficiency of the proposed algorithm.

论文关键词:Collaborative filtering,Similarity measure,Information entropy,Statistical information set,Particle swarm optimization,Friedreich’s Ataxia,Disease assessment

论文评审过程:Received 25 February 2022, Revised 6 April 2022, Accepted 19 April 2022, Available online 26 April 2022, Version of Record 10 May 2022.

论文官网地址:https://doi.org/10.1016/j.knosys.2022.108874