• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.62-65
• /
• 2011

최근 화두가 되고 있는 스마트 폰 앱의 관심으로 스마트 TV의 앱에 대한 관심도 함께 증가하고 있다. TV시청 이용자들의 편의를 위해 증가하고 있는 수많은 채널과 콘텐츠 중, 개인 사용자의 이용 습관 및 대중의 선호 프로그램을 고려하여, 편리하게 원하는 TV프로그램에 접근하도록 해 주는 TV 앱이 있다면 이는 매우 중요한 기능으로 자리 잡을 가능성이 높을 것으로 예상된다. 이에 본 논문은 사용자의 시청 이용행태를 기반으로 주제모델링 기술의 고전적 모델인 LDA을 기반으로 협업필터링을 결합한 TV 선호 프로그램 추천 알고리듬을 제안한다. 개인의 관심 선호도는 일반적으로 특정 개수로 한정지어지는 특성을 고려하여, 개인 선호도 특성이 구별 되도록 두 가지 방법을 적용하였다. 하나는 개인 선호도 프로파일의 특정 상위 주제만을 고려하는 것이고, 또 다른 하나는 개인별 주제에 대한 선호도의 다양성이 드러나도록 비대칭 하이퍼-파라미터를 갖는 LDA를 사용 하였다. 실험 결과, 두 가지 방식에 대해 사용자의 실제 TV시청 이용내역 데이터를 기반으로 추천 성능의 향상을 평균 Precision 값을 측정하여 확인하였다. 또한, 본 논문에서는 주제 모델링을 통해 학습된 각 주제의 상위 확률의 TV 프로그램들을 분석한 결과, 하나의 주제가 개인별 시청의 특성 보다는 가족단위의 시청 특성을 드러냄을 확인할 수 있었다.

• Journal of Intelligence and Information Systems
• /
• v.14 no.2
• /
• pp.207-222
• /
• 2008

This research suggests the method of how to build agricultural and stockbreeding products recommender systems based on RFID technology for monitoring crop and livestock production, tracing production history as an application strategy. In the past the studies on enterprise applications have been barely implemented owing to the rack of business model and limitation of technical development. Currently however there have been enormous technological progress of RFID and agricultural and stockbreeding products retailing sites are increased. Therefore this paper suggests PDCF-ASP(Profile Decay based Collaborative Fltering for Agricultural and Stockbreeding Products) which is designed to reduce customers… search efforts in finding safety and fresh products on the internet shopping mall. For this, product decay function is defined to make sure whether the products are safety or not and to adopt a change in customer preferences. And for the implementation of PDCF-ASP, the system structure including functional agents is schematized.

• Information Systems Review
• /
• v.23 no.3
• /
• pp.51-75
• /
• 2021

Global e-commerce websites offer personalized recommendation services to gain sustainable competitiveness. Existing studies have offered personalized recommendation services using quantitative preferences such as ratings. However, offering personalized recommendation services using only quantitative data has raised the problem of decreasing recommendation performance. For example, a user gave a five-star rating but wrote a review that the user was unsatisfied with hotel service and cleanliness. In such cases, has problems where quantitative and qualitative preferences are inconsistent. Recently, a growing number of studies have considered review data simultaneously to improve the limitations of existing personalized recommendation service studies. Therefore, in this study, we identify review and rating mismatches and build a new user profile to offer personalized recommendation services. To this end, we use deep learning algorithms such as CNN, LSTM, CNN + LSTM, which have been widely used in sentiment analysis studies. And extract sentiment features from reviews and compare with quantitative preferences. To evaluate the performance of the proposed methodology in this study, we collect user preference information using real-world hotel data from the world's largest travel platform TripAdvisor. Experiments show that the proposed methodology in this study outperforms the existing other methodologies, using only existing quantitative preferences.

• Journal of Intelligence and Information Systems
• /
• v.26 no.2
• /
• pp.43-56
• /
• 2020

