• Journal of the Korea Society of Computer and Information
• /
• v.25 no.9
• /
• pp.101-108
• /
• 2020

Recommender system is a must-have feature of e-commerce, since it provides customers with convenience in selecting products. Collaborative filtering is a widely-used and representative technique, where it gives recommendation lists of products preferred by other users or preferred by the current user in the past. Recently, researches on the recommendation system using deep learning artificial intelligence technologies are actively being conducted to achieve performance improvement. This study develops a collaborative filtering based recommender system using restricted Boltzmann machines of the deep learning technology by utilizing user ratings. Moreover, a learning parameter update algorithm is proposed for learning efficiency and performance. Performance evaluation of the proposed system is made through experimental analysis and comparison with conventional collaborative filtering methods. It is found that the proposed algorithm yields superior performance than the basic restricted Boltzmann machines.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1380-1385
• /
• 2015

Collaborative filtering is one of the most successfully used methods for recommender systems and has been utilized in various areas such as books and music. The key point of this method is selecting the most proper recommenders, for which various similarity measures have been studied. To improve recommendation performance, this study analyzes problems of existing recommender selection methods based on similarity and presents a method of dynamically determining recommenders based on the rate of co-rated items as well as similarity. Examination of performance with varying thresholds through experiments revealed that the proposed method yielded greatly improved results in both prediction and recommendation qualities, and that in particular, this method showed performance improvements with only a few recommenders satisfying the given thresholds.

• Journal of the Korean Society for Library and Information Science
• /
• v.53 no.4
• /
• pp.361-372
• /
• 2019

The Overseas Construction Engineering Information System (OVICE), which is operated by the Korea Institute of Construction Technology, uses the Overseas Construction Information Service classification system to service information required for overseas construction of domestic construction engineering companies. In this study, through the application of the recommendation system using collaborative filtering, identifying the relationship between the subjects for real users, verifying the adequacy of the overseas construction information classification system currently in service. Through this, I would like to propose an information service classification system that reflects actual user demand.

• The Journal of the Korea Contents Association
• /
• v.11 no.11
• /
• pp.1-9
• /
• 2011

With the development of next IT convergence technology and the construction of infrastructure for personalized healthcare services, the importance of services based on user's preference is being spotlighted. Healthcare service have been progressed as treatment and management for specific diseases and dietary nutrition managements to customers according to the increase in chronic patients. In this paper, we proposed the personalized dietary nutrition contents recommendation using the hybrid filtering for managing health. The proposed method uses the hybrid filtering through combining the collaborative filtering and the image filtering in order to reinforce the special trend that recommendation provides similar contents. We developed the Web application for this purpose, and experimented with it to verify the logical validity and effectiveness. Accordingly, the satisfaction and the quality of services will be improved the healthcare by recommending the dietary nutrition contents. This evaluation found that the difference of satisfaction by service was statistically meaningful and showed high satisfaction.

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

While recommender systems were used by a few E-commerce sites former days, they are now becoming serious business tools that are re-shaping the world of I-commerce. And collaborative filtering has been a very successful recommendation technique in both research and practice. But there are two problems in personalized recommender systems, it is First-Rating problem and Sparsity problem. In this paper, we solve these problems using the associative relation clustering and “Lift” of association rules. We produce “Lift” between items using user's rating data. And we apply Threshold by -cut to the association between items. To make an efficiency of associative relation cluster higher, we use not only the existing Hypergraph Clique Clustering algorithm but also the suggested Split Cluster method. If the cluster is completed, we calculate a similarity iten in each inner cluster. And the index is saved in the database for the fast access. We apply the creating index to predict the preference for new items. To estimate the Performance, 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.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.2
• /
• pp.189-194
• /
• 2010

In the recommendation system that recommends services to a specific user by using the estimation value of other users for users' recommendation service, collaborative filtering methods are widely used. But such recommendation systems have problems that exact classification is not possible because a specific user is classified to already classified group in the course of clustering and inexact result can be recommended in case of big errors in users' estimation values. In this paper, in order to increase estimation accuracy, the researchers suggest a recommendation system that applies collaborative filtering after reclassifying on the basis of a specific user's classification items and then finding and correcting the estimation values of the users beyond the critical value of time. This system uses a method where a specific user is not classified to already classified group in the course of clustering but a group is reorganized on the basis of the specific user. In addition, the researchers correct estimation information by cutting off the subordinate 10% from the trimmed mean of samples and then applies weight over time to the remaining data. As the result of an experiment, the suggested method demonstrated about 14.9%'s more accurate estimation result in case of using MAE than general collaborative filtering method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.4 s.310
• /
• pp.50-57
• /
• 2006

In Electronic Commerce, the latest most of the personalized recommender systems have applied to the collaborative filtering technique. This method calculates the weight of similarity among users who have a similar preference degree in order to predict and recommend the item which hits to propensity of users. In this case, we commonly use Pearson Correlation Coefficient. However, this method is feasible to calculate a correlation if only there are the items that two users evaluated a preference degree in common. Accordingly, the accuracy of prediction falls. The weight of similarity can affect not only the case which predicts the item which hits to propensity of users, but also the performance of the personalized recommender system. In this study, we verify the improvement of the prediction accuracy through an experiment after observing the rule of the weight of similarity applying Vector similarity, Entropy, Inverse user frequency, and Default voting of Information Retrieval field. The result shows that the method combining the weight of similarity using the Entropy with Default voting got the most efficient 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 Korean Institute of Intelligent Systems
• /
• v.17 no.4
• /
• pp.488-493
• /
• 2007

In general, recommendation systems quantify real-time context information obtained in the stage of collaborative filtering and use quantified context information in order to recommend services. But the recommendation systems can have problems of recommending inaccurate information because of lack of context information or classifying users into inaccurate groups because of simple classification works in the stage of quantification. In this paper, we solved the problems of lack of context information obtained in real-time by combining users' profile information used in the contents-based filtering and context information obtained in real-time. In addition, we tried collaborative filtering at the quantification stage by improving absolute classification methods to relative ones. As the result of experiments, this method improved prediction preference by 5.8% than real-time recommendation systems using context information in pure P2P environment.

• The Journal of the Korea Contents Association
• /
• v.7 no.10
• /
• pp.19-26
• /
• 2007

Since collaborative filtering has used the nearest-neighborhood method based on item preference it cannot only reflect exact contents but also has the problem of sparsity and scalability. The item-based collaborative filtering has been practically used improve these problems. However it still does not reflect attributes of the item. In this paper, we propose the method of associative group using the FP-Tree to solve the problem of existing recommendation system. The proposed makes frequent item and creates association rule by using FP-Tree without occurrence of candidate set. We made the efficient item group using $\alpha-cut$ according to the confidence of the association rule. To estimate the performance, the suggested method is compared with Gibbs Sampling, Expectation Maximization, and K-means in the MovieLens dataset.