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

Optimization of the Hybrid Movie Recommendation System Based on Weighted Classification and User Collaborative Filtering Algorithm

Author

Listed:
  • Zhenning Yuan
  • Jong Han Lee
  • Sai Zhang
  • Zhihan Lv

Abstract

Aiming at the problem that the single model of the traditional recommendation system cannot accurately capture user preferences, this paper proposes a hybrid movie recommendation system and optimization method based on weighted classification and user collaborative filtering algorithm. The sparse linear model is used as the basic recommendation model, and the local recommendation model is trained based on user clustering, and the top-N personalized recommendation of movies is realized by fusion with the weighted classification model. According to the item category preference, the scoring matrix is converted into a low-dimensional, dense item category preference matrix, multiple cluster centers are obtained, the distance between the target user and each cluster center is calculated, and the target user is classified into the closest cluster. Finally, the collaborative filtering algorithm is used to predict the scores for the unrated items of the target user to form a recommendation list. The items are clustered through the item category preference, and the high-dimensional rating matrix is converted into a low-dimensional item category preference matrix, which further reduces the sparsity of the data. Experiments based on the Douban movie dataset verify that the recommendation algorithm proposed in this article solves the shortcomings of a single algorithm model to a certain extent and improves the recommendation effect.

Suggested Citation

  • Zhenning Yuan & Jong Han Lee & Sai Zhang & Zhihan Lv, 2021. "Optimization of the Hybrid Movie Recommendation System Based on Weighted Classification and User Collaborative Filtering Algorithm," Complexity, Hindawi, vol. 2021, pages 1-13, June.
  • Handle: RePEc:hin:complx:4476560
    DOI: 10.1155/2021/4476560
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/4476560.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/4476560.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/4476560?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:4476560. 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.