IDEAS home Printed from https://ideas.repec.org/a/ids/ijbisy/v48y2025i4p555-572.html
   My bibliography  Save this article

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

Author

Listed:
  • Anupama Angadi
  • Satya Keerthi Gorripati

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.

Suggested Citation

  • Anupama Angadi & Satya Keerthi Gorripati, 2025. "A privacy-preserving collaborative filtering approach using Hellinger distance similarity metric for high dimensional dataset," International Journal of Business Information Systems, Inderscience Enterprises Ltd, vol. 48(4), pages 555-572.
  • Handle: RePEc:ids:ijbisy:v:48:y:2025:i:4:p:555-572
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=145569
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijbisy:v:48:y:2025:i:4:p:555-572. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=172 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.