• Title/Summary/Keyword: SVD, 협업 필터링

Search Result 14, Processing Time 0.029 seconds

Improving Collaborative Filtering with Rating Prediction Based on Taste Space (협업 필터링 추천시스템에서의 취향 공간을 이용한 평가 예측 기법)

  • Lee, Hyung-Dong;Kim, Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.34 no.5
    • /
    • pp.389-395
    • /
    • 2007
  • Collaborative filtering is a popular technique for information filtering to reduce information overload and widely used in application such as recommender system in the E-commerce domain. Collaborative filtering systems collect human ratings and provide Predictions based on the ratings of other people who share the same tastes. The quality of predictions depends on the number of items which are commonly rated by people. Therefore, it is difficult to apply pure collaborative filtering algorithm directly to dynamic collections where items are constantly added or removed. In this paper we suggest a method for managing dynamic collections. It creates taste space for items using a technique called Singular Vector Decomposition (SVD) and maintains clusters of core items on the space to estimate relevance of past and future items. To evaluate the proposed method, we divide database of user ratings into those of old and new items and analyze predicted ratings of the latter. And we experimentally show our method is efficiently applied to dynamic collections.

RMSE Comparison of SVD Algorithms for Tax Accountant Recommendation Service (세무사 추천 서비스를 위한 SVD 알고리즘의 RMSE 비교)

  • Won-Jib Kim;Ji-Hye Huh;Se-Bean Park;Su-Min Lee;Eu-Na Kwon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.963-964
    • /
    • 2023
  • 추천 시스템은 사용자의 선호도를 정확히 파악하는 것이 중요하다. 이를 위해 사용자 데이터를 분석하여 추천을 제공하는 협업 필터링 알고리즘을 활용한다. 하지만 상품의 종류와 고객 수가 많아짐에 따라 사용자 선호도 정확도가 떨어지는 문제점이 있다. 이 문제를 해결하기 위해 제안된 방법은 모델 기반 협업 필터링이며, 이는 고객과 사용자의 정보를 직접적으로 추천하는 대신 모델을 학습시키는데 활용된다. 이에 논문은 추천시스템에서 자주 사용되는 모델 협업 필터링 기반 SVD 모델을 학습 전에 하이퍼파라미터를 조절하여 모델에 추정 정확도 값인 RMSE를 측정한다.

A Comparative Study on Collaborative Filtering Algorithm (협업 필터링 알고리즘에 관한 비교연구)

  • Li, Jiapei;Li, Xiaomeng;Lee, HyunChang;Shin, SeongYoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.151-153
    • /
    • 2017
  • In recommendation system, collaborative filtering is the most important algorithm. Collaborative filtering is a method of making automatic predictions about the interests of a user by collecting preferences or taste information from many users. In this paper five algorithms were used. Metrics such as Recall-Precision, FPR-TPR,RMSE, MSE, MAE were calculated. From the result of the experiment, the user-based collaborative filtering was the best approach to recommend movies to users.

  • PDF

A Study on Comparison of Recommendation Algorithms for Specific Domains (특정 도메인에 적합한 추천 알고리즘 비교에 관한 연구)

  • Lee, HyunChang;Shin, SeongYoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.05a
    • /
    • pp.101-102
    • /
    • 2018
  • 협업 필터링은 데이터 분석을 통한 추천 시스템에서 대표적인 방법이다. 사용 방법은 다양한 아이템에 대해서 사용자들의 평가 데이터를 활용하여 공통적인 패턴을 찾아서 특정 사용자에 대한 선호 아이템을 추천하는 기법이다. 이에 본 논문에서는 여러 가지 알고리즘을 사용하여 지표 측정에 활용하였으며, 사용자 선호에 대한 예측에 적합한 알고리즘을 찾아서 제시하였다.

  • PDF

A Study on Comparison of Recommendation Algorithms for Specific Domains (특정 도메인에 적합한 추천 알고리즘 비교에 관한 연구)

  • Lee, HyunChang;Shin, SeongYoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.05a
    • /
    • pp.426-427
    • /
    • 2018
  • 협업 필터링은 데이터 분석을 통한 추천 시스템에서 대표적인 방법이다. 사용 방법은 다양한 아이템에 대해서 사용자들의 평가 데이터를 활용하여 공통적인 패턴을 찾아서 특정 사용자에 대한 선호 아이템을 추천하는 기법이다. 이에 본 논문에서는 여러 가지 알고리즘을 사용하여 지표 측정에 활용하였으며, 사용자 선호에 대한 예측에 적합한 알고리즘을 찾아서 제시하였다.

  • PDF

