• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.7
• /
• pp.1083-1091
• /
• 2017

As big data technologies have been developed and massive data have exploded from users through various channels, CEO of global IT enterprise mentioned core importance of data in next generation business. Therefore various machine learning technologies have been necessary to apply data driven services but especially recommendation has been core technique in viewpoint of directly providing summarized information or exact choice of items to users in information flooding environment. Recently evolved recommendation techniques have been proposed by many researchers and most of service companies with big data tried to apply refined recommendation method on their online business. For example, Amazon used item to item collaborative filtering method on its sales distribution platform. In this paper, we develop a commercial web service for suggesting music contents and implement three representative collaborative filtering methods on the service. We also produce recommendation lists with three methods based on real world sample data and evaluate the usefulness of them by comparison among the produced result. This study is meaningful in terms of suggesting the right direction and practicality when companies and developers want to develop web services by applying big data based recommendation techniques in practical environment.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5S
• /
• pp.1599-1608
• /
• 2000

Automated collaborative filtering is on the verge of becoming a popular technique to reduce overloaded information as well as to solve the problems that content-based information filtering systems cannot handle. In this paper, we describe three different algorithms that perform collaborative filtering: GroupLens that is th traditional technique; Best N, the modified one; and an algorithm that uses clustering. Based on the exeprimental results using real data, the algorithm using clustering is compared with the existing representative collaborative filtering agent algorithms such as GroupLens and Best N. The experimental results indicate that the algorithms using clustering is similar to Best N and better than GroupLens for prediction accuracy. The results also demonstrate that the algorithm using clustering produces the best performance according to the standard deviation of error rate. This means that the algorithm using clustering gives the most stable and the best uniform recommendation. In addition, the algorithm using clustering reduces the time of recommendation.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.33-46
• /
• 2011

Since an e-mail has been an important mean of communication and information sharing, there have been much effort to classify e-mails efficiently by their contents. An e-mail has various forms in length and style, and words used in an e-mail are usually irregular. In addition, the criteria of an e-mail classification are subjective. As a result, it is quite difficult for the conventional text classification technique to be adapted to an e-mail classification efficiently. An e-mail classification technique in a commercial e-mail program uses a simple text filtering technique in an e-mail client. In the previous studies on automatic classification of an e-mail, the Naive Bayesian technique based on the probability has been used to improve the classification accuracy, and most of them are on an e-mail in English. This paper proposes the personalized recommendation technique of an email in Korean using a data mining technique of frequent patterns. The proposed technique consists of two phases such as the pre-processing of e-mails in an e-mail folder and the generating a profile for the e-mail folder. The generated profile is used for an e-mail to be classified into the most appropriate e-mail folder by the subjective criteria. The e-mail classification system is also implemented, which adapts the proposed technique.

• Journal of Digital Contents Society
• /
• v.14 no.4
• /
• pp.419-428
• /
• 2013

Real-time accessibility and agility are required in u-commerce under ubiquitous computing environment. Most of the existing recommendation techniques adopt the method of evaluation based on personal profile, which has been identified with difficulties in accurately analyzing the customers' level of interest and tendencies, as well as the problems of cost, consequently leaving customers unsatisfied. Researches have been conducted to improve the accuracy of information such as the level of interest and tendencies of the customers. However, the problem lies not in the preconstructed database, but in generating new and diverse profiles that are used for the evaluation of the existing data. Also it is difficult to use the unique recommendation method with hierarchy of each customer who has various characteristics in the existing recommendation techniques. Accordingly, this dissertation used the implicit method without onerous question and answer to the users based on the data from purchasing, unlike the other evaluation techniques. We applied FRAT technique which can analyze the tendency of the various personalization and the exact customer.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.433-438
• /
• 2003