Recommender systems help users make the best choice among various options. Especially, recommender systems play important roles in internet sites as digital information is generated innumerable every second. Many studies on recommender systems have focused on an accurate recommendation. However, there are some problems to overcome in order for the recommendation system to be commercially successful. First, there is a lack of transparency in the recommender system. That is, users cannot know why products are recommended. Second, the recommender system cannot immediately reflect changes in user preferences. That is, although the preference of the user's product changes over time, the recommender system must rebuild the model to reflect the user's preference. Therefore, in this study, we proposed a recommendation methodology using topic modeling and sequential association rule mining to solve these problems from review data. Product reviews provide useful information for recommendations because product reviews include not only rating of the product but also various contents such as user experiences and emotional state. So, reviews imply user preference for the product. So, topic modeling is useful for explaining why items are recommended to users. In addition, sequential association rule mining is useful for identifying changes in user preferences. The proposed methodology is largely divided into two phases. The first phase is to create user profile based on topic modeling. After extracting topics from user reviews on products, user profile on topics is created. The second phase is to recommend products using sequential rules that appear in buying behaviors of users as time passes. The buying behaviors are derived from a change in the topic of each user. A collaborative filtering-based recommendation system was developed as a benchmark system, and we compared the performance of the proposed methodology with that of the collaborative filtering-based recommendation system using Amazon's review dataset. As evaluation metrics, accuracy, recall, precision, and F1 were used. For topic modeling, collapsed Gibbs sampling was conducted. And we extracted 15 topics. Looking at the main topics, topic 1, top 3, topic 4, topic 7, topic 9, topic 13, topic 14 are related to "comedy shows", "high-teen drama series", "crime investigation drama", "horror theme", "British drama", "medical drama", "science fiction drama", respectively. As a result of comparative analysis, the proposed methodology outperformed the collaborative filtering-based recommendation system. From the results, we found that the time just prior to the recommendation was very important for inferring changes in user preference. Therefore, the proposed methodology not only can secure the transparency of the recommender system but also can reflect the user's preferences that change over time. However, the proposed methodology has some limitations. The proposed methodology cannot recommend product elaborately if the number of products included in the topic is large. In addition, the number of sequential patterns is small because the number of topics is too small. Therefore, future research needs to consider these limitations.

• Journal of KIISE
• /
• v.43 no.7
• /
• pp.786-794
• /
• 2016

Recommender systems can be used to assist users in selecting required services for their tasks in Internet of Things (IoT) environments in which diverse services can be provided by utilizing IoT devices. Traditional research on recommendation mainly focuses on predicting preferences of individual users. However, in IoT environments, not only individual users but also groups of users can access services in the environments. In this study, we analyzed user groups' preferences on services and developed service recommendation approach for new groups that do not have a history of accessing IoT-services in a certain place. Our approach extends the traditional user-based collaborative filtering by considering the similarity between user groups based on their member organization. We conducted experiments with a real-world dataset collected from IoT testbed environments. The results demonstrate that the proposed approach is effective to recommend services to new user groups in IoT environments.

• Journal of Intelligence and Information Systems
• /
• v.20 no.2
• /
• pp.73-92
• /
• 2014

An Adaptive Clustering-based Collaborative Filtering Technique was proposed to solve the fundamental problems of collaborative filtering, such as cold-start problems, scalability problems and data sparsity problems. Previous collaborative filtering techniques were carried out according to the recommendations based on the predicted preference of the user to a particular item using a similar item subset and a similar user subset composed based on the preference of users to items. For this reason, if the density of the user preference matrix is low, the reliability of the recommendation system will decrease rapidly. Therefore, the difficulty of creating a similar item subset and similar user subset will be increased. In addition, as the scale of service increases, the time needed to create a similar item subset and similar user subset increases geometrically, and the response time of the recommendation system is then increased. To solve these problems, this paper suggests a collaborative filtering technique that adapts a condition actively to the model and adopts the concepts of a context-based filtering technique. This technique consists of four major methodologies. First, items are made, the users are clustered according their feature vectors, and an inter-cluster preference between each item cluster and user cluster is then assumed. According to this method, the run-time for creating a similar item subset or user subset can be economized, the reliability of a recommendation system can be made higher than that using only the user preference information for creating a similar item subset or similar user subset, and the cold start problem can be partially solved. Second, recommendations are made using the prior composed item and user clusters and inter-cluster preference between each item cluster and user cluster. In this phase, a list of items is made for users by examining the item clusters in the order of the size of the inter-cluster preference of the user cluster, in which the user belongs, and selecting and ranking the items according to the predicted or recorded user preference information. Using this method, the creation of a recommendation model phase bears the highest load of the recommendation system, and it minimizes the load of the recommendation system in run-time. Therefore, the scalability problem and large scale recommendation system can be performed with collaborative filtering, which is highly reliable. Third, the missing user preference information is predicted using the item and user clusters. Using this method, the problem caused by the low density of the user preference matrix can be mitigated. Existing studies on this used an item-based prediction or user-based prediction. In this paper, Hao Ji's idea, which uses both an item-based prediction and user-based prediction, was improved. The reliability of the recommendation service can be improved by combining the predictive values of both techniques by applying the condition of the recommendation model. By predicting the user preference based on the item or user clusters, the time required to predict the user preference can be reduced, and missing user preference in run-time can be predicted. Fourth, the item and user feature vector can be made to learn the following input of the user feedback. This phase applied normalized user feedback to the item and user feature vector. This method can mitigate the problems caused by the use of the concepts of context-based filtering, such as the item and user feature vector based on the user profile and item properties. The problems with using the item and user feature vector are due to the limitation of quantifying the qualitative features of the items and users. Therefore, the elements of the user and item feature vectors are made to match one to one, and if user feedback to a particular item is obtained, it will be applied to the feature vector using the opposite one. Verification of this method was accomplished by comparing the performance with existing hybrid filtering techniques. Two methods were used for verification: MAE(Mean Absolute Error) and response time. Using MAE, this technique was confirmed to improve the reliability of the recommendation system. Using the response time, this technique was found to be suitable for a large scaled recommendation system. This paper suggested an Adaptive Clustering-based Collaborative Filtering Technique with high reliability and low time complexity, but it had some limitations. This technique focused on reducing the time complexity. Hence, an improvement in reliability was not expected. The next topic will be to improve this technique by rule-based filtering.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.1100-1102
• /
• 2013