Comparison of Recommendation Algorithms for Specific Domains (특정 도메인을 위한 추천 알고리즘 비교에 관한 연구)

  • Lee, HyunChang;Shin, SeongYoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2019.05a
    • /
    • pp.482-483
    • /
    • 2019
  • 협업 필터링은 데이터 분석을 통한 추천 시스템에서 대표적인 방법이다. 사용 방법은 다양한 아이템에 대해서 사용자들의 평가 데이터를 활용하여 공통적인 패턴을 찾아서 특정 사용자에 대한 선호 아이템을 추천하는 기법이다. 이에 본 논문에서는 여러 가지 알고리즘을 사용하여 지표 측정에 활용하였으며, 사용자 선호에 대한 예측에 적합한 알고리즘을 찾아서 제시하였다.

  • PDF

Comparison of Recommendation Algorithms for Specific Domains (도메인 기반 추천 알고리즘 비교 연구)

  • Lee, HyunChang;Shin, SeongYoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.563-564
    • /
    • 2021
  • 협업 필터링은 데이터 분석을 통한 추천 시스템에서 대표적인 방법이다. 사용 방법은 다양한 아이템에 대해서 사용자들의 평가 데이터를 활용하여 공통적인 패턴을 찾아서 특정 사용자에 대한 선호 아이템을 추천하는 기법이다. 이에 본 논문에서는 여러 가지 알고리즘을 사용하여 지표 측정에 활용하였으며, 사용자 선호에 대한 예측에 적합한 알고리즘을 찾아서 제시하였다.

  • PDF

Collaborative filtering-based recommendation algorithm research (협업 필터링 기반 추천 알고리즘 연구)

  • Lee, Hyun-Chang;Shin, Seong-Yoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.655-656
    • /
    • 2022
  • Among the analysis methods for a recommendation system, collaborative filtering is a major representative method in a recommendation system based on data analysis. A general usage method is a technique of finding a common pattern by using evaluation data of users for various items, and recommending a preferred item for a specific user. Therefore, in this paper, various algorithms were used to measure the index, and an algorithm suitable for prediction of user preference was found and presented.

  • PDF

Collaborative Filtering using Co-Occurrence and Similarity information (상품 동시 발생 정보와 유사도 정보를 이용한 협업적 필터링)

  • Na, Kwang Tek;Lee, Ju Hong
    • Journal of Internet Computing and Services
    • /
    • v.18 no.3
    • /
    • pp.19-28
    • /
    • 2017
  • Collaborative filtering (CF) is a system that interprets the relationship between a user and a product and recommends the product to a specific user. The CF model is advantageous in that it can recommend products to users with only rating data without any additional information such as contents. However, there are many cases where a user does not give a rating even after consuming the product as well as consuming only a small portion of the total product. This means that the number of ratings observed is very small and the user rating matrix is very sparse. The sparsity of this rating data poses a problem in raising CF performance. In this paper, we concentrate on raising the performance of latent factor model (especially SVD). We propose a new model that includes product similarity information and co occurrence information in SVD. The similarity and concurrence information obtained from the rating data increased the expressiveness of the latent space in terms of latent factors. Thus, Recall increased by 16% and Precision and NDCG increased by 8% and 7%, respectively. The proposed method of the paper will show better performance than the existing method when combined with other recommender systems in the future.

A personalized exercise recommendation system using dimension reduction algorithms

  • Lee, Ha-Young;Jeong, Ok-Ran
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.6
    • /
    • pp.19-28
    • /
    • 2021
  • Nowadays, interest in health care is increasing due to Coronavirus (COVID-19), and a lot of people are doing home training as there are more difficulties in using fitness centers and public facilities that are used together. In this paper, we propose a personalized exercise recommendation algorithm using personalized propensity information to provide more accurate and meaningful exercise recommendation to home training users. Thus, we classify the data according to the criteria for obesity with a k-nearest neighbor algorithm using personal information that can represent individuals, such as eating habits information and physical conditions. Furthermore, we differentiate the exercise dataset by the level of exercise activities. Based on the neighborhood information of each dataset, we provide personalized exercise recommendations to users through a dimensionality reduction algorithm (SVD) among model-based collaborative filtering methods. Therefore, we can solve the problem of data sparsity and scalability of memory-based collaborative filtering recommendation techniques and we verify the accuracy and performance of the proposed algorithms.