IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v551y2020ics0378437120300285.html
   My bibliography  Save this article

An analytic approach to separate users by introducing new combinations of initial centers of clustering

Author

Listed:
  • Rashidi, Rahim
  • Khamforoosh, Keyhan
  • Sheikhahmadi, Amir

Abstract

In the recommender systems, the users evaluate and rate data items and assign quantitative indices to them; consequently, a comprehensive database called rating matrix is created. In the rating matrix, the separation of the gray sheep users is of crucial importance since these users increase the error rate of the recommendations to the white users. The proposed approach involved three main steps. In the first step, we introduced a new algorithm called MKMeans++ by extracting and combining some features of the rating matrix as well as applying these combinations to the initial centers of the KMeans clustering, in which Power Item and Power Weight features were added to the new combinations. These features indicated the superiority of the proposed algorithm over the KMeans++ algorithm. In the second step, we probed into the relationship between features of the rating matrix and the gray sheep users, the results of which revealed that the gray sheep users can be identifiable only through the Distance feature. In the third step, we started separating the gray sheep users by using MKMeans++ algorithm and applying the Distance feature. Experimental results on the MovieLens and FilmTrust datasets show that the proposed algorithm outperforms existing methods in terms of the MAE accuracy and Converge. In the proposed algorithm, on average, the amount of the MAE improvement for MovieLens and FilmTrust datasets were 0.15 and 0.24, respectively, while also increasing the quality of clusters and the precision of the recommender system.

Suggested Citation

  • Rashidi, Rahim & Khamforoosh, Keyhan & Sheikhahmadi, Amir, 2020. "An analytic approach to separate users by introducing new combinations of initial centers of clustering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 551(C).
  • Handle: RePEc:eee:phsmap:v:551:y:2020:i:c:s0378437120300285
    DOI: 10.1016/j.physa.2020.124185
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437120300285
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2020.124185?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
    ---><---

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

    References listed on IDEAS

    as
    1. Maihami, Vafa & Zandi, Danesh & Naderi, Kasra, 2019. "Proposing a novel method for improving the performance of collaborative filtering systems regarding the priority of similar users," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    2. Honey Jindal & Shalini Agarwal & Neetu Sardana, 2018. "PowKMeans: A Hybrid Approach for Gray Sheep Users Detection and Their Recommendations," International Journal of Information Technology and Web Engineering (IJITWE), IGI Global, vol. 13(2), pages 56-69, April.
    3. Ramezani, Mohsen & Moradi, Parham & Akhlaghian, Fardin, 2014. "A pattern mining approach to enhance the accuracy of collaborative filtering in sparse data domains," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 408(C), pages 72-84.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rahim Rashidi & Keyhan Khamforoosh & Amir Sheikhahmadi, 2022. "Proposing improved meta-heuristic algorithms for clustering and separating users in the recommender systems," Electronic Commerce Research, Springer, vol. 22(2), pages 623-648, June.
    2. Li, Yanbin & Zhao, Ke & Zhang, Feng, 2023. "Identification of key influencing factors to Chinese coal power enterprises transition in the context of carbon neutrality: A modified fuzzy DEMATEL approach," Energy, Elsevier, vol. 263(PA).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yin, Likang & Deng, Yong, 2018. "Measuring transferring similarity via local information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 498(C), pages 102-115.
    2. Geng, Bingrui & Li, Lingling & Jiao, Licheng & Gong, Maoguo & Cai, Qing & Wu, Yue, 2015. "NNIA-RS: A multi-objective optimization based recommender system," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 424(C), pages 383-397.
    3. Maihami, Vafa & Zandi, Danesh & Naderi, Kasra, 2019. "Proposing a novel method for improving the performance of collaborative filtering systems regarding the priority of similar users," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    4. Latha, R., 2022. "Enhancing recommendation competence in nearest neighbour models," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 592(C).
    5. Hu, Liang & Ren, Liang & Lin, Wenbin, 2018. "A reconsideration of negative ratings for network-based recommendation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 690-701.
    6. Ramezani, Mohsen & Yaghmaee, Farzin, 2016. "A novel video recommendation system based on efficient retrieval of human actions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 457(C), pages 607-623.
    7. Rahim Rashidi & Keyhan Khamforoosh & Amir Sheikhahmadi, 2022. "Proposing improved meta-heuristic algorithms for clustering and separating users in the recommender systems," Electronic Commerce Research, Springer, vol. 22(2), pages 623-648, June.
    8. Moradi, Parham & Ahmadian, Sajad & Akhlaghian, Fardin, 2015. "An effective trust-based recommendation method using a novel graph clustering algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 462-481.

    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:eee:phsmap:v:551:y:2020:i:c:s0378437120300285. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.