현대사회에서는 외모가 내 외적으로 자신을 나타내는 지표이자 상징이며, 사회적 위치나 경제적 상황, 자아정체성을 대변할 수 있다. 또한 경제능력이 향상되고 기존의 성역할 개념의 약화, 사회진출과 인간관계 유지를 위해 남성들도 외모관리에 대한 관심이 높아지기 시작했다. 본 논문은 비교적 화장품에 대한 정보를 잘 알지 못하는 남성들을 대상으로 웹에서 사용자의 나이, 피부톤, 피부타입에 알맞은 화장품을 추천해주는 시스템을 소개한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2602-2608
• /
• 2013

User-based and item-based method have been developed as the solutions of the movie recommendation problem. However, these methods are faced with the sparsity problem and the problem of not reflecting user's rating respectively. In order to solve these problems, there is a research on the combination of the two methods using the concept of similarity. In reality, it is not free from the problem of sparsity, since it has a lot of parameters to be calculated. In this study, we propose a recommendation method using rating difference between items in order to complement this problem. This method is relatively free from the problem of sparsity, since it has less parameters to be calculated. And it can get more accurate results by reflecting the users rating to calculate the parameters. In experiments for the proposed method, the initial error is large, but the performance has been quickly stabilized after. In addition, it showed a 0.0538 lower average error compared to the existing method using similarity.

• Journal of Digital Convergence
• /
• v.15 no.12
• /
• pp.293-301
• /
• 2017

Most new products not only suddenly disappear in the market but also quickly cannibalize older products. Under such a circumstance, retailers may have too much stock, and customers may be faced with difficulties discovering products suitable to their preferences among short life cycle products. To address these problems, recommender systems are good solutions. However, most previous recommender systems had difficulty in reflecting changes in customer preferences because the systems employ static customer preferences. In this paper, we propose a recommendation methodology that considers dynamic customer preferences. The proposed methodology consists of dynamic customer profile creation, neighborhood formation, and recommendation list generation. For the experiments, we employ a mobile image transaction dataset that has a short product life cycle. Our experimental results demonstrate that the proposed methodology has a higher quality of recommendation than a typical collaborative filtering-based system. From these results, we conclude that the proposed methodology is effective under conditions where most new products have short life cycles. The proposed methodology need to be verified in the physical environment at a future time.

• Journal of Intelligence and Information Systems
• /
• v.16 no.4
• /
• pp.159-172
• /
• 2010

The recommender system is one of the possible solutions to assist customers in finding the items they would like to purchase. To date, a variety of recommendation techniques have been developed. One of the most successful recommendation techniques is Collaborative Filtering (CF) that has been used in a number of different applications such as recommending Web pages, movies, music, articles and products. 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. Broadly, there are memory-based CF algorithms, model-based CF algorithms, and hybrid CF algorithms which combine CF with content-based techniques or other recommender systems. While many researchers have focused their efforts in improving CF performance, the theoretical justification of CF algorithms is lacking. That is, we do not know many things about how CF is done. Furthermore, 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 the performances of CF algorithms in advance is practically important and needed. In this study, we propose an efficient approach to predict the performance of CF. Social Network Analysis (SNA) and Artificial Neural Network (ANN) are applied to develop our prediction model. CF can be modeled as a social network in which customers are nodes and purchase relationships between customers are links. SNA facilitates an exploration of the topological properties of the network structure that are implicit in data for CF recommendations. An ANN model is developed through an analysis of network topology, such as network density, inclusiveness, clustering coefficient, network centralization, and Krackhardt's efficiency. 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. Inclusiveness refers to the number of nodes which are included within the various connected parts of the social network. Centralization reflects the extent to which connections are concentrated in a small number of nodes rather than distributed equally among all nodes. Krackhardt's efficiency characterizes how dense the social network is beyond that barely needed to keep the social group even indirectly connected to one another. We use these social network measures as input variables of the ANN model. As an output variable, we use the recommendation accuracy measured by F1-measure. In order to evaluate the effectiveness of the ANN model, sales transaction data from H department store, one of the well-known department stores in Korea, was used. Total 396 experimental samples were gathered, and we used 40%, 40%, and 20% of them, for training, test, and validation, respectively. The 5-fold cross validation was also conducted to enhance the reliability of our experiments. The input variable measuring process consists of following three steps; analysis of customer similarities, construction of a social network, and analysis of social network patterns. We used Net Miner 3 and UCINET 6.0 for SNA, and Clementine 11.1 for ANN modeling. The experiments reported that the ANN model has 92.61% estimated accuracy and 0.0049 RMSE. Thus, we can know that our prediction model helps decide whether CF is useful for a given application with certain data characteristics.