IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6958596.html
   My bibliography  Save this article

Affinity Propagation-Based Hybrid Personalized Recommender System

Author

Listed:
  • Iqbal Qasim
  • Mujtaba Awan
  • Sikandar Ali
  • Shumaila Khan
  • Mogeeb A. A. Mosleh
  • Ahmed Alsanad
  • Hizbullah Khattak
  • Mahmood Alam
  • Muhammad Ahmad

Abstract

A personalized recommender system is broadly accepted as a helpful tool to handle the information overload issue while recommending a related piece of information. This work proposes a hybrid personalized recommender system based on affinity propagation (AP), namely, APHPRS. Affinity propagation is a semisupervised machine learning algorithm used to cluster items based on similarities among them. In our approach, we first calculate the cluster quality and density and then combine their outputs to generate a new ranking score among clusters for the personalized recommendation. In the first phase, user preferences are collected and normalized as items rating matrix. This generated matrix is then clustered offline using affinity propagation and kept in a database for future recommendations. In the second phase, online recommendations are generated by applying the offline model. Negative Euclidian similarity and the quality of clusters are used together to select the best clusters for recommendations. The proposed APHPRS system alleviates problems such as sparsity and cold-start problems. The use of affinity propagation and the hybrid recommendation technique used in the proposed approach helps in improving results against sparsity. Experiments reveal that the proposed APHPRS performs better than most of the existing recommender systems.

Suggested Citation

  • Iqbal Qasim & Mujtaba Awan & Sikandar Ali & Shumaila Khan & Mogeeb A. A. Mosleh & Ahmed Alsanad & Hizbullah Khattak & Mahmood Alam & Muhammad Ahmad, 2022. "Affinity Propagation-Based Hybrid Personalized Recommender System," Complexity, Hindawi, vol. 2022, pages 1-12, January.
  • Handle: RePEc:hin:complx:6958596
    DOI: 10.1155/2022/6958596
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2022/6958596.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2022/6958596.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/6958596?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:complx:6958596. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.