• Title/Summary/Keyword: item-based filtering

Search Result 147, Processing Time 0.026 seconds

Hybrid Movie Recommendation System Using Clustering Technique (클러스터링 기법을 이용한 하이브리드 영화 추천 시스템)

  • Sophort Siet;Sony Peng;Yixuan Yang;Sadriddinov Ilkhomjon;DaeYoung Kim;Doo-Soon Park
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.05a
    • /
    • pp.357-359
    • /
    • 2023
  • This paper proposes a hybrid recommendation system (RS) model that overcomes the limitations of traditional approaches such as data sparsity, cold start, and scalability by combining collaborative filtering and context-aware techniques. The objective of this model is to enhance the accuracy of recommendations and provide personalized suggestions by leveraging the strengths of collaborative filtering and incorporating user context features to capture their preferences and behavior more effectively. The approach utilizes a novel method that combines contextual attributes with the original user-item rating matrix of CF-based algorithms. Furthermore, we integrate k-mean++ clustering to group users with similar preferences and finally recommend items that have highly rated by other users in the same cluster. The process of partitioning is the use of the rating matrix into clusters based on contextual information offers several advantages. First, it bypasses of the computations over the entire data, reducing runtime and improving scalability. Second, the partitioned clusters hold similar ratings, which can produce greater impacts on each other, leading to more accurate recommendations and providing flexibility in the clustering process. keywords: Context-aware Recommendation, Collaborative Filtering, Kmean++ Clustering.

Personalized Recommendation Considering Item Confidence in E-Commerce (온라인 쇼핑몰에서 상품 신뢰도를 고려한 개인화 추천)

  • Choi, Do-Jin;Park, Jae-Yeol;Park, Soo-Bin;Lim, Jong-Tae;Song, Je-O;Bok, Kyoung-Soo;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.19 no.3
    • /
    • pp.171-182
    • /
    • 2019
  • As online shopping malls continue to grow in popularity, various chances of consumption are provided to customers. Customers decide the purchase by exploiting information provided by shopping malls such as the reviews of actual purchasing users, the detailed information of items, and so on. It is required to provide objective and reliable information because customers have to decide on their own whether the massive information is credible. In this paper, we propose a personalized recommendation method considering an item confidence to recommend reliable items. The proposed method determines user preferences based on various behaviors for personalized recommendation. We also propose an user preference measurement that considers time weights to apply the latest propensity to consume. Finally, we predict the preference score of items that have not been used or purchased before, and we recommend items that have highest scores in terms of both the predicted preference score and the item confidence score.

Preference Prediction System using Similarity Weight granted Bayesian estimated value and Associative User Clustering (베이지안 추정치가 부여된 유사도 가중치와 연관 사용자 군집을 이용한 선호도 예측 시스템)

  • 정경용;최성용;임기욱;이정현
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.3_4
    • /
    • pp.316-325
    • /
    • 2003
  • A user preference prediction method using an exiting collaborative filtering technique has used the nearest-neighborhood method based on the user preference about items and has sought the user's similarity from the Pearson correlation coefficient. Therefore, it does not reflect any contents about items and also solve the problem of the sparsity. This study suggests the preference prediction system using the similarity weight granted Bayesian estimated value and the associative user clustering to complement problems of an exiting collaborative preference prediction method. This method suggested in this paper groups the user according to the Genre by using Association Rule Hypergraph Partitioning Algorithm and the new user is classified into one of these Genres by Naive Bayes classifier to slove the problem of sparsity in the collaborative filtering system. Besides, for get the similarity between users belonged to the classified genre and new users, this study allows the different estimated value to item which user vote through Naive Bayes learning. If the preference with estimated value is applied to the exiting Pearson correlation coefficient, it is able to promote the precision of the prediction by reducing the error of the prediction because of missing value. To estimate the performance of suggested method, the suggested method is compared with existing collaborative filtering techniques. As a result, the proposed method is efficient for improving the accuracy of prediction through solving problems of existing collaborative filtering techniques.

