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

Recommender system is the system which, by using automated information filtering technology, recommends products or services to the customers who are likely to be interested in. Those systems are widely used in many different Web retailers such as Amazon.com, Netfix.com, and CDNow.com. Various recommender systems have been developed. Among them, Collaborative Filtering (CF) has been known as the most successful and commonly used approach. CF identifies customers whose tastes are similar to those of a given customer, and recommends items those customers have liked in the past. Numerous CF algorithms have been developed to increase the performance of recommender systems. However, the relative performances of CF algorithms are known to be domain and data dependent. It is very time-consuming and expensive to implement and launce a CF recommender system, and also the system unsuited for the given domain provides customers with poor quality recommendations that make them easily annoyed. Therefore, predicting in advance whether the performance of CF recommender system is acceptable or not is practically important and needed. In this study, we propose a decision making guideline which helps decide whether CF is adoptable for a given application with certain transaction data characteristics. Several previous studies reported that sparsity, gray sheep, cold-start, coverage, and serendipity could affect the performance of CF, but the theoretical and empirical justification of such factors is lacking. Recently there are many studies paying attention to Social Network Analysis (SNA) as a method to analyze social relationships among people. SNA is a method to measure and visualize the linkage structure and status focusing on interaction among objects within communication group. CF analyzes the similarity among previous ratings or purchases of each customer, finds the relationships among the customers who have similarities, and then uses the relationships for recommendations. Thus CF can be modeled as a social network in which customers are nodes and purchase relationships between customers are links. Under the assumption that SNA could facilitate an exploration of the topological properties of the network structure that are implicit in transaction data for CF recommendations, we focus on density, clustering coefficient, and centralization which are ones of the most commonly used measures to capture topological properties of the social network structure. While network density, expressed as a proportion of the maximum possible number of links, captures the density of the whole network, the clustering coefficient captures the degree to which the overall network contains localized pockets of dense connectivity. Centralization reflects the extent to which connections are concentrated in a small number of nodes rather than distributed equally among all nodes. We explore how these SNA measures affect the performance of CF performance and how they interact to each other. Our experiments used sales transaction data from H department store, one of the well?known department stores in Korea. Total 396 data set were sampled to construct various types of social networks. The dependant variable measuring process consists of three steps; analysis of customer similarities, construction of a social network, and analysis of social network patterns. We used UCINET 6.0 for SNA. The experiments conducted the 3-way ANOVA which employs three SNA measures as dependant variables, and the recommendation accuracy measured by F1-measure as an independent variable. The experiments report that 1) each of three SNA measures affects the recommendation accuracy, 2) the density's effect to the performance overrides those of clustering coefficient and centralization (i.e., CF adoption is not a good decision if the density is low), and 3) however though the density is low, the performance of CF is comparatively good when the clustering coefficient is low. We expect that these experiment results help firms decide whether CF recommender system is adoptable for their business domain with certain transaction data characteristics.

• 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.

• Journal of Intelligence and Information Systems
• /
• v.23 no.4
• /
• pp.77-110
• /
• 2017