Recently, some studies of a web-based information recommendation technique which provides users with the most necessary information through websites like a web-based shopping mall have been conducted vigorously. In most cases of web information recommendation techniques which rely on a user profile and a specific feedback from users, they require accurate and diverse profile information of users. However, in reality, it is quite difficult to acquire this related information. This paper is aimed to suggest an information prediction technique for a web information service without depending on the users'specific feedback and profile. To achieve this goal, this study is to design and implement a Dynamic Web Information Prediction System which can recommend the most useful and necessary information to users from a large volume of web data by designing and embodying Ensemble Support Vector Machine and hybrid SOM algorithm and eliminating the scarcity problem of web log data.

• The Journal of the Korea Contents Association
• /
• v.10 no.7
• /
• pp.23-30
• /
• 2010

It is important for the strategy of cosmetic sales to investigate the sensibility and the preference degree in the environment that the makeup style has been changed focusing on the consumer center. We proposed the human sensibility ergonomics makeup recommendation system (MakeupRS) using the context sensor information applying the collaborative filtering technique as one of methods in the makeup style development centered on the consumer's sensibility and the preference. In the collaborative filtering technique, the Pearson correlation coefficient applying to the case amplification is used to calculate similarity weights between the users. To investigate the sensibility according to the effect of makeup styles, the makeup styles were analyzed in terms of 6 style factors, such as, the foundation, the color lens, the eye shadow, the eye lash, the cheek brusher, and the lipstick. Ultimately, this paper suggests empirical application to verify the adequacy and the validity with the human sensibility ergonomics makeup recommendation system.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.7
• /
• pp.93-100
• /
• 2022

In the era of information overload on the Internet, the recommendation system, which is an indispensable function, is a service that recommends products that a user may prefer, and has been successfully provided in various commercial sites. Recently, studies to reflect the rating time of items to improve the performance of collaborative filtering, a representative recommendation technique, are active. The core idea of these studies is to generate the recommendation list by giving an exponentially lower weight to the items rated in the past. However, this has a disadvantage in that a time function is uniformly applied to all items without considering changes in users' preferences according to the characteristics of the items. In this study, we propose a time-aware collaborative filtering technique from a completely different point of view by developing a new similarity measure that integrates the change in similarity values between items over time into a weighted sum. As a result of the experiment, the prediction performance and recommendation performance of the proposed method were significantly superior to the existing representative time aware methods and traditional methods.

• Management Science and Financial Engineering
• /
• v.12 no.2
• /
• pp.71-85
• /
• 2006

Collaborative filtering, among other recommender systems, has been known as the most successful recommendation technique. However, it requires the user-item rating data, which may not be easily available. As an alternative, some collaborative filtering algorithms have been developed recently by utilizing the market basket data in the form of the binary user-item matrix. Viewing the recommendation scheme as a two-class classification problem, we proposed a new collaborative filtering scheme using a regularized discriminant analysis applied to the binary user-item data. The proposed discriminant model was built in terms of the major principal components and was used for predicting the probability of purchasing a particular item by an active user. The proposed scheme was illustrated with two modified real data sets and its performance was compared with the existing user-based approach in terms of the recommendation precision.

• Proceedings of the CALSEC Conference
• /
• 2004.02a
• /
• pp.239-250
• /
• 2004

The preference of customers change as time goes by. The existing Collaborative Filtering (CF) techniques has no room for including this change yet, although these techniques have been known to be the most successful recommendation technique that has been used in a number of different applications. In this study, we proposed a new methodology for enhancing the quality of recommendation using the customers' dynamic behaviors over time. The proposed methodology is applied to a large department store in Korea, compared to existing CF techniques. Some experiments on the real world data show that the proposed methodology provides higher quality recommendations than other CF techniques, especially better performance on heavy users.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.07a
• /
• pp.135-137
• /
• 2012

A existing recommedation system using association rules has the problem, which is suffered from inefficiency by reprocessing of the data which have already been processed in the incremental data environment in which new data are added persistently. We propose the recommendation technique using incremental frequent pattern mining based on RFM in e-commerce. The proposed can extract frequent items and create association rules using frequent patterns mining rapidly when new data are added persistently.