• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.901-904
• /
• 2015

본 논문에서는 사진의 태그정보 및 통계정보, 사용자 평점을 이용하여 여행에 앞서 본인의 취향 등에 맞는 개인화 된 여행계획을 생성할 수 있도록 지원하는 연구를 진행하였다. 개인화 된 여행계획의 자동생성을 위하여, 나이, 성별, 직업, 소득, 학력에 따라 선호하는 여행의 태마를 통계자료를 통해 구분하였고, 사진의 태그정보를 이용하여 사용자가 가장 선호하는 테마를 분별하여 개인화 할 수 있도록 하였다. 이렇게 구분된 태마는 다양한 포털사이트에 등록된 사용자 평점 정보를 토대로 하여 여행계획을 생성하여 사용자에게 제공할 수 있도록 하였다.

• Journal of the Korea Convergence Society
• /
• v.8 no.9
• /
• pp.285-292
• /
• 2017

This paper describes a recursive least-squares based convergent algorithm for driving characteristic classification for personalized autonomous driving. Recently, various researches on autonomous driving technology have been conducted for level 4 fully autonomous driving. In order for commercialization of the autonomous vehicle, personalized autonomous driving is required to minimize passenger's insecureness to the autonomous vehicle. To address this problem. this study proposes mathematical model that represents driving characteristics and recursive least-squares based algorithm that can estimate the defined characteristics. The actual data of two drivers has been used to derive driving characteristics and the hypothesis testing method has been used to classify two drivers. It is shown that the proposed algorithms can derive driving characteristics and classify two drivers reasonably.

• Journal of Intelligence and Information Systems
• /
• v.22 no.4
• /
• pp.1-18
• /
• 2016

Collaborative Filtering (CF) predicts the focal user's preference for particular item based on user's preference rating data and recommends items for the similar users by using them. It is a popular technique for the personalization in e-commerce to reduce information overload. However, it has some limitations including sparsity and scalability problems. In this paper, we use a method to integrate social network information into collaborative filtering in order to mitigate the sparsity and scalability problems which are major limitations of typical collaborative filtering and reflect the user's qualitative and emotional information in recommendation process. In this paper, we use a novel recommendation algorithm which is integrated with collaborative filtering by using Social SVD++ algorithm which considers social network information in SVD++, an extension algorithm that can reflect implicit information in singular value decomposition (SVD). In particular, this study will evaluate the performance of the model by reflecting the real-world user's social network information in the recommendation process.

• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.95-108
• /
• 2011

TThis is a study of the personalization method that intelligently adapts the level of clustering considering purchasing index of a customer. In the e-biz era, many companies gather customers' demographic and transactional information such as age, gender, purchasing date and product category. They use this information to predict customer's preferences or purchasing patterns so that they can provide more customized services to their customers. The previous Customer-Segmentation method provides customized services for each customer group. This method clusters a whole customer set into different groups based on their similarity and builds predictive models for the resulting groups. Thus, it can manage the number of predictive models and also provide more data for the customers who do not have enough data to build a good predictive model by using the data of other similar customers. However, this method often fails to provide highly personalized services to each customer, which is especially important to VIP customers. Furthermore, it clusters the customers who already have a considerable amount of data as well as the customers who only have small amount of data, which causes to increase computational cost unnecessarily without significant performance improvement. The other conventional method called 1-to-1 method provides more customized services than the Customer-Segmentation method for each individual customer since the predictive model are built using only the data for the individual customer. This method not only provides highly personalized services but also builds a relatively simple and less costly model that satisfies with each customer. However, the 1-to-1 method has a limitation that it does not produce a good predictive model when a customer has only a few numbers of data. In other words, if a customer has insufficient number of transactional data then the performance rate of this method deteriorate. In order to overcome the limitations of these two conventional methods, we suggested the new method called Intelligent Customer Segmentation method that provides adaptive personalized services according to the customer's purchasing index. The suggested method clusters customers according to their purchasing index, so that the prediction for the less purchasing customers are based on the data in more intensively clustered groups, and for the VIP customers, who already have a considerable amount of data, clustered to a much lesser extent or not clustered at all. The main idea of this method is that applying clustering technique when the number of transactional data of the target customer is less than the predefined criterion data size. In order to find this criterion number, we suggest the algorithm called sliding window correlation analysis in this study. The algorithm purposes to find the transactional data size that the performance of the 1-to-1 method is radically decreased due to the data sparity. After finding this criterion data size, we apply the conventional 1-to-1 method for the customers who have more data than the criterion and apply clustering technique who have less than this amount until they can use at least the predefined criterion amount of data for model building processes. We apply the two conventional methods and the newly suggested method to Neilsen's beverage purchasing data to predict the purchasing amounts of the customers and the purchasing categories. We use two data mining techniques (Support Vector Machine and Linear Regression) and two types of performance measures (MAE and RMSE) in order to predict two dependent variables as aforementioned. The results show that the suggested Intelligent Customer Segmentation method can outperform the conventional 1-to-1 method in many cases and produces the same level of performances compare with the Customer-Segmentation method spending much less computational cost.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.1
• /
• pp.11-21
• /
• 2008

In advance of Knowledge Information Society, mentoring is becoming an efficient method for developing and managing human resources. There are several factors to improve the effect of mentoring. Among them, a matching mechanism that connects a mentee and a mentor is the most important in mentoring. In the existing e-mentoring systems, administrators rarely consider personal data. They match suitable mentors for mentees in a mandatory way, which reflects bad effects in the e-mentoring. In this paper, we propose new recommendation algorithms for matching by analyzing personal preferences for secondary school students to improve the effects of the mentoring. In addition, we compare our algorithms with the existing algorithms in terms of elaborateness, accordance, and diversity in order to prove the effectiveness of the proposed algorithms.

• Asia pacific journal of information systems
• /
• v.16 no.4
• /
• pp.239-254
• /
• 2006

Location-based advertising or application has been one of the drivers of third-generation mobile operators' marketing efforts in the past few years. As a result, many studies on location-based marketing or advertising have been proposed for recent several years. However, these approaches have two common shortcomings. First. most of them just suggested the theoretical architectures, which were too abstract to apply it to the real-world cases. Second, many of these approaches only consider service provider (seller) rather than customers (buyers). Thus, the prior approaches fit to the automated sales or advertising rather than the implementation of CRM. To mitigate these limitations, this study presents a novel advertisement recommendation model for mobile users. We call our model MAR-CF (Mobile Advertisement Recommender using Collaborative Filtering). Our proposed model is based on traditional CF algorithm, but we adopt the multi-dimensional personalization model to conventional CF for enabling location-based advertising for mobile users. Thus, MAR-CF is designed to make recommendation results for mobile users by considering location, time, and needs type. To validate the usefulness of our recommendation model. we collect the real-world data for mobile advertisements, and perform an empirical validation. Experimental results show that MAR-CF generates more accurate prediction results than other comparative models.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.47 no.6
• /
• pp.1137-1156
• /
• 2023

With the advent of artificial intelligence (AI) during the Fourth Industrial Revolution, the fashion industry has simplified the production process and overcome the technical difficulties of design. This study anticipates likely changes in the digital age and develops a model that will allow consumers to design textile patterns using AI technology. Previous studies and industrial examples of AI technology's use in the textile design industry were investigated, and a textile pattern was developed using an AI algorithm. A new textile design model was then proposed based on its application to both virtual and physical clothing. Inspired by traditional Korean masks and props, AI technology was used to input color data from open application programming interface images. By inserting these into various repeating structures, a textile design was developed and simulated as garments for both virtual and real garments. We expect that this study will establish a new textile design development method for Generation Z, who favor customized designs. This study can inform the use of personalization in generative textile design as well as the systemization of technology-driven methods for customized and participatory textile design.

• Journal of the Korean Society for information Management
• /
• v.24 no.2
• /
• pp.89-104
• /
• 2007

This research attempts to give a personalized recommendation framework in large-sized music contents environment. Despite of existing studios and commercial contents for recommendation systems, large online shopping malls are still looking for a recommendation system that can serve personalized recommendation and handle large data in real-time. This research utilizes data mining technologies and new pattern matching algorithm. A clustering technique is used to get dynamic user segmentations using user preference to contents categories. Then a sequential pattern mining technique is used to extract contents access patterns in the user segmentations. And the recommendation is given by our recommendation algorithm using user contents preference history and contents access patterns of the segment. In the framework, preprocessing and data transformation and transition are implemented on DBMS. The proposed system is implemented to show that the framework is feasible. In the experiment using real-world large data, personalized recommendation is given in almost real-time and shows acceptable correctness.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.23 no.4
• /
• pp.283-308
• /
• 2012

With explosive growth of information by recent advancements in information technology and the Internet, users need a method to acquire appropriate information. To solve this problem, an information retrieval and filtering system was developed as an important tool for users. Also, users and service providers are growing more and more interested in personalized information recommendation. This study designed and implemented personalized information recommendation system based on AR as a method to provide positive information service for information users as a method to provide positive information service. To achieve the goal, the proposed method overcomes the weaknesses of existing systems, by providing a personalized recommendation method for contents that works in a large-scaled data and user environment. This study based on the proposed method to extract rules from log files showing users' behavior provides an effective framework to extract Association Rule.

• Smart Media Journal
• /
• v.10 no.1
• /
• pp.116-123
• /
• 2021

Due to the rapid growth of the online fashion market and the resulting expansion of online choices, there is a problem that the seller cannot directly respond to a large number of consumers individually, although consumers are increasingly demanding for more personalized recommendation services. Images are being tagged as a way to meet consumer's personalization needs, but when people tagging, tagging is very subjective for each person, and artificial intelligence tagging has very limited words and does not meet the needs of users. To solve this problem, we designed an algorithm that recognizes the shape, attribute, and emotional information of the product included in the image with AI, and codes this information to represent all the information that the image has with a combination of codes. Through this algorithm, it became possible by acquiring a variety of information possessed by the image in real time, such as the sensibility of the fashion image and the TPO information expressed by the fashion image, which was not possible until now. Based on this information, it is possible to go beyond the stage of analyzing the tastes of consumers and make hyper-personalized clothing recommendations that combine the tastes of consumers with information about trends and TPOs.