본문 바로가기
  • Home

Optimizing Similarity for User-based Collaborative Filtering

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2024, 29(11), pp.243-250
  • DOI : 10.9708/jksci.2024.29.11.243
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : October 4, 2024
  • Accepted : November 1, 2024
  • Published : November 29, 2024

Soojung Lee 1

1경인교육대학교

Accredited

ABSTRACT

Collaborative filtering is one of the most widely known implementation methods of recommender systems, which recommends items that similar users have preferred in the past. Therefore, similarity measurement is a very important factor that determines the performance of the system. In this study, in order to solve the shortcomings of the existing single or integrated heuristic similarity measures, the genetic algorithm was used to calculate the optimal similarity between users per item genre. In addition, in order to solve the data scalability problem, the number of users for calculating similarity for each genre was limited according to a preset threshold, and the average of the ratings of the items was used to solve the data sparsity problem. Through performance experiments, the optimal probabilities of the genetic operators were obtained and the prediction accuracy performance was analyzed. As a result, it was confirmed that the performance of the proposed method was superior to the existing methods, especially in a sparse data environment.

Citation status

* References for papers published after 2023 are currently being built.