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

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.122-125
• /
• 2010

사용자와 취향이 비슷한 사용자를 찾고, 이 유사 사용자가 선호한 아이템을 추천하는 협력적 필터링방식은 일반적으로 많이 사용되는 추천 방식이다. 하지만 협력적 필터링 방식은 어떤 상황적 요소도 고려하지 않아 모든 상황에서 동일한 추천 결과를 제시하게 된다. 반면, 상황을 고려한 추천 방식은 다른 상황에서 그 상황에 적합하다고 판단되는 추천 리스트를 보여주는 다양성을 가지지만 개인의 선호를 반영하지 못하는 한계를 가진다. 이에 협력적 필터링 방식과 상황에 따른 추천 방식을 함께 고려하려는 시도가 있다. 본 논문에서는 시간 상황에 따른 음악 추천 시, 전체 상황에서 가장 유사한 사용자를 찾고 이 유사 사용자의 현재 상황에서의 선호 아이템을 추천하는 모델을 제시하고 실험을 통하여 이 모델의 한계와 실용 가능한 상황을 제시한다.

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

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

• The Journal of Korean Association of Computer Education
• /
• v.19 no.4
• /
• pp.59-66
• /
• 2016

It has been studied to reflect the number of co-rated items for solving data sparsity problem in collaborative filtering systems. A well-known method of Jaccard index allowed performance improvement, when combined with previous similarity measures. However, the degree of performance improvement when combined with existing similarity measures in various data environments are seldom analyzed, which is the objective of this study. Jaccard index as a sole similarity measure yielded much higher prediction quality than traditional measures and very high recommendation quality in a sparse dataset. In general, previous similarity measures combined with Jaccard index improved performance regardless of dataset characteristics. Especially, cosine similarity achieved the highest improvement in sparse datasets, while similarity of Mean Squared Difference degraded prediction quality in denser sets. Therefore, one needs to consider characteristics of data environment and similarity measures before combining Jaccard index for similarity use.

• Journal of The Korean Association of Information Education
• /
• v.17 no.4
• /
• pp.375-382
• /
• 2013

Collaborative filtering has been most widely used in commercial sites to recommend items based on the history of user preferences for items. The basic idea behind this method is to find similar users whose ratings for items are incorporated to make recommendations for new items. Hence, similarity calculation is most critical in recommendation performance. This paper presents a new similarity measure that takes each rating of a user relatively to his own ratings. Extensive experiments revealed that the proposed measure is more reliable than the classic measures in that it significantly decreases generation of extreme similarity values and its performance improves when consulting neighbors with high similarites only. In particular, the results show that the proposed measure is superior to the classic ones for datasets with large rating scales.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.316-325
• /
• 2003

A user preference prediction method using an exiting collaborative filtering technique has used the nearest-neighborhood method based on the user preference about items and has sought the user's similarity from the Pearson correlation coefficient. Therefore, it does not reflect any contents about items and also solve the problem of the sparsity. This study suggests the preference prediction system using the similarity weight granted Bayesian estimated value and the associative user clustering to complement problems of an exiting collaborative preference prediction method. This method suggested in this paper groups the user according to the Genre by using Association Rule Hypergraph Partitioning Algorithm and the new user is classified into one of these Genres by Naive Bayes classifier to slove the problem of sparsity in the collaborative filtering system. Besides, for get the similarity between users belonged to the classified genre and new users, this study allows the different estimated value to item which user vote through Naive Bayes learning. If the preference with estimated value is applied to the exiting Pearson correlation coefficient, it is able to promote the precision of the prediction by reducing the error of the prediction because of missing value. To estimate the performance of suggested method, 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.