• Journal of Fashion Business
• /
• v.27 no.3
• /
• pp.50-62
• /
• 2023

The e-commerce fashion market has experienced a remarkable growth, leading to an overwhelming availability of shared information and numerous choices for users. In light of this, chatbots have emerged as a promising technological solution to enhance personalized services in this context. This study aimed to develop user-product attributes for a chatbot-based personalized fashion recommendation service using big data text mining techniques. To accomplish this, over one million consumer reviews from Coupang, an e-commerce platform, were collected and analyzed using frequency analyses to identify the upper-level attributes of users and products. Attribute terms were then assigned to each user-product attribute, including user body shape (body proportion, BMI), user needs (functional, expressive, aesthetic), user TPO (time, place, occasion), product design elements (fit, color, material, detail), product size (label, measurement), and product care (laundry, maintenance). The classification of user-product attributes was found to be applicable to the knowledge graph of the Conversational Path Reasoning model. A testing environment was established to evaluate the usefulness of attributes based on real e-commerce users and purchased product information. This study is significant in proposing a new research methodology in the field of Fashion Informatics for constructing the knowledge base of a chatbot based on text mining analysis. The proposed research methodology is expected to enhance fashion technology and improve personalized fashion recommendation service and user experience with a chatbot in the e-commerce market.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.4
• /
• pp.504-510
• /
• 2009

Recently, personalized-adaptive services became the center of interest in the world. However the services about music are not widely diffused out. That is because the analyzing of music information is more difficult than analyzing of text information. In this paper, we propose a music recommendation system which provides personalized services. The system keeps a user's listening list and analyzes it to select pieces of music similar to the user's preference. For analysis, the system extracts properties from the sound wave of music and the time when the user listens to music. Based on the properties, a piece of music is mapped into a point in the property space and the time is converted into the weight of the point. At this time, if we select and analyze the group which is selected by user frequently, we can understand user's taste. However, it is not easy to predict how many groups are formed. To solve this problem, we apply the K-means clustering algorithm to the weighted points. We modified the K-means algorithm so that the number of clusters is dynamically changed. This manner limits a diameter so that we can apply this algorithm effectively when we know the range of data. By this algorithm we can find the center of each group and recommend the similar music with the group. We also consider the time when music is released. When recommending, the system selects pieces of music which is close to and released contemporarily with the user's preference. We perform experiments with one hundred pieces of music. The result shows that our proposed algorithm is effective.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.12
• /
• pp.6441-6446
• /
• 2013

The smart phone is a representative personal device that can provide information onan individual's behavior related to real-life places, where the mobile phone users frequently stay and go, and the people who call or meet with the user. This paper proposes moving modeling that is based on the individual life logs using mobile phone data for identifying individuals. This method can be used to recommend the most suitable phone-service.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.1883-1886
• /
• 2003

인터넷 서비스의 급속한 발전으로 전자상거래에서의 매우 많은 정보와 다양한 컨텐츠가 개인 사용자들에게 제공되고 있다. 또한, 이러한 개인을 고객으로 하는 각종 인터넷 쇼핑몰이 많이 생성되고 서비스됨에 따라 고객 개인을 위한 차별화된 정보가 매우 중요한 하나의 이슈로 작용하고 있다. 본 논문은 인터넷 쇼핑몰을 이용하는 각각의 고객에 대한 관심 제품에 대한 사양을 프로파일링 에이전트를 이용하여 자동화된 프로파일링을 생성하여 고객에 대한 정확한 선호 상품을 예측 및 제시하여 줌으로서 고객에게 개인화된 상품 정보를 제공해 줄 수 있는 시스템을 설계하고자 한다.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.163-172
• /
• 2012

Collaborative filtering which is used explicit method in a existing recommedation system, can not only reflect exact attributes of item but also still has the problem of sparsity and scalability, though it has been practically used to improve these defects. This paper proposes the personalized recommendation system using RFM method and k-means clustering in u-commerce which is required by real time accessablity and agility. In this paper, using a implicit method which is is not used complicated query processing of the request and the response for rating, it is necessary for us to keep the analysis of RFM method and k-means clustering to be able to reflect attributes of the item in order to find the items with high purchasablity. The proposed makes the task of clustering to apply the variable of featured vector for the customer's information and calculating of the preference by each item category based on purchase history data, is able to recommend the items with efficiency. To estimate the performance, the proposed system is compared with existing system. As a result, it can be improved and evaluated according to the criteria of logicality through the experiment with dataset, collected in a cosmetic internet shopping mall.