Recently, the diversification and individualization of consumption patterns through the web and mobile devices based on the Internet have been rapid. As this happens, the efficient operation of the offline store, which is a traditional distribution channel, has become more important. In order to raise both the sales and profits of stores, stores need to supply and sell the most attractive products to consumers in a timely manner. However, there is a lack of research on which SKUs, out of many products, can increase sales probability and reduce inventory costs. In particular, if a company sells products through multiple in-store stores across multiple locations, it would be helpful to increase sales and profitability of stores if SKUs appealing to customers are recommended. In this study, the recommender system (recommender system such as collaborative filtering and hybrid filtering), which has been used for personalization recommendation, is suggested by SKU recommendation method of a store unit of a distribution company that handles a homogeneous brand through a plurality of sales stores by country and region. We calculated the similarity of each store by using the purchase data of each store's handling items, filtering the collaboration according to the sales history of each store by each SKU, and finally recommending the individual SKU to the store. In addition, the store is classified into four clusters through PCA (Principal Component Analysis) and cluster analysis (Clustering) using the store profile data. The recommendation system is implemented by the hybrid filtering method that applies the collaborative filtering in each cluster and measured the performance of both methods based on actual sales data. Most of the existing recommendation systems have been studied by recommending items such as movies and music to the users. In practice, industrial applications have also become popular. In the meantime, there has been little research on recommending SKUs for each store by applying these recommendation systems, which have been mainly dealt with in the field of personalization services, to the store units of distributors handling similar brands. If the recommendation method of the existing recommendation methodology was 'the individual field', this study expanded the scope of the store beyond the individual domain through a plurality of sales stores by country and region and dealt with the store unit of the distribution company handling the same brand SKU while suggesting a recommendation method. In addition, if the existing recommendation system is limited to online, it is recommended to apply the data mining technique to develop an algorithm suitable for expanding to the store area rather than expanding the utilization range offline and analyzing based on the existing individual. The significance of the results of this study is that the personalization recommendation algorithm is applied to a plurality of sales outlets handling the same brand. A meaningful result is derived and a concrete methodology that can be constructed and used as a system for actual companies is proposed. It is also meaningful that this is the first attempt to expand the research area of the academic field related to the existing recommendation system, which was focused on the personalization domain, to a sales store of a company handling the same brand. From 05 to 03 in 2014, the number of stores' sales volume of the top 100 SKUs are limited to 52 SKUs by collaborative filtering and the hybrid filtering method SKU recommended. We compared the performance of the two recommendation methods by totaling the sales results. The reason for comparing the two recommendation methods is that the recommendation method of this study is defined as the reference model in which offline collaborative filtering is applied to demonstrate higher performance than the existing recommendation method. The results of this model are compared with the Hybrid filtering method, which is a model that reflects the characteristics of the offline store view. The proposed method showed a higher performance than the existing recommendation method. The proposed method was proved by using actual sales data of large Korean apparel companies. In this study, we propose a method to extend the recommendation system of the individual level to the group level and to efficiently approach it. In addition to the theoretical framework, which is of great value.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.439-441
• /
• 2017

Matrix factorization은 사용자의 아이템 선호도를 통해 아이템을 추천해주는 성공적인 기술 중 하나이다. 이 기법은 사용자-아이템의 선호도 행렬을 채우는 것을 목표로 한다. 이 목표를 달성하기 위해 사용자-아이템의 선호도 행렬을 사용자 행렬(user latent factor)와 아이템 행렬(item latent factor)로 분해하고, 각 행렬에 대해 추론하여 완성된 사용자-아이템의 선호도 행렬을 추론한다. 하지만 Matrix factorization은 아이템의 수가 많고, 아이템에 대한 사용자들의 선호도 데이터가 적을 때 성능이 제한된다. 또한 새로운 아이템이 추가되었을 때, 새로운 아이템에 대한 사용자들의 선호도 정보가 없기 때문에 새로운 아이템이 추천되지 않는다는 문제를 가진다. 이를 해결하기 위해 본 논문에서는 아이템에 대한 부가적인 정보인 아이템 간의 유사도 정보와 아이템의 시나리오 정보의 유사도를 모델링하여 기존의 전통적인 Matrix factorization에 추가하는 아이템 정보 기반 추천 시스템을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.408-411
• /
• 2016

애플리케이션에서 고객들에 의해 생성된 평가정보는 해당 콘텐츠에 대한 고객별 선호도 정보로 볼 수 있기 때문에, 개인에게 맞춤형 추천 시스템을 설계하기 위해서 매우 중요하다. 현재 추천 시스템 분야에서 가장 많이 사용되고 있는 사용자 기반 추천 시스템은 사용자의 평점 정보만을 가지고 유사도를 측정하여 추천에 사용하고 있다. 그러나 이러한 평점 정보만을 가지고 사용자 유사도를 도출하는 것은 정밀하지 못할 수 있다. 따라서 본 연구에서는 사용자의 평점 정보 뿐만 아니라 콘텐츠의 내용을 활용하여 사용자의 선호 콘텐츠를 지식구조의 형태로 나타냄으로써 콘텐츠와 사용자의 관계를 유기적으로 표현하였다. 이와 같은 사용자의 지식구조를 바탕으로 사용자간의 유사도를 평가하고 추천에 활용하였고, 실험결과 제시된 방법으로 더 우수한 성능을 얻을 수 있는 것으로 나타났다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.436-439
• /
• 2007

