• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.4
• /
• pp.61-75
• /
• 2007

In ubiquitous computing, shared environments are required to adapt to people intelligently. Based on information about user preferences, the shared environments should be adjusted so that all users in a group are satisfied as possible. Although many group recommender systems have been proposed to obtain this purpose, they only consider average and misery. However, a broad range of philosophical approaches suggest that high inequality reduces social agreeability, and consequently causes users' dissatisfactions. In this paper, we propose social welfare functions, which consider inequalities in users' preferences, as alternative aggregation functions to achieve a social agreeability. Using an example in a previous work[7], we demonstrate the effectiveness of proposed welfare functions as socially agreeable aggregate functions in group recommender systems.

• Journal of Intelligence and Information Systems
• /
• v.11 no.1
• /
• pp.191-205
• /
• 2005

This paper presents a novel product recommender system as a tool fur differentiated marketing service of online shopping malls. Ihe proposed model uses genetic algorithnt one of popular global optimization techniques, to construct a personalized product recommender systen The genetic algorinun may be useful to recommendation engine in product recommender system because it produces optimal or near-optimal recommendation rules using the customer profile and transaction data. In this study, we develop a prototype of WeLbased personalized product recommender system using the recommendation rules fi:om the genetic algorithnL In addition, this study evaluates usefulness of the proposed model through the test fur user satisfaction in real world.

• Journal of Broadcast Engineering
• /
• v.16 no.2
• /
• pp.237-246
• /
• 2011

In order to produce the variety of UCC, the recommendation service is required which considers the copyright of UCC producer discriminated from one for UCC consumers and the purpose of its production. The recommender system designed in this thesis enables UCC which is much similar to one UCC producer utilizes to be used with custom-made when recommending and producing based on UCC view history and production list, etc. of its producer. The recommender system is largely divided into filtering based on the preferred tag, UCC filtering used when producing the preferred UCC and creating process of recommended UCC using the Pearson formula. The recommender system in this thesis requires the data which were used when producing UCC. For that, we added the reference factor so that the data of UCC which were utilized when producing UCC into the existing metadata can be recorded. If the recommender system suggested in this thesis is used, the more effective and convenient UCC recommendation services with custom-made for producers can be provided.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.5
• /
• pp.431-436
• /
• 2015

As a number of TV programs broadcast today, researches about TV program recommender system have been studied and many researchers have been studying recommender system to produce recommendation with high accuracy. Recommender system recommends TV program to user by using metadata like genre, plot or calculating users' preferences about TV programs. In this paper, we propose a new TV program Collaborative Filtering Recommender System that exploits viewing time pattern like viewing ratio, relation with finish time and recently viewing history to calculate preference for high-quality of recommendation. To verify usefulness of our research, we also compare our method which utilizes viewing time patterns and baseline which simply recommends TV program of user's most frequently watched channel. Through this experiments, we show that our method very effectively works and recommendation performance increases.

• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.129-139
• /
• 2012

This paper introduces a recommender system that is to recommend broadcast content. Our recommender system uses user's viewing history for personalized recommendations. Broadcast contents has unique characteristics as compared with books, musics and movies. There are two types of broadcast content, a series program and an episode program. The series program is comprised of several programs that deal with the same topic or story. Meanwhile, the episode program covers a variety of topics. Each program of those has different topic in general. Therefore, our recommender system recommends TV programs to users according to the type of broadcast content. The recommendations in this system are based on user's viewing history that is used to calculate content similarity between contents. Content similarity is calculated by exploiting collaborative filtering algorithm. Our recommender system uses java sparse array structure and performs memory-based processing. And then the results of processing are stored as an index structure. Our recommender system provides recommendation items through OPEN APIs that utilize the HTTP Protocol. Finally, this paper introduces the implementation of our recommender system and our web demo.

• Archives of design research
• /
• v.16 no.2
• /
• pp.23-34
• /
• 2003

The need for personalized web site design has been increased these days. Current approach for personalized web site design is easily applied to web site with their cost-effective feature, but is hard to provide a more refined personalized service due to its lack of accumulation of user data. In this study, the design recommender system is investigated as a more advanced method for web site design personalization. We provide an overview of current recommender systems, and then outlined a newly developed design recommender system, which employs collaborative filtering technique to provide tailored recommendation for users.

• Journal of Information Technology Applications and Management
• /
• v.12 no.3
• /
• pp.41-56
• /
• 2005

Product recommender system is one of the most popular techniques for customer relationship management. In addition, collaborative filtering (CF) has been known to be one of the most successful recommendation techniques in product recommender systems. However, CF has some limitations such as sparsity and scalability problems. This study proposes hybrid cluster analysis and case-based reasoning (CBR) to address these problems. CBR may relieve the sparsity problem because it recommends products using customer profile and transaction data, but it may still give rise to scalability problem. Thus, this study uses cluster analysis to reduce search space prior to CBR for scalability Problem. For cluster analysis, this study employs hybrid genetic and K-Means algorithms to avoid possibility of convergence in local minima of typical cluster analyses. This study also develops a Web-based prototype system to test the superiority of the proposed model.

• The Journal of Society for e-Business Studies
• /
• v.13 no.4
• /
• pp.173-191
• /
• 2008

As volumes of electronic commerce increase rapidly, customers are faced with information overload, and it becomes difficult for them to find necessary information and select what they need. In this situation, recommender systems can help the customers search and select the products and services they need more conveniently. These days, the recommender systems play important roles in customer relationship management. In this research, we develop a recommender system that recommends the books to the customers of Internet bookstore. In previous researches on recommender systems, collaborative filtering technique has been often employed. For the collaborative filtering technique to be used, the rating scores on books given by previous purchasers have to be collected. However, the collection of rating scores is not an easy task in reality. Therefore, in this research, we employed case-based reasoning technique that can work only with the book purchase history of customers. The accuracy of recommendation of the resulting book recommender system was about 40% on the level 3 classification code.

• The Journal of the Korea Contents Association
• /
• v.10 no.11
• /
• pp.10-19
• /
• 2010

The progress of computers and Web has given rise to a rapid increase of the quantity of the useful information, which is making the demand of recommender systems widely expanding. Like in other domains, a recommender system in a digital library is important, but there are only a few studies about the recommender system of research papers, Moreover none is there in korea to our knowledge. In the paper, we seek for a way to develop the NDSL recommender system of research papers based on the survey of related studies. We conclude that NDSL needs to modify the way to collect user's interests from explicit to implicit method, and to use user-based and memory-based collaborative filtering mixed with contents-based filtering(CF). We also suggest the method to mix two filterings and the use of personal ontology to improve user satisfaction.

• Journal of Computing Science and Engineering
• /
• v.7 no.1
• /
• pp.21-29
• /
• 2013

The introduction of recommender systems to existing online services is now practically inevitable, with the increasing number of items and users on online services. Popular recommender systems have successfully implemented satisfactory systems, which are usually based on collaborative filtering. However, collaborative filtering-based recommenders suffer from well-known problems, such as popularity bias, and the cold-start problem. In this paper, we propose an innovative collaborative-filtering based recommender system, which uses the concepts of Experts and Novices to create fine-grained recommendations that focus on being novel, while being kept relevant. Experts and Novices are defined using pre-made clusters of similar items, and the distribution of users' ratings among these clusters. Thus, in order to generate recommendations, the experts are found dynamically depending on the seed items of the novice. The proposed recommender system was built using the MovieLens 1 M dataset, and evaluated with novelty metrics. Results show that the proposed system outperforms matrix factorization methods according to discovery-based novelty metrics, and can be a solution to popularity bias and the cold-start problem, while still retaining collaborative filtering.