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

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.

Authors

Institutions

Publication Details

Journal
International Journal of Business Information Systems
Published
2025-01-01
DOI
https://doi.org/10.1504/ijbis.2025.145569
Citations
1
Primary Topic
Face recognition and analysis
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Satya Keerthi Gorripati, Anupama Angadi
1 citations
International Journal of Business Information Systems
Face recognition and analysis
1.28
article

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

Satya Keerthi Gorripati, Anupama Angadi
article en
1 citations

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.

International Journal of Business Information SystemsVol. 48(4)
Seva Mandir (IN), GITAM University (IN)
Openalex Percentile: Top 22%
Face recognition and analysis
1.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A privacy-preserving collaborative filtering approach using Hellinger distance similarity metric for high dimensional dataset — Satya Keerthi Gorripati, Anupama Angadi · International Journal of Business Information Systems (2025) | TGRS Research Map | TGRS