• Title/Summary/Keyword: item-based filtering

Search Result 146, Processing Time 0.029 seconds

Recommendation System using 2-Way Hybrid Collaborative Filtering in E-Business (전자상거래에서 2-Way 혼합 협력적 필터링을 이용한 추천 시스템)

  • 김용집;정경용;이정현
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.175-178
    • /
    • 2003
  • Two defects have been pointed out in existing user-based collaborative filtering such as sparsity and scalability, and the research has been also made progress, which tries to improve these defects using item-based collaborative filtering. Actually there were many results, but the problem of sparsity still remains because of being based on an explicit data. In addition, the issue has been pointed out. which attributes of item arenot reflected in the recommendation. This paper suggests a recommendation method using nave Bayesian algorithm in hybrid user and item-based collaborative filtering to improve above-mentioned defects of existing item-based collaborative filtering. This method generates a similarity table for each user and item, then it improves the accuracy of prediction and recommendation item using naive Bayesianalgorithm. It was compared and evaluated with existing item-based collaborative filtering technique to estimate the accuracy.

  • PDF

A Study on Improving Efficiency of Recommendation System Using RFM (RFM을 활용한 추천시스템 효율화 연구)

  • Jeong, Sora;Jin, Seohoon
    • Journal of the Korean Institute of Plant Engineering
    • /
    • v.23 no.4
    • /
    • pp.57-64
    • /
    • 2018
  • User-based collaborative filtering is a method of recommending an item to a user based on the preference of the neighbor users who have similar purchasing history to the target user. User-based collaborative filtering is based on the fact that users are strongly influenced by the opinions of other users with similar interests. Item-based collaborative filtering is a method of recommending an item by comparing the similarity of the user's previously preferred items. In this study, we create a recommendation model using user-based collaborative filtering and item-based collaborative filtering with consumer's consumption data. Collaborative filtering is performed by using RFM (recency, frequency, and monetary) technique with purchasing data to recommend items with high purchase potential. We compared the performance of the recommendation system with the purchase amount and the performance when applying the RFM method. The performance of recommendation system using RFM technique is better.

Improvement of Item-Based Collaborative Filtering by Applying Each Customer's Purchase Patterns in Offline Shopping Malls (오프라인 쇼핑몰에서 고객의 과거 구매 패턴을 활용한 아이템 기반 협업필터링 성능 개선에 관한 연구)

  • Jeong, Seok Bong
    • Journal of Information Technology Applications and Management
    • /
    • v.24 no.4
    • /
    • pp.1-12
    • /
    • 2017
  • Item-based collaborative filtering (IBCF) is an important technology that is widely used in recommender system of online shopping malls. It uses historical information to compute item-item similarity and make predictions. However, in offline shopping each customer's purchasing pattern can be occurred continuously and repeatedly due to time and space constraints contrast to online shopping. Those facts can make IBCF to have limitations from being applied to offline shopping malls directly. In order to improve the quality of recommendations made by IBCF in offline shopping mall, we propose an ensemble approach that considers both item-item similarity of IBCF and each customer's purchasing patterns which are modeled by item networks. Our experimental results show that this approach produces recommendation results superior to those of existing works such as pure IBCF or bestseller approaches.

A Combined Forecast Scheme of User-Based and Item-based Collaborative Filtering Using Neighborhood Size (이웃크기를 이용한 사용자기반과 아이템기반 협업여과의 결합예측 기법)

  • Choi, In-Bok;Lee, Jae-Dong
    • The KIPS Transactions:PartB
    • /
    • v.16B no.1
    • /
    • pp.55-62
    • /
    • 2009
  • Collaborative filtering is a popular technique that recommends items based on the opinions of other people in recommender systems. Memory-based collaborative filtering which uses user database can be divided in user-based approaches and item-based approaches. User-based collaborative filtering predicts a user's preference of an item using the preferences of similar neighborhood, while item-based collaborative filtering predicts the preference of an item based on the similarity of items. This paper proposes a combined forecast scheme that predicts the preference of a user to an item by combining user-based prediction and item-based prediction using the ratio of the number of similar users and the number of similar items. Experimental results using MovieLens data set and the BookCrossing data set show that the proposed scheme improves the accuracy of prediction for movies and books compared with the user-based scheme and item-based scheme.

Collaborative Filtering Algorithm Based on User-Item Attribute Preference

  • Ji, JiaQi;Chung, Yeongjee
    • Journal of information and communication convergence engineering
    • /
    • v.17 no.2
    • /
    • pp.135-141
    • /
    • 2019
  • Collaborative filtering algorithms often encounter data sparsity issues. To overcome this issue, auxiliary information of relevant items is analyzed and an item attribute matrix is derived. In this study, we combine the user-item attribute preference with the traditional similarity calculation method to develop an improved similarity calculation approach and use weights to control the importance of these two elements. A collaborative filtering algorithm based on user-item attribute preference is proposed. The experimental results show that the performance of the recommender system is the most optimal when the weight of traditional similarity is equal to that of user-item attribute preference similarity. Although the rating-matrix is sparse, better recommendation results can be obtained by adding a suitable proportion of user-item attribute preference similarity. Moreover, the mean absolute error of the proposed approach is less than that of two traditional collaborative filtering algorithms.

A Predictive Algorithm using 2-way Collaborative Filtering for Recommender Systems (추천 시스템을 위한 2-way 협동적 필터링 방법을 이용한 예측 알고리즘)

  • Park, Ji-Sun;Kim, Taek-Hun;Ryu, Young-Suk;Yang, Sung-Bong
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.9
    • /
    • pp.669-675
    • /
    • 2002
  • In recent years most of personalized recommender systems in electronic commerce utilize collaborative filtering algorithm in order to recommend more appropriate items. User-based collaborative filtering is based on the ratings of other users who have similar preferences to a user in order to predict the rating of an item that the user hasn't seen yet. This nay decrease the accuracy of prediction because the similarity between two users is computed with respect to the two users and only when an item has been rated by the users. In item-based collaborative filtering, the preference of an item is predicted based on the similarity between the item and each of other items that have rated by users. This method, however, uses the ratings of users who are not the neighbors of a user for computing the similarity between a pair of items. Hence item-based collaborative filtering may degrade the accuracy of a recommender system. In this paper, we present a new approach that a user's neighborhood is used when we compute the similarity between the items in traditional item-based collaborative filtering in order to compensate the weak points of the current item-based collaborative filtering and to improve the prediction accuracy. We empirically evaluate the accuracy of our approach to compare with several different collaborative filtering approaches using the EachMovie collaborative filtering data set. The experimental results show that our approach provides better quality in prediction and recommendation list than other collaborative filtering approaches.

A Social Travel Recommendation System using Item-based collaborative filtering

  • Kim, Dae-ho;Song, Je-in;Yoo, So-yeop;Jeong, Ok-ran
    • Journal of Internet Computing and Services
    • /
    • v.19 no.3
    • /
    • pp.7-14
    • /
    • 2018
  • As SNS(Social Network Service) becomes a part of our life, new information can be derived through various information provided by SNS. Through the public timeline analysis of SNS, we can extract the latest tour trends for the public and the intimacy through the social relationship analysis in the SNS. The extracted intimacy can also be used to make the personalized recommendation by adding the weights to friends with high intimacy. We apply SNS elements such as analyzed latest trends and intimacy to item-based collaborative filtering techniques to achieve better accuracy and satisfaction than existing travel recommendation services in a new way. In this paper, we propose a social travel recommendation system using item - based collaborative filtering.

A Model-based Collaborative Filtering Through Regularized Discriminant Analysis Using Market Basket Data

  • Lee, Jong-Seok;Jun, Chi-Hyuck;Lee, Jae-Wook;Kim, Soo-Young
    • Management Science and Financial Engineering
    • /
    • v.12 no.2
    • /
    • pp.71-85
    • /
    • 2006
  • Collaborative filtering, among other recommender systems, has been known as the most successful recommendation technique. However, it requires the user-item rating data, which may not be easily available. As an alternative, some collaborative filtering algorithms have been developed recently by utilizing the market basket data in the form of the binary user-item matrix. Viewing the recommendation scheme as a two-class classification problem, we proposed a new collaborative filtering scheme using a regularized discriminant analysis applied to the binary user-item data. The proposed discriminant model was built in terms of the major principal components and was used for predicting the probability of purchasing a particular item by an active user. The proposed scheme was illustrated with two modified real data sets and its performance was compared with the existing user-based approach in terms of the recommendation precision.

Scalable Collaborative Filtering Technique based on Adaptive Clustering (적응형 군집화 기반 확장 용이한 협업 필터링 기법)

  • Lee, O-Joun;Hong, Min-Sung;Lee, Won-Jin;Lee, Jae-Dong
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.73-92
    • /
    • 2014
  • An Adaptive Clustering-based Collaborative Filtering Technique was proposed to solve the fundamental problems of collaborative filtering, such as cold-start problems, scalability problems and data sparsity problems. Previous collaborative filtering techniques were carried out according to the recommendations based on the predicted preference of the user to a particular item using a similar item subset and a similar user subset composed based on the preference of users to items. For this reason, if the density of the user preference matrix is low, the reliability of the recommendation system will decrease rapidly. Therefore, the difficulty of creating a similar item subset and similar user subset will be increased. In addition, as the scale of service increases, the time needed to create a similar item subset and similar user subset increases geometrically, and the response time of the recommendation system is then increased. To solve these problems, this paper suggests a collaborative filtering technique that adapts a condition actively to the model and adopts the concepts of a context-based filtering technique. This technique consists of four major methodologies. First, items are made, the users are clustered according their feature vectors, and an inter-cluster preference between each item cluster and user cluster is then assumed. According to this method, the run-time for creating a similar item subset or user subset can be economized, the reliability of a recommendation system can be made higher than that using only the user preference information for creating a similar item subset or similar user subset, and the cold start problem can be partially solved. Second, recommendations are made using the prior composed item and user clusters and inter-cluster preference between each item cluster and user cluster. In this phase, a list of items is made for users by examining the item clusters in the order of the size of the inter-cluster preference of the user cluster, in which the user belongs, and selecting and ranking the items according to the predicted or recorded user preference information. Using this method, the creation of a recommendation model phase bears the highest load of the recommendation system, and it minimizes the load of the recommendation system in run-time. Therefore, the scalability problem and large scale recommendation system can be performed with collaborative filtering, which is highly reliable. Third, the missing user preference information is predicted using the item and user clusters. Using this method, the problem caused by the low density of the user preference matrix can be mitigated. Existing studies on this used an item-based prediction or user-based prediction. In this paper, Hao Ji's idea, which uses both an item-based prediction and user-based prediction, was improved. The reliability of the recommendation service can be improved by combining the predictive values of both techniques by applying the condition of the recommendation model. By predicting the user preference based on the item or user clusters, the time required to predict the user preference can be reduced, and missing user preference in run-time can be predicted. Fourth, the item and user feature vector can be made to learn the following input of the user feedback. This phase applied normalized user feedback to the item and user feature vector. This method can mitigate the problems caused by the use of the concepts of context-based filtering, such as the item and user feature vector based on the user profile and item properties. The problems with using the item and user feature vector are due to the limitation of quantifying the qualitative features of the items and users. Therefore, the elements of the user and item feature vectors are made to match one to one, and if user feedback to a particular item is obtained, it will be applied to the feature vector using the opposite one. Verification of this method was accomplished by comparing the performance with existing hybrid filtering techniques. Two methods were used for verification: MAE(Mean Absolute Error) and response time. Using MAE, this technique was confirmed to improve the reliability of the recommendation system. Using the response time, this technique was found to be suitable for a large scaled recommendation system. This paper suggested an Adaptive Clustering-based Collaborative Filtering Technique with high reliability and low time complexity, but it had some limitations. This technique focused on reducing the time complexity. Hence, an improvement in reliability was not expected. The next topic will be to improve this technique by rule-based filtering.

User and Item based Collaborative Filtering Using Classification Property Naive Bayesian (분류 속성과 Naive Bayesian을 이용한 사용자와 아이템 기반의 협력적 필터링)

  • Kim, Jong-Hun;Kim, Yong-Jip;Rim, Kee-Wook;Lee, Jung-Hyun;Chung, Kyung-Yong
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.11
    • /
    • pp.23-33
    • /
    • 2007
  • The collaborative filtering has used the nearest neighborhood method based on the preference and the similarity using the Pearson correlation coefficient. Therefore, it does not reflect content of the items and has the problems of the sparsity and scalability as well. the item-based collaborative filtering has been practically used to improve these defects, but it still does not reflect attributes of the item. In this paper, we propose the user and item based collaborative filtering using the classification property and Naive Bayesian to supplement the defects in the existing recommendation system. The proposed method complexity refers to the item similarity based on explicit data and the user similarity based on implicit data for handing the sparse problem. It applies to the Naive Bayesian to the result of reference. Also, it can enhance the accuracy as computation of the item similarity reflects on the correlative rank among the classification property to reflect attributes.