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

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

• Industrial Engineering and Management Systems
• /
• v.13 no.4
• /
• pp.421-431
• /
• 2014

The market basket data in the form of a binary user-item matrix or a binary item-user matrix can be modelled as a binary classification problem. The binary logistic regression approach tackles the binary classification problem, where principal components are predictor variables. If users or items are sparse in the training data, the binary classification problem can be considered as a cold-start problem. The binary logistic regression approach may not function appropriately if the principal components are inefficient for the cold-start problem. Assuming that the market basket data can also be considered as a special regression problem whose response is either 0 or 1, we propose three supervised learning approaches: random forest regression, random forest classification, and elastic net to tackle the cold-start problem, comparing the performance in a variety of experimental settings. The experimental results show that the proposed supervised learning approaches outperform the conventional approaches.

• KIISE Transactions on Computing Practices
• /
• v.21 no.2
• /
• pp.121-125
• /
• 2015

In recent years, research on collaborative filtering-based recommendation systems emphasized the accuracy of rating predictions, and this has led to an increase in computation time. As a result, such systems have divergeded from the original purpose of making quick recommendations. In this paper, we propose a recommendation algorithm that uses a Preference Difference Metric to reduce the computation time and to maintain adequate performance. The system recommends items according to their preference classification.

• 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 Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.379-386
• /
• 2014

As the use of mobile device is increasing rapidly, the number of users is also increasing. However, most of the app stores are using recommendation of simple ranking method, so the accuracy of recommendation is lower. To recommend an item that is more appropriate to the user, this paper proposes a technique that reflects the weight of user information and recent preference degree of item. The proposed technique classifies the data set by categories and then derives a predicted value by applying the user's information weight to the collaborative filtering technique. To reflect the recent preference degree of item by categories, the average of items' rating values in the designated period is computed. An item is recommended by combining the two result values. The experiment result indicated that the proposed method has been more enhanced the accuracy, appropriacy, compared to item-based, user-based method.

• 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 Information Processing Systems
• /
• v.15 no.1
• /
• pp.127-136
• /
• 2019

User-based and item-based approaches have been developed as the solutions of the movie recommendation problem. However, the user-based approach is faced with the problem of sparsity, and the item-based approach is faced with the problem of not reflecting users' preferences. In order to solve these problems, there is a research on the combination of the two methods using the concept of similarity. In reality, it is not free from the problem of sparsity, since it has a lot of parameters to be calculated. In this study, we propose a combining method that simplifies the combination equation of prior study. This method is relatively free from the problem of sparsity, since it has less parameters to be calculated. Thus, it can get more accurate results by reflecting the users rating to calculate the parameters. It is very fast to predict new movie ratings as well. In experiments for the proposed method, the initial error is large, but the performance gets quickly stabilized after. In addition, it showed about 6% lower average error rate than the existing method using similarity.

• Journal of Information Technology Applications and Management
• /
• v.29 no.6
• /
• pp.81-93
• /
• 2022

As deep learning technology in natural language and visual processing has rapidly developed, collaborative filtering-based recommendation systems using deep learning technology are being actively introduced in the recommendation field. In this study, OCF-GAN, a hybrid collaborative filtering model using GAN, was proposed to solve the one-class and cold-start problems, and its usefulness was verified through performance evaluation. OCF-GAN based on conditional GAN consists of a generator that generates a pattern similar to the actual user preference pattern and a discriminator that tries to distinguish the actual preference pattern from the generated preference pattern. When the training is completed, user preference vectors are generated based on the actual distribution of preferred items. In addition, the cold-start problem was solved by using a hybrid collaborative filtering recommendation method that additionally utilizes user and item profiles. As a result of the performance evaluation, it was found that the performance of the OCF-GAN with additional information was superior in all indicators of the Top 5 and Top 20 recommendations compared to the existing GAN-based recommender. This phenomenon was more clearly revealed in experiments with cold-start users and items.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.439-450
• /
• 2010

In this paper, we propose a new idea to evaluate the prediction accuracy of user's preference generated by memory-based collaborative filtering algorithm before prediction process in the recommender system. Our analysis results show the possibility of a pre-evaluation before the prediction process of users' preference of item's transaction on the web. Classification functions proposed in this study generate a user's rating pattern under certain conditions. In this research, we test whether classification functions select users who have lower prediction or higher prediction performance under collaborative filtering recommendation approach. The statistical test results will be based on the differences of the prediction accuracy of each user group which are classified by classification functions using the generative probability of specific rating. The characteristics of rating patterns of classified users will also be presented.