Title: A privacy-preserving collaborative filtering approach using Hellinger distance similarity metric for high dimensional dataset

Authors: Anupama Angadi; Satya Keerthi Gorripati

Addresses: Department of Computer Science and Engineering, GITAM University, Visakhapatnam, India ' Computer Science and Engineering, Gayatri Vidya Parishad College of Engineering (Autonomous), Visakhapatnam, AP, India

Abstract: By proposing items or particulars to users, collaborative recommenders (CR) have become significant on internet applications. Recommender algorithms suggest recommendations to users, that are utmost similar to those earlier consumptions. To suggest recommendations, the system requires users' sensitive information such as browsing history, purchase activities, and demographics. Unfortunately, this information may be misused by malicious third parties for endorsing their products. In this paper, we present a privacy-preserving recommender system approach to protect sensitive information against breaches. Our framework is initiated on homomorphic encryption, which is used to conceal the sensitive information of the users from third parties. While the user's preferences, favourites, like-tasted neighbourhood, and suggestions are transmitted over the network in an encryption form. However, traditional neighbourhood CR uses Jaccard similarity faces difficulty in handling high-dimensional and sparse data. The proposed approach diminishes these issues by exploiting the Hellinger similarity metric. The efficacy of the proposed model is accurate as regards computation also outperforming existing traditional solutions.

Keywords: collaborative filtering; privacy; data encryption; recommender systems.

DOI: 10.1504/IJBIS.2025.145569

International Journal of Business Information Systems, 2025 Vol.48 No.4, pp.555 - 572

Received: 03 Mar 2021
Accepted: 02 Aug 2021
Published online: 04 Apr 2025 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article