추천 서비스는 사용자에게 적합한 서비스를 선응적으로 제공하는 기술로써, 전자상거래 환경을 중심으로 널리 이용되고 있다. 그러나, 유비쿼터스 환경에서도 가장 활발한 기술 접목이 이루어지는 홈 네트워크 환경 내에 추천 서비스가 적용된 사례는 많지 않다. 본 논문에서는 홈 네트워크 환경에서 누적된 사용자와 기기 간 상호작용 정보들을 바탕으로 사용자 위치 기반의 개인화된 서비스를 추천하는 알고리즘을 제안한다. 본 알고리즘에서는 밀도기반 초기값 선정 기법을 적용한 군집화를 통해 필요한 데이터만을 추출함으로써 서비스 추천의 효율성 및 정확성을 높인다. 또한, 사용자 기반의 협업 필터링을 이용하여 데이터가 충분히 많지 않은 상황에서도 정확한 서비스 추천을 수행한다.

• KIISE Transactions on Computing Practices
• /
• v.22 no.12
• /
• pp.646-653
• /
• 2016

Outbound market is a rapidly growing global industry, and has evolved into a 11 trillion won trade. A lot of recommender systems, which are based on collaborative and content filtering, target the existing purchase log or rely on studies based on similarity of products. These researches are not highly efficient as data was not obtained in advance, and acquiring the overwhelming amount of data has been relatively slow. The characteristics of an outbound product are that it should be purchased at least twice in a year, and its pricing should be in the higher category. Since the repetitive purchase of a product is rare for the outbound market, the old recommender system which profiles the existing customers is lacking, and has some limitations. Therefore, due to the scarcity of data, we suggest an improved customer-profiling method using web usage mining, algorithm of association rule, and rule-based algorithm, for faster recommender system of outbound product.

• Journal of the Korea Convergence Society
• /
• v.10 no.9
• /
• pp.31-36
• /
• 2019

Music therapy, a field that convergence music and treatment, which play a fundamental role in personality formation, possesses diverse and complex treatment methods. Music therapists in charge of music therapy may experience the same phenomenon as countertransference in consultation with clients. In addition, experiencing psychological burnout, there are many difficulties in reaching the final goal of music therapy. In this paper, we provide a collaborative filtering-based music therapy consultation data recommendation model for smooth music therapy consultation with clients who visited for music therapy. The proposed model grasps the similarity between the conventional consultation data and the new consultant data through the euclidean distance algorithm. This is to recommend similar consultation materials. Since music therapists can provide optimal consultation materials for consultants who need music therapy, smooth consultation is expected.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.6
• /
• pp.1183-1190
• /
• 2017

With the development of network and IT technology, people are searching and purchasing items they want, not bounded by places. Therefore, there are various studies on how to solve the scalability problem due to the rapidly increasing data in the recommendation system. In this paper, we propose an item-based collaborative filtering method using Tag weight and a recommendation technique using MapReduce method, which is a distributed parallel processing method. In order to improve speed and efficiency, the proposed method classifies items into categories in the preprocessing and groups according to the number of nodes. In each distributed node, data is processed by going through Map-Reduce step 4 times. In order to recommend better items to users, item tag weight is used in the similarity calculation. The experiment result indicated that the proposed method has been more enhanced the appropriacy compared to item-based method, and run efficiently on the large amounts of data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.5
• /
• pp.715-721
• /
• 2018

With the spread of mobile devices, the users of social network services or e-commerce sites have increased dramatically, and the amount of data produced by the users has increased exponentially. E-commerce companies have faced a task regarding how to extract useful information from a vast amount of data produced by the users. To solve this problem, there are various studies applying big data processing technique. In this paper, we propose a collaborative filtering method that applies the tag weight in the Apache Spark platform. In order to elevate the accuracy of recommendation, the proposed method refines the tag data in the preprocessing process and categorizes the items and then applies the information of periods and tag weight to the estimate rating of the items. After generating RDD, we calculate item similarity and prediction values and recommend items to users. The experiment result indicated that the proposed method process large amounts of data quickly and improve the appropriateness of recommendation better.