Affection-enhanced Personalized Question Recommendation in Online Learning

  • Mingzi Chen;Xin Wei;Xuguang Zhang;Lei Ye
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.12
    • /
    • pp.3266-3285
    • /
    • 2023
  • With the popularity of online learning, intelligent tutoring systems are starting to become mainstream for assisting online question practice. Surrounded by abundant learning resources, some students struggle to select the proper questions. Personalized question recommendation is crucial for supporting students in choosing the proper questions to improve their learning performance. However, traditional question recommendation methods (i.e., collaborative filtering (CF) and cognitive diagnosis model (CDM)) cannot meet students' needs well. The CDM-based question recommendation ignores students' requirements and similarities, resulting in inaccuracies in the recommendation. Even CF examines student similarities, it disregards their knowledge proficiency and struggles when generating questions of appropriate difficulty. To solve these issues, we first design an enhanced cognitive diagnosis process that integrates students' affection into traditional CDM by employing the non-compensatory bidimensional item response model (NCB-IRM) to enhance the representation of individual personality. Subsequently, we propose an affection-enhanced personalized question recommendation (AE-PQR) method for online learning. It introduces NCB-IRM to CF, considering both individual and common characteristics of students' responses to maintain rationality and accuracy for personalized question recommendation. Experimental results show that our proposed method improves the accuracy of diagnosed student cognition and the appropriateness of recommended questions.

Target Marketing Method on Specific Item Using Chi-Square Analysis and Item-based Collaborative Filtering (카이스퀘어 분석과 아이템기반 협력적 여과를 이용한 타겟마케팅 기법)

  • Kim, Wan-Seop;Lee, Soo-Won
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.607-609
    • /
    • 2005
  • 온라인 및 오프라인 상에서 추천시스템에 대한 요구가 커지고 있으며 이에 관련해 않은 연구가 이루어지고 있다. 추천시스템은 마케팅 활용의 관점에서 목표 상품에 대한 반응 가능성이 높은 고객군을 추천하는 타겟마케팅 추천시스템과 고객 개인별로 구매 가능성이 높은 상품을 추천하는 개인화 추천시스템으로 구분할 수 있다. 지금까지의 추천시스템에 관한 연구는 대부분 개인화 추천시스템의 효율 향상에 목표를 두고 있다. 그러나 기업의 타겟마케팅에 대한 요구를 적절히 지원하지 못하고 있어 타겟마케팅에 대한 연구가 필요하다. 본 연구에서는 상품별 구매 패턴을 이용하는 프로파일 기반 추천 방법을 제안하고 이 방법과 기존의 협력적 추천 방법을 결합하여 특정 상품에 반응 가능성이 높은 고객을 추천하는 방법을 제안한다. 프로파일 기반 추천에서는 카이스퀘어 검정을 사용하여 상품별로 구매 패턴에 영향을 미치는 요인을 추출하고 이를 이용하여 특징 고객군을 선별하여 전체 고객군과 특징 고객과의 엔트로피(Entropy)의 변이 정도를 예측값으로 사용한다. 실험결과, 프로파일 기반 추천과 협력적 추천을 결합하여 추천하는 방법은 한 가지 방법을 사용할 때 보다 좋은 추천 정확도를 나타내었다.

  • PDF

Collaborative Filtering System using Self-Organizing Map for Web Personalization (자기 조직화 신경망(SOM)을 이용한 협력적 여과 기법의 웹 개인화 시스템에 대한 연구)

  • 강부식
    • Journal of Intelligence and Information Systems
    • /
    • v.9 no.3
    • /
    • pp.117-135
    • /
    • 2003
  • This study is to propose a procedure solving scale problem of traditional collaborative filtering (CF) approach. The CF approach generally uses some similarity measures like correlation coefficient. So, as the user of the Website increases, the complexity of computation increases exponentially. To solve the scale problem, this study suggests a clustering model-based approach using Self-Organizing Map (SOM) and RFM (Recency, Frequency, Momentary) method. SOM clusters users into some user groups. The preference score of each item in a group is computed using RFM method. The items are sorted and stored in their preference score order. If an active user logins in the system, SOM determines a user group according to the user's characteristics. And the system recommends items to the user using the stored information for the group. If the user evaluates the recommended items, the system determines whether it will be updated or not. Experimental results applied to MovieLens dataset show that the proposed method outperforms than the traditional CF method comparatively in the recommendation performance and the computation complexity.

  • PDF

