• Information Systems Review
• /
• v.14 no.3
• /
• pp.115-129
• /
• 2012

A matchmaking system is a type of recommender systems that provides a set of dating partners suitable for the user by online. Many matchmaking systems, which are widely used these days, require users to specify their preferences with regards to ideal dating partners based on criteria such as age, job and salary. However, some users are not aware of their exact preferences, or are reluctant to reveal this information even if they do know. Also, users' selection standards are not fixed and can change according to circumstances. This paper suggests a new matchmaking system called Decision Tree based Matchmaking System (DTMS) that automatically adjusts the stated standards of a user by analyzing the characteristics of the people the user chose to contact. AMMS provides recommendations for new users on the basis of their explicit preferences. However, as a user's behavioral records are accumulated, it begins to analyze their hidden implicit preferences using a decision tree technique. Subsequently, DTMS reflects these implicit preferences in proportion to their predictive accuracy. The DTMS is regularly updated when a user's data size increases by a set amount. This paper suggests an architecture for the DTMS and presents the results of the implementation of a prototype.

• 한국ITS학회:학술대회논문집
• /
• 2008.11a
• /
• pp.237-243
• /
• 2008

• International Journal of Advanced Culture Technology
• /
• v.7 no.4
• /
• pp.321-326
• /
• 2019

As AI technology is recently introduced into various fields, it is being applied to the fashion field. This paper proposes a system for recommending cody clothes suitable for a user's selected clothes. The proposed system consists of user app, cody recommendation module, and server interworking of each module and managing database data. Cody recommendation system classifies clothing images into 80 categories composed of feature combinations, selects multiple representative reference images for each category, and selects 3 full body cordy images for each representative reference image. Cody images of the representative reference image were determined by analyzing the user's preference using Google survey app. The proposed algorithm classifies categories the clothing image selected by the user into a category, recognizes the most similar image among the classification category reference images, and transmits the linked cody images to the user's app. The proposed system uses the ResNet-50 model to categorize the input image and measures similarity using ORB and HOG features to select a reference image in the category. We test the proposed algorithm in the Android app, and the result shows that the recommended system runs well.

• Journal of Korea Game Society
• /
• v.7 no.4
• /
• pp.23-31
• /
• 2007

The study is to explore the ways to design game characters according to the tendency of game users by classifying game users and analyzing the relation between user classes and their preferences towards game characters. The study examines various user classifications based on users' engagement levels, and designs a user questionnaire from them. Based on the result of questionnaire analysis, the study redefines user classes and applies the formal elements of character design to draw on the relationships between user classes and their preferences.

• Journal of KIISE:Software and Applications
• /
• v.30 no.5_6
• /
• pp.540-549
• /
• 2003

In collaborative recommendation two models are generally used: the user model and the article model. A user model learns correlation between users preferences and recommends an article based on other users preferences for the article. Similarly, an article model learns correlation between preferences for articles and recommends an article based on the target user's preference for other articles. In this paper, we investigates various combination methods of the user model and the article model for better recommendation performance. They include simple sequential and parallel methods, perceptron, multi-layer perceptron, fuzzy rules, and BKS. We adopt the multi-layer perceptron for training each of the user and article models. The multi-layer perceptron has several advantages over other methods such as the nearest neighbor method and the association rule method. It can learn weights between correlated items and it can handle easily both of symbolic and numeric data. The combined models outperform any of the basic models and our experiments show that the multi-layer perceptron is the most efficient combination method among them.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.337-342
• /
• 2010

The rise of music resources has led to a parallel rise in the need to manage thousands of songs on user devices. So users are tend to build play-list for manage songs. However the manual selection of songs for creating play-list is bothersome task. This paper proposes an auto play-list recommendation system considering user's context of use and preference. This system has two separate systems: mood and emotion classification system and music recommendation system. Users need to choose just one seed song for reflection their context of use and preference. The system recommends songs before the current song ends in order to fill up user play-list. User also can remove unsatisfied songs from recommended song list to adapt user preferences of the system for the next recommendation precess. The generated play-lists show well defined mood and emotion of music and provide songs that user preferences are reflected.

• The Journal of the Korea Contents Association
• /
• v.16 no.4
• /
• pp.56-64
• /
• 2016

With the development of information technologies and the wide spread of smart devices, the number of users of social network services has increased exponentially. Studies that identify user preferences and recommend similar users in these social network services have been actively done. In this paper, we propose a new scheme to recommend social network friends with similar preferences through the moving pattern analysis of mobile users. The proposed scheme removes the meaningless trajectories via companions, short time trajectories, and repeated trajectories to determine the correct user preference. The proposed scheme calculates user similarity using the meaningful trajectories and recommends users with similar preferences as friends. It is shown through performance evaluation that the proposed scheme outperforms the existing schemes.

• KIISE Transactions on Computing Practices
• /
• v.22 no.10
• /
• pp.504-512
• /
• 2016

In this paper, we propose a personalized event recommendation scheme using user's activity analysis and collaborative filtering in social network environments. The proposed scheme predicts un-evaluated attribute values through analysis of user activities, relationships, and collaborative filtering. The proposed scheme also incorporates a user's recent preferences by considering the recent history for the user or context-aware information to precisely grasp the user's preferences. As a result, the proposed scheme can recommend events to users with a high possibility to participate in new events, preventing indiscriminate recommendations. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through performance evaluation.

• Journal of Fashion Business
• /
• v.26 no.3
• /
• pp.33-49
• /
• 2022

In the metaverse, it is important to embellish aesthetics of user with a character called 'Avatar', a virtual representation of the user. This study provides basic data related to the fashion trend of the metaverse by studying 'Zepeto', a representative Korean platform. For empirical research, Zepeto's "Best Items" section were investigated and analyzed in the first pre-survey. Based on this, the second and main survey was conducted using a questionnaire to investigate users' style-specific preferences and purchasing behaviors for virtual fashion, comparing style preferences between virtual and real, brand preferences, and purchasing behaviors of virtual fashion. The survey found that most users were teenage girls with a high preference for pastel-toned, feminine, and cute casual styles who had a much higher interest in brands bearing idol names than in real-world luxury brands. Many responded that they felt burdened by purchasing items that had to be purchased for cash. The same can be assumed to be the reason why they preferred a suit of items that were fully coordinated rather than individual items. These results seem to reflect characteristics of teenage girls who lack cash with a high preference for idols and feminine-cute casual styles. This study suggests considerations when creating virtual fashion items. By providing basic information, more effects and developments in creating virtual fashion items that reflect consumer preferences and reactions are expected in the future.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1111-1120
• /
• 2005

In collaborative filtering systems most users do not rate preferences; so User-Item matrix shows great sparsity because it has missing values for items not rated by users. Generally, the systems predict the preferences of an active user based on the preferences of a group of users. However, default voting methods predict all missing values for all users in User-Item matrix. One of the most common methods predicting default voting values tried two different approaches using the average rating for a user or using the average rating for an item. However, there is a problem that they did not consider the characteristics of items, users, and the distribution of data set. We replace the missing values in the User-Item matrix by the default noting method using user coefficient of variance. We select the threshold of user coefficient of variance by using equations automatically and determine when to shift between the user averages and item averages according to the threshold. However, there are not always regular relations between the averages and the thresholds of user coefficient of variances in datasets. It is caused that the distribution information of user coefficient of variances in datasets affects the threshold of user coefficient of variance as well as their average. We decide the threshold of user coefficient of valiance by combining them. We evaluate our method on MovieLens dataset of user ratings for movies and show that it outperforms previously default voting methods.