• Journal of Korea Multimedia Society
• /
• v.19 no.11
• /
• pp.1878-1890
• /
• 2016

Web 2.0 has features produced the content through the user of the participation and share. The content production activities have became active since social network service appear. The social bookmark, one of social network service, is service that lets users to store useful content and share bookmarked contents between personal users. Unlike Internet search engines such as Google and Naver, the content stored on social bookmark is searched based on tag keyword information and unnecessary information can be excluded. Social bookmark can make users access to selected content. However, quick access to content that users want is difficult job because of the user of the participation and share. Our paper suggests a method recommending search word to be able to access quickly to content. A method is suggested by using Collaborative Filtering and Jaccard similarity coefficient. The performance of suggested system is verified with experiments that compare by 'Delicious' and "Feeltering' with our system.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.107-116
• /
• 2013

In this paper, we propose a hybrid music recommendation system combining users' listening habits and tag information in a social music site. Most of commercial music recommendation systems recommend music items based on the number of plays and explicit ratings of a song. However, the approach has some difficulties in recommending new items with only a few ratings or recommending items to new users with little information. To resolve the problem, we use tag information which is generated by collaborative tagging. According to the meaning of tags, a weighted value is assigned as the score of a tag of an music item. By combining the score of tags and the number of plays, user profiles are created and collaborative filtering algorithm is executed. For performance evaluation, precision, recall, and F-measure are calculated using the listening habit-based recommendation, the tag score-based recommendation, and the hybrid recommendation, respectively. Our experiments show that the hybrid recommendation system outperforms the other two approaches.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.9
• /
• pp.1293-1304
• /
• 2022

The personalization recommendation system means analyzing each individual's interests or preferences and recommending information or products accordingly. These personalized recommendations can reduce the time consumers spend searching for information by accessing the products they need more quickly, and companies can increase corporate profits by recommending appropriate products that meet their needs. In this study, products are recommended to consumers using collaborative filtering, matrix factorization, and deep learning, which are representative personalization recommendation techniques. To this end, the data set after purchasing shopping mall products, which is raw data, is pre-processed in the form of transmitting the data set to the input of the recommended system, and the pre-processed data set is analyzed from various angles. In addition, each model performs verification and performance comparison on the recommended results, and explores the model with optimal performance, suggesting which model should be used when building the recommendation system at the mall.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.2
• /
• pp.224-229
• /
• 2011

Collaborative filtering is used the most for recommendation systems because it can recommend potential items. However, when there are not many items to be evaluated, collaborative filtering can be subject to the influence of similarity or preference depending on the situation or the whim of the evaluator. In addition, by recommending items only on the basis of similarity with items that have been evaluated previously without relation to the present situation of the user, the recommendations become less accurate. In this paper, in order to solve the above problems, before starting the collaborative filtering procedure, we calculated similarity not by comparing all the values evaluated by users but rather by comparing only those users who were above the average in order to improve the accuracy of the recommendations. In addition, in the ceaselessly changing ubiquitous computing environment, it is not proper to recommend service information based only on the items evaluated by users. Therefore, we used methods of calculating similarity wherein the users' real time context information was used and a high weight was assigned to similar users. Such methods improved the recommendation accuracy by 16.2% on average.

• 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 KIISE
• /
• v.44 no.9
• /
• pp.908-917
• /
• 2017

As web service technologies are widely used, there have been many efforts to develop approaches for recommending appropriate web services to users in complex and dynamic service environments. In addition, for the effective development of service mashups, service recommender systems that are specialized for service composition have been developed. However, existing service recommender systems for service mashups are not effective at recommending services in a personalized manner that reflect developers' preferences. To deal with this issue, we propose an approach that recommends services based on the similarities between mashup developers who have developed similar service mashups. The proposed approach is then evaluated by using the mashup data retrieved from ProgrammableWeb. The evaluation results clearly show that the proposed approach is an effective way of improving service recommendations compared to the traditional user-based collaborative filtering algorithm.

• Journal of Information Technology Applications and Management
• /
• v.21 no.1
• /
• pp.85-105
• /
• 2014

Exhibition industry is important business domains to many countries. Not only lots of countries designated the exhibition industry as tools to stimulate national economics, but also many companies offer millions of service or products to customers. Recommender systems can help visitors navigate through large information spaces of various booths. However, no study before has proposed a methodology for identifying and acquiring prospective visitors although it is important to acquire them. Accordingly, we propose a methodology for identifying, acquiring prospective visitors, and recommending the adequate booth information to their preferences in the exhibition industry. We assume that a visitor will be interested in an exhibition within same class of exhibition taxonomy as exhibition which the visitor already saw. Moreover, we use user-based collaborative filtering in order to recommend personalized booths before exhibition. A prototype recommender system is implemented to evaluate the proposed methodology. Our experiments show that the proposed methodology is better than the item-based CF and have an effect on the choice of exhibition or exhibit booth through automation of word-of-mouth communication.

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

• Journal of Information Management
• /
• v.33 no.1
• /
• pp.1-17
• /
• 2002

This study examined several recommendation techniques to construct an effective book recommender system in a library. Experiments revealed that a hybrid recommendation technique is more effective than either collaborative filtering or content-based filtering technique in recommending books to be borrowed in an academic library setting. The recommendation technique based on association rule turned out the lowest in performance.

• Journal of Internet Computing and Services
• /
• v.8 no.6
• /
• pp.95-102
• /
• 2007

Recommender System based on the Collaborative Filtering has a problem of trust of the prediction accuracy because of its problem of sparsity. If the sparsity of a preference value is large, it causes a problem on a process of a choice of neighbors and also lowers the prediction accuracy. In this article, a change of MAE based on the sparsity is studied, groups are classified by sparsity and then, the significant difference among MAEs of classified groups is analyzed. To improve the accuracy of prediction among groups by the problem of sparsity, We studied the improvement of an accurate prediction for recommending system through reducing sparsity by sorting sparsity items, and replacing the average preference among them that has a lot of respondents with the preference evaluation value.