Performance Evaluation of Personalized Textile Sensibility Design Recommendation System based on the Client-Server Model (클라이언트-서버 모델 기반의 개인화 텍스타일 감성 디자인 추천 시스템의 성능 평가)

  • Jung Kyung-Yong;Kim Jong-Hun;Na Young-Joo;Lee Jung-Hyun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.2
    • /
    • pp.112-123
    • /
    • 2005
  • The latest E-commerce sites provide personalized services to maximize user satisfaction for Internet user The collaborative filtering is an algorithm for personalized item real-time recommendation. Various supplementary methods are provided for improving the accuracy of prediction and performance. It is important to consider these two things simultaneously to implement a useful recommendation system. However, established studies on collaborative filtering technique deal only with the matter of accuracy improvement and overlook the matter of performance. This study considers representative attribute-neighborhood, recommendation textile set, and similarity grouping that are expected to improve performance to the recommendation agent system. Ultimately, this paper suggests empirical applications to verify the adequacy and the validity on this system with the development of Fashion Design Recommendation Agent System (FDRAS ).

Integration of Similarity Values Reflecting Rating Time for Collaborative Filtering

  • Lee, Soojung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.1
    • /
    • pp.83-89
    • /
    • 2022
  • As a representative technique of recommender systems, collaborative filtering has been successfully in service through many commercial and academic systems. This technique recommends items highly rated by similar neighbor users, based on similarity of ratings on common items rated by two users. Recently research on time-aware recommender systems has been conducted, which attempts to improve system performance by reflecting user rating time of items. However, the decay rate uniform to past ratings has a risk of lowering the rating prediction performance of the system. This study proposes a rating time-aware similarity measure between users, which is a novel approach different from previous ones. The proposed approach considers changes of similarity value over time, not item rating time. In order to evaluate performance of the proposed method, experiments using various parameter values and types of time change functions are conducted, resulting in improving prediction accuracy of existing traditional similarity measures significantly.

A Design of Customized Market Analysis Scheme Using SVM and Collaboration Filtering Scheme (SVM과 협업적 필터링 기법을 이용한 소비자 맞춤형 시장 분석 기법 설계)

  • Jeong, Eun-Hee;Lee, Byung-Kwan
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.6
    • /
    • pp.609-616
    • /
    • 2016
  • This paper is proposed a customized market analysis method using SVM and collaborative filtering. The proposed customized market analysis scheme is consists of DC(Data Classification) module, ICF(Improved Collaborative Filtering) module, and CMA(Customized Market Analysis) module. DC module classifies the characteristics of on-line and off-line shopping mall and traditional markets into price, quality, and quantity using SVM. ICF module calculates the similarity by adding age weight and job weight, and generates network using the similarity of purchased item each users, and makes a recommendation list of neighbor nodes. And CMA module provides the result of customized market analysis using the data classification result of DC module and the recommendation list of ICF module. As a result of comparing the proposed customized recommendation list with the existing user based recommendation list, the case of recommendation list using the existing collaborative filtering scheme, precision is 0.53, recall is 0.56, and F-measure is 0.57. But the case of proposed customized recommendation list, precision is 0.78, recall is 0.85, and F-measure is 0.81. That is, the proposed customized recommendation list shows more precision.

Development of Personalized Recommendation System using RFM method and k-means Clustering (RFM기법과 k-means 기법을 이용한 개인화 추천시스템의 개발)

  • Cho, Young-Sung;Gu, Mi-Sug;Ryu, Keun-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.6
    • /
    • pp.163-172
    • /
    • 2012
  • Collaborative filtering which is used explicit method in a existing recommedation system, can not only reflect exact attributes of item but also still has the problem of sparsity and scalability, though it has been practically used to improve these defects. This paper proposes the personalized recommendation system using RFM method and k-means clustering in u-commerce which is required by real time accessablity and agility. In this paper, using a implicit method which is is not used complicated query processing of the request and the response for rating, it is necessary for us to keep the analysis of RFM method and k-means clustering to be able to reflect attributes of the item in order to find the items with high purchasablity. The proposed makes the task of clustering to apply the variable of featured vector for the customer's information and calculating of the preference by each item category based on purchase history data, is able to recommend the items with efficiency. To estimate the performance, the proposed system is compared with existing system. As a result, it can be improved and evaluated according to the criteria of logicality through the experiment with dataset, collected in a cosmetic internet shopping mall.