A New Strategy in Trust-Based Recommender System using K-Means Clustering

Recommender systems are among the most important parts of online systems, including online stores such as Amazon, Netflix that have become very popular in the recent years. These systems lead users to finding desired information and goods in electronic environments. Recommender systems are one of the main tools to overcome the problem of information overload. Collaborative filtering (CF) is one of the best approaches for recommender systems and are spreading as a dominant approach. However, they have the problem of cold-start and data sparsity. Trust-based approaches try to create a neighborhood and network of trusted users that demonstrate users’ trust in each other’s opinions. As such, these systems recommend items based on users’ relationships. In the proposed method, we try to resolve the problems of low coverage rate and high RMSE rate in trust-based recommender systems using k-means clustering and ant colony algorithm (TBRSK). For clustering data, the k-means method has been used on MovieLens and Epinion datasets and the rating matrix is calculated to have the least overlapping.

@article{Sani2017,
  title     = {A New Strategy in Trust-Based Recommender System using K-Means Clustering},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {8},
  number    = {9},
  year      = {2017},
  publisher = {The Science and Information Organization},
  author    = {Naeem Shahabi Sani and Ferial Najian Tabriz},
  doi       = {10.14569/IJACSA.2017.080922},
  url       = {https://doi.org/10.14569/IJACSA.2017.080922}
}