• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • No language data
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A Machine Learning Recommender System Based on Collaborative Filtering Using Gaussian Mixture Model Clustering

Shakoor, Delshad M., Maihami, Vafa, Maihami, Reza 01 January 2021 (has links)
With the shift toward online shopping, it has become necessary to customize customers' needs and give them more choices. Before making a purchase, buyers research the products' features. The recommender systems facilitate the search task for customers by narrowing down the search space within specific products that align with the customer's needs. A recommender system uses clustering to filter information, calculating the similarity between members of a cluster to determine the factors that will lead to more accurate predictions. We propose a new method for predicting scores in machine learning recommender systems using the Gaussian mixture model clustering and the Pearson correlation coefficient. The proposed method is applied to MovieLens data. The results are then compared to three commonly used methods: Pearson correlation coefficients, K-means, and fuzzy C-means algorithms. As a result of increasing the number of neighbors, our method shows a lower error than others. Additionally, the results depict that accuracy will increase as the number of users increases. Our model, for instance, is 5% more accurate than existing methods when the neighbor size is 30. Gaussian mixture clustering chooses similar users and takes into account the scores distance when choosing nearby users that are similar to the active user.

Page generated in 0.1352 seconds