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

• Journal of KIISE:Software and Applications
• /
• v.36 no.4
• /
• pp.298-305
• /
• 2009

In contrast to content_based filtering systems, collaborative filtering systems not only don't contain information of items, they can not recommend items when users don't provide the information of their interests. In this paper, we propose the recommender agent using association item tree to solve the shortcomings of collaborative filtering systems. Firstly, the proposed method clusters users into groups using vector space model and K-means algorithm and selects group typical rating values. Secondly, the degree of associations between items is extracted from computing mutual information between items and an associative item tree is generated by group. Finally, the method recommends items to an active user by using a group typical rating value and an association item tree. The recommender agent recommends items by combining user information with item information. In addition, it can accurately recommend items to an active user, whose information is insufficient at first rate, by using an association item tree based on mutual information for the similarity between items. The proposed method is compared with previous methods on the data set of MovieLens recommender system.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.702-705
• /
• 2004

Collaborative filtering (CF) is originally based on the ratings of customers who vote on the items they used. When customers' votes are not available, user-item binary data set which represents choice and non-choice can also be used in this analysis. In this case the similarities between active user and the other users must be modified. Therefore we compare eight types of binary similarities by applying them in the modified CF Algorithm. Some experimental results will be reported.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.5
• /
• pp.61-69
• /
• 2014

Collaborative filtering recommendation creates similar item subset or similar user subset based on user preference about items and predict user preference to particular item by using them. Thus, if preference matrix has low density, reliability of recommendation will be sharply decreased. To solve these problems we suggest Hybrid Preference Prediction Technique Using Weighting based Data Reliability. Preference prediction is carried out by creating similar item subset and similar user subset and predicting user preference by each subset and merging each predictive value by weighting point applying model condition. According to this technique, we can increase accuracy of user preference prediction and implement recommendation system which can provide highly reliable recommendation when density of preference matrix is low. Efficiency of this system is verified by Mean Absolute Error. Proposed technique shows average 21.7% improvement than Hao Ji's technique when preference matrix sparsity is more than 84% through experiment.

• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.457-466
• /
• 2004

Recommendation is to offer information which fits user's interests and tastes to provide better services and to reduce information overload. It recently draws attention upon Internet users and information providers. The collaborative filtering is one of the widely used methods for recommendation. It recommends an item to a user based on the reference users' preferences for the target item or the target user's preferences for the reference items. In this paper, we propose a neural network based collaborative filtering method. Our method builds a model by learning correlation between users or items using a multi-layer perceptron. We also investigate integration of diverse information to solve the sparsity problem and selecting the reference users or items based on similarity to improve performance. We finally demonstrate that our method outperforms the existing methods through experiments using the EachMovie data.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.346-348
• /
• 2022

Media Contents Recommendation Web Service (service name 'mobodra') is a web service that analyzes media types and genre tastes for each user and recommends content accordingly. Users select some of the works randomly provided on the web when signing up for membership and analyze their tastes based on this. Based on this analysis, preferred content for each user is recommended. In this paper, we implement a content recommendation algorithm through item-based collaborative filtering. When the user's activity data or preference is re-examined, the above process is executed again to update the user's taste.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.17-24
• /
• 2011

Collaborative filtering system is the clustering about user is built and then based on that clustering results will recommend the preferred item to the user. However, building user clustering is time consuming and also once the users evaluate and give feedback about the film then rebuilding the system is not simple. In this paper, genre pattern of movie recommendation systems is being used and in order to simplify and reduce time of rebuilding user clustering. A Frequent pattern networks is used and then extracts user preference genre patterns and through that extracted patterns user clustering will be built. Through built the clustering for all neighboring users to collaborative filtering is applied and then recommends movies to the user. When receiving user information feedback, traditional collaborative filtering is to rebuild the clustering for all neighbouring users to research and do the clustering. However by using frequent pattern Networks, through user clustering based on genre pattern, collaborative filtering is applied and when rebuilding user clustering inquiry limited by search time can be reduced. After receiving user information feedback through proposed user clustering based on genre pattern, the time that need to spent on re-establishing user clustering can be reduced and also enable the possibility of traditional collaborative filtering systems and recommendation of a similar performance.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.9
• /
• pp.149-155
• /
• 2022

The popularity of e-commerce systems on the Internet is increasing day by day, and the recommendation system, as a core function of these systems, greatly reduces the effort to search for desired products by recommending products that customers may prefer. The collaborative filtering technique is a recommendation algorithm that has been successfully implemented in many commercial systems, but despite its popularity and usefulness in academia, the memory-based implementation has inaccuracies in its reference neighbor. To solve this problem, this study proposes a new time-aware collaborative filtering technique that integrates and utilizes the neighbors of each item and each user, weighting the recent similarity more than the past similarity with them, and reflecting it in the recommendation list decision. Through the experimental evaluation, it was confirmed that the proposed method showed superior performance in terms of prediction accuracy than other existing methods.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.7
• /
• pp.9-16
• /
• 2016

Collaborative filtering(CF) uses the purchase or item rating history of other users, but does not need additional properties or attributes of users and items. Hence CF is known th be the most successful recommendation technology. But conventional CF approach has some significant weakness, such as the new user problem. In this paper, we propose a approach using word embedding with skip-gram for learning distributed item representations. In particular, we show that this approach can be used to capture precise item for solving the "new user problem." The proposed approach has been tested on the Movielens databases. We compare the performance of the user based CF, item based CF and our approach by observing the change of recommendation results according to the different number of item rating information. The experimental results shows the improvement in our approach in measuring the precision applied to new user problem situations.

• Journal of KIISE
• /
• v.44 no.6
• /
• pp.621-627
• /
• 2017

Collaborative filtering is a technique that effectively recommends unrated items for users. Collaborative filtering is based on the similarity of the items evaluated by users. The existing top-N recommendation methods are based on pair-wise and list-wise preference models. However, these methods do not effectively represent the relative preference of items that are evaluated by users, and can not reflect the importance of each item. In this paper, we propose a new method to represent user's latent preference by combining an existing preference model and the notion of inverse user frequency. The proposed method improves the accuracy of existing methods by up to two times.