• Title/Summary/Keyword: Collaborative preference

Search Result 199, Processing Time 0.028 seconds

Study on Collaborative Filtering Algorithm Considering Temporal Variation of User Preference (사용자 성향의 시간적 변화를 고려한 협업 필터링 알고리즘에 관한 연구)

  • Park, Young-Yong;Lee, Hak-Sung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.5
    • /
    • pp.526-529
    • /
    • 2003
  • Recommender systems or collaborative filtering are methods to identify potentially interesting or valuable items to a particular user Under the assumption that people with similar interest tend to like the similar types of items, these methods use a database on the preference of a set of users and predict the rating on the items that the user has not rated. Usually the preference of a particular user is liable to vary with time and this temporal variation may cause an inaccurate identification and prediction. In this paper we propose a method to adapt the temporal variation of the user preference in order to improve the predictive performance of a collaborative filtering algorithm. To be more specific, the correlation weight of the GroupLens system which is a general formulation of statistical collaborative filtering algorithm is modified to reflect only recent similarity between two user. The proposed method is evaluated for EachMovie dataset and shows much better prediction results compared with GrouPLens system.

Performance Improvement of Collaborative Filtering System Using Associative User′s Clustering Analysis for the Recalculation of Preference and Representative Attribute-Neighborhood (선호도 재계산을 위한 연관 사용자 군집 분석과 Representative Attribute -Neighborhood를 이용한 협력적 필터링 시스템의 성능향상)

  • Jung, Kyung-Yong;Kim, Jin-Su;Kim, Tae-Yong;Lee, Jung-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.10B no.3
    • /
    • pp.287-296
    • /
    • 2003
  • There has been much research focused on collaborative filtering technique in Recommender System. However, these studies have shown the First-Rater Problem and the Sparsity Problem. The main purpose of this Paper is to solve these Problems. In this Paper, we suggest the user's predicting preference method using Bayesian estimated value and the associative user clustering for the recalculation of preference. In addition to this method, to complement a shortcoming, which doesn't regard the attribution of item, we use Representative Attribute-Neighborhood method that is used for the prediction when we find the similar neighborhood through extracting the representative attribution, which most affect the preference. We improved the efficiency by using the associative user's clustering analysis in order to calculate the preference of specific item within the cluster item vector to the collaborative filtering algorithm. Besides, for the problem of the Sparsity and First-Rater, through using Association Rule Hypergraph Partitioning algorithm associative users are clustered according to the genre. New users are classified into one of these genres by Naive Bayes classifier. In addition, in order to get the similarity value between users belonged to the classified genre and new users, and this paper allows the different estimated value to item which user evaluated through Naive Bayes learning. As applying the preference granted the estimated value to Pearson correlation coefficient, it can make the higher accuracy because the errors that cause the missing value come less. We evaluate our method on a large collaborative filtering database of user rating and it significantly outperforms previous proposed method.

Data BILuring Method for Solving Sparseness Problem in Collaborative Filtering (협동적 여과에서의 희소성 문제 해결을 위한 데이타 블러링 기법)

  • Kim, Hyung-Il;Kim, Jun-Tae
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.6
    • /
    • pp.542-553
    • /
    • 2005
  • Recommendation systems analyze user preferences and recommend items to a user by predicting the user's preference for those items. Among various kinds of recommendation methods, collaborative filtering(CF) has been widely used and successfully applied to practical applications. However, collaborative filtering has two inherent problems: data sparseness and the cold-start problems. If there are few known preferences for a user, it is difficult to find many similar users, and therefore the performance of recommendation is degraded. This problem is more serious when a new user is first using the system. In this paper we propose a method of integrating additional feature information of users and items into CF to overcome the difficulties caused by sparseness and improve the accuracy of recommendation. In our method, we first fill in unknown preference values by using the probability distribution of feature values, then generate the top-N recommendations by applying collaborative filtering on the modified data. We call this method of filling unknown preference values as data blurring. Several experimental results that show the effectiveness of the proposed method are also presented.

A Study on the Real-Time Preference Prediction for Personalized Recommendation on the Mobile Device (모바일 기기에서 개인화 추천을 위한 실시간 선호도 예측 방법에 대한 연구)

  • Lee, Hak Min;Um, Jong Seok
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.336-343
    • /
    • 2017
  • We propose a real time personalized recommendation algorithm on the mobile device. We use a unified collaborative filtering with reduced data. We use Fuzzy C-means clustering to obtain the reduced data and Konohen SOM is applied to get initial values of the cluster centers. The proposed algorithm overcomes data sparsity since it extends data to the similar users and similar items. Also, it enables real time service on the mobile device since it reduces computing time by data clustering. Applying the suggested algorithm to the MovieLens data, we show that the suggested algorithm has reasonable performance in comparison with collaborative filtering. We developed Android-based smart-phone application, which recommends restaurants with coupons and restaurant information.

The cluster-indexing collaborative filtering recommendation

  • Park, Tae-Hyup;Ingoo Han
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2003.05a
    • /
    • pp.400-409
    • /
    • 2003
  • Collaborative filtering (CF) recommendation is a knowledge sharing technology for distribution of opinions and facilitating contacts in network society between people with similar interests. The main concerns of the CF algorithm are about prediction accuracy, speed of response time, problem of data sparsity, and scalability. In general, the efforts of improving prediction algorithms and lessening response time are decoupled. We propose a three-step CF recommendation model which is composed of profiling, inferring, and predicting steps while considering prediction accuracy and computing speed simultaneously. This model combines a CF algorithm with two machine learning processes, SOM (Self-Organizing Map) and CBR (Case Based Reasoning) by changing an unsupervised clustering problem into a supervised user preference reasoning problem, which is a novel approach for the CF recommendation field. This paper demonstrates the utility of the CF recommendation based on SOM cluster-indexing CBR with validation against control algorithms through an open dataset of user preference.

  • PDF

A Study of IPTV-VOD Program Recommendation System using Collaborative Filtering (협업 필터링을 이용한 IPTV-VOD 프로그램 추천 시스템에 대한 연구)

  • Sun, Chul-Yong;Kang, Yong-Jin;Park, Kyu-Sik
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.10
    • /
    • pp.1453-1462
    • /
    • 2010
  • In this paper, a new program recommendation system is proposed to recommend user preferred VOD program in IPTV environment. A proposed system is implemented with collaborative filtering method. For a user profile which describes user program preference, a program preference, sub-genre preference, and US(user similarity) weight of the user neighborhood is averaged and updated every week. In order to evaluate system performance, real 24-weeks cable TV watching data provided by Nilson Research Corp. are modified to fit for IPTV broadcasting environment and the simulation result shows quite comparative quality of recommendation. The experimental results optimum performance when user similarity based weighting, five person per group and five recommendation programs are used.

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.

An Approach to Credibility Enhancement of Automated Collaborative Filtering System through Accommodating User's Rating Behavior

  • Sung, Jang-Hwan;Park, Jong-Hun
    • 한국경영정보학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.576-581
    • /
    • 2007
  • The purpose of this paper is to strengthen trust on the automated collaborative filtering system. Automated collaborative filtering system is quickly becoming a popular technique for recommendation system. This elaborative methodology contributes for reducing information overload and the result becomes index of users' preference. In addition, it can be applied to various industries in various fields. After it collaborative filtering system was developed, many researches are executed to enhance credibility and to apply in various fields. Among these diverse systems, collaborative filtering system which uses Pearson correlation coefficient is most common in many researches. In this paper, we proposed new process diagram of collaborative filtering algorithm and new factors which should improve the credibility of system. In addition, the effects and relationships are also tested.

  • 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.

A Study of IPTV-VOD Program Recommendation System Using Hybrid Filtering (복합 필터링을 이용한 IPTV-VOD 프로그램 추천 시스템 연구)

  • Kang, Yong-Jin;Sun, Chul-Yong;Park, Kyu-Sik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.4
    • /
    • pp.9-19
    • /
    • 2010
  • In this paper, a new program recommendation system is proposed to recommend user preferred VOD program in IPTV environment. A proposed system is implemented with hybrid filtering method that can cooperatively complements the shortcomings of the content-based filtering and collaborative filtering. For a user program preference, a single-scaled measure is designed so that the recommendation performance between content-based filtering and collaborative filtering is easily compared and reflected to final hybrid filtering procedure. In order to provide more accurate program recommendation, we use not only the user watching history, but also the user program preference and sub-genre program preference updated every week as a user preference profile. System performance is evaluated with modified IPTV data from real 24-weeks cable TV watching data provided by Nilson Research Corp. and it shows quite comparative quality of recommendation.