• Journal of Intelligence and Information Systems
• /
• v.25 no.4
• /
• pp.89-103
• /
• 2019

Recently, various approaches to recommendation systems have been studied in terms of the quality of recommendation system. A recommender system basically aims to provide personalized recommendations to users for specific items. Most of these systems always recommend the most relevant items of users or items. Traditionally, the evaluation of recommender system quality has focused on the various predictive accuracy metrics of these. However, recommender system must be not only accurate but also useful to users. User satisfaction with recommender systems as an evaluation criterion of recommender system is related not only to how accurately the system recommends but also to how much it supports the user's decision making. In particular, highly serendipitous recommendation would help a user to find a surprising and interesting item. Serendipity in this study is defined as a measure of the extent to which the recommended items are both attractive and surprising to the users. Therefore, this paper proposes an application of serendipity measure to recommender systems to evaluate the performance of recommender systems in terms of recommendation system quality. In this study we define relevant or attractive unexpectedness as serendipity measure for assessing recommendation systems. That is, serendipity measure is evaluated as the measure indicating how the recommender system can find unexpected and useful items for users. Our experimental results show that highly serendipitous recommendation such as item-based collaborative filtering method has better performance than the other recommendations, i.e. user-based collaborative filtering method in terms of recommendation system quality.

• The Journal of Society for e-Business Studies
• /
• v.12 no.3
• /
• pp.269-282
• /
• 2007

We propose a personalized concept-based retrieval technique that uses domain ontology. Proposed system consist or representative concept extraction, user profile construction, and concept-based retrieval stages. First, we extract representative concept with using technique form contents and create the domain ontology. We compose user profile analysis that uses domain ontology for personalized concept-based retrieval. To verify the efficiency of the proposed technique, we perform experiment for Internet site in the engineering area. The results of experiment show that the proposed technique using the domain ontology and user profiles is more efficient than the existing techniques. Hence, the proposed concept-based retrieval technique can be expected to contribute to the development of an efficient personalized recommendation system or e-Commerce system.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.9
• /
• pp.81-92
• /
• 2023

A privacy model is a technique that quantitatively restricts the possibility and degree of privacy breaches through privacy attacks. Representative models include k-anonymity, l-diversity, t-closeness, and differential privacy. While many privacy models have been studied, research on selecting the most suitable model for a given dataset has been relatively limited. In this study, we develop a system for recommending the suitable privacy model to prevent privacy breaches. To achieve this, we analyze the data features that need to be considered when selecting a model, such as data type, distribution, frequency, and range. Based on privacy model background knowledge that includes information about the relationships between data features and models, we recommend the most appropriate model. Finally, we validate the feasibility and usefulness by implementing a recommendation prototype system.

• Journal of Advanced Navigation Technology
• /
• v.16 no.6
• /
• pp.1109-1115
• /
• 2012

In this paper, we propose a system that recommends the appropriate menu using the fuzzy rules and the case database. The rules are defined by using the user's body information such as height and weight and these information is often vague. Due to its fuzziness, we use the fuzzy logic to represent the information. In our system, it firstly gets the body information for computing the BMI (Body Mass Index) values. Then it combines the muscle mass factor and BMI values to make a fuzzification for calculating the obesity rate. It finally recommends the most relative menu by comparing with the user's obesity rate from each cases in the database. We implement the system on the Android platform and show that our proposed method can achieve reasonable performance through the various experiments,

• The KIPS Transactions:PartD
• /
• v.14D no.3 s.113
• /
• pp.347-354
• /
• 2007

It is not easy for the customers to search the valuable information on the goods among countless items available in the Internet. In order to save time and efforts in searching the goods the customers want, it is very important for a recommender system to have a capability to predict accurately customers' preferences. In this paper we present a refined neighbor selection algorithm for clustering based collaborative filtering in recommender systems. The algorithm exploits a graph approach and searches more efficiently for set of influential customers with respect to a given customer; it searches with concepts of weighted similarity and ranked clustering. The experimental results show that the recommender systems using the proposed method find the proper neighbors and give a good prediction quality.