• Title/Summary/Keyword: 개인화추천

Search Result 526, Processing Time 0.027 seconds

Mobile Context Based User Behavior Pattern Inference and Restaurant Recommendation Model (모바일 컨텍스트 기반 사용자 행동패턴 추론과 음식점 추천 모델)

  • Ahn, Byung-Ik;Jung, Ku-Imm;Choi, Hae-Lim
    • Journal of Digital Contents Society
    • /
    • v.18 no.3
    • /
    • pp.535-542
    • /
    • 2017
  • The ubiquitous computing made it happen to easily take cognizance of context, which includes user's location, status, behavior patterns and surrounding places. And it allows providing the catered service, designed to improve the quality and the interaction between the provider and its customers. The personalized recommendation service needs to obtain logical reasoning to interpret the context information based on user's interests. We researched a model that connects to the practical value to users for their daily life; information about restaurants, based on several mobile contexts that conveys the weather, time, day and location information. We also have made various approaches including the accurate rating data review, the equation of Naïve Bayes to infer user's behavior-patterns, and the recommendable places pre-selected by preference predictive algorithm. This paper joins a vibrant conversation to demonstrate the excellence of this approach that may prevail other previous rating method systems.

Performance Improvement of a Movie Recommendation System using Genre-wise Collaborative Filtering (장르별 협업필터링을 이용한 영화 추천 시스템의 성능 향상)

  • Lee, Jae-Sik;Park, Seog-Du
    • Journal of Intelligence and Information Systems
    • /
    • v.13 no.4
    • /
    • pp.65-78
    • /
    • 2007
  • This paper proposes a new method of weighted template matching for machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. Template matching is vulnerable to random noises that generate ragged outlines of a pattern when it is binarized. This paper offers a method of chain code trimming in order to remove ragged outlines. The method corrects specific chain codes within the chain codes of the inner and the outer contour of a pattern. The experiment compares confusion matrices of both the template matching and the proposed weighted template matching with chain code trimming. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

  • PDF

Multimodal Media Content Classification using Keyword Weighting for Recommendation (추천을 위한 키워드 가중치를 이용한 멀티모달 미디어 콘텐츠 분류)

  • Kang, Ji-Soo;Baek, Ji-Won;Chung, Kyungyong
    • Journal of Convergence for Information Technology
    • /
    • v.9 no.5
    • /
    • pp.1-6
    • /
    • 2019
  • As the mobile market expands, a variety of platforms are available to provide multimodal media content. Multimodal media content contains heterogeneous data, accordingly, user requires much time and effort to select preferred content. Therefore, in this paper we propose multimodal media content classification using keyword weighting for recommendation. The proposed method extracts keyword that best represent contents through keyword weighting in text data of multimodal media contents. Based on the extracted data, genre class with subclass are generated and classify appropriate multimodal media contents. In addition, the user's preference evaluation is performed for personalized recommendation, and multimodal content is recommended based on the result of the user's content preference analysis. The performance evaluation verifies that it is superiority of recommendation results through the accuracy and satisfaction. The recommendation accuracy is 74.62% and the satisfaction rate is 69.1%, because it is recommended considering the user's favorite the keyword as well as the genre.

Extended Knowledge Graph using Relation Modeling between Heterogeneous Data for Personalized Recommender Systems (이종 데이터 간 관계 모델링을 통한 개인화 추천 시스템의 지식 그래프 확장 기법)

  • SeungJoo Lee;Seokho Ahn;Euijong Lee;Young-Duk Seo
    • Smart Media Journal
    • /
    • v.12 no.4
    • /
    • pp.27-40
    • /
    • 2023
  • Many researchers have investigated ways to enhance recommender systems by integrating heterogeneous data to address the data sparsity problem. However, only a few studies have successfully integrated heterogeneous data using knowledge graph. Additionally, most of the knowledge graphs built in these studies only incorporate explicit relationships between entities and lack additional information. Therefore, we propose a method for expanding knowledge graphs by using deep learning to model latent relationships between heterogeneous data from multiple knowledge bases. Our extended knowledge graph enhances the quality of entity features and ultimately increases the accuracy of predicted user preferences. Experiments using real music data demonstrate that the expanded knowledge graph leads to an increase in recommendation accuracy when compared to the original knowledge graph.

An Item-based Collaborative Filtering Technique by Associative Relation Clustering in Personalized Recommender Systems (개인화 추천 시스템에서 연관 관계 군집에 의한 아이템 기반의 협력적 필터링 기술)

  • 정경용;김진현;정헌만;이정현
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.4
    • /
    • pp.467-477
    • /
    • 2004
  • While recommender systems were used by a few E-commerce sites former days, they are now becoming serious business tools that are re-shaping the world of I-commerce. And collaborative filtering has been a very successful recommendation technique in both research and practice. But there are two problems in personalized recommender systems, it is First-Rating problem and Sparsity problem. In this paper, we solve these problems using the associative relation clustering and “Lift” of association rules. We produce “Lift” between items using user's rating data. And we apply Threshold by -cut to the association between items. To make an efficiency of associative relation cluster higher, we use not only the existing Hypergraph Clique Clustering algorithm but also the suggested Split Cluster method. If the cluster is completed, we calculate a similarity iten in each inner cluster. And the index is saved in the database for the fast access. We apply the creating index to predict the preference for new items. To estimate the Performance, the suggested method is compared with existing collaborative filtering techniques. As a result, the proposed method is efficient for improving the accuracy of prediction through solving problems of existing collaborative filtering techniques.

Factors Affecting the Re-participation and Recommendation of Overseas Taekwondo Teaching Experiences of Taekwondo Majoring College Students (태권도전공 대학생의 해외 지도 활동 재참여 및 타인추천에 영향을 미치는 요인)

  • Na, Yoon-Ho;Chang, Ik-Young
    • Journal of Korea Entertainment Industry Association
    • /
    • v.15 no.8
    • /
    • pp.233-246
    • /
    • 2021
  • The study aims to find out the influence factors to intention of re-participation and intention of recommendation to overseas Taekwondo teaching experience. To accomplish this purpose, the subjects of this study consist of 316 people who have experienced Taekwondo teaching in overseas within the last five years. Descriptive analysis, one-way ANOVA, and hierarchical regression analysis were used to analyze data. 1) there was a significant difference in the intention of re-participation and intention of recommendation to overseas Taekwondo teaching experience according to the family income level, the period of experience, the satisfaction of curriculum, and the satisfaction of the field. 2) activity factors and interpersonal factors had an effect on intention of re-participation and intention of recommendation to overseas Taekwondo teaching experience more than personal factors. If this is reflected in the reality, students who majoring in Taekwondo will be able to have a higher quality overseas experience, which will ultimately contribute to the expansion of the job market and further development of Taekwondo internationalization.

Regulatory Focus Classification for Web Shopping Consumers According to Product Type (제품유형에 따른 웹쇼핑 소비자의 조절초점성향 분류)

  • Baik, Jong-Bum;Han, Chung-Seok;Jang, Eun-Young;Kim, Yong-Bum;Choi, Ja-Young;Lee, Soo-Won
    • The KIPS Transactions:PartB
    • /
    • v.19B no.4
    • /
    • pp.231-236
    • /
    • 2012
  • According to consumer behavior theory, human propensity can be divided into two regulatory focus types: promotion and prevention. These two types have much influence on the consumer's decision in many diverse areas. In this research, we apply regulatory focus theory to personalized recommendation to minimize the cold start problem and to improve the performance of recommendation algorithms. To achieve this goal, we extract the consumer behavior variables and information exploration activity index from web shopping logs. We then use them for classifying regulatory focus of the consumer. This research has the contribution to show the possibility of systematization of consumer behavior theory as an interdisciplinary research tool of social science and information technology. Based on this attempt, we will extend the research to IT services adapting theories on other areas.

Personalized Size Recommender System for Online Apparel Shopping: A Collaborative Filtering Approach

  • Dongwon Lee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.8
    • /
    • pp.39-48
    • /
    • 2023
  • This study was conducted to provide a solution to the problem of sizing errors occurring in online purchases due to discrepancies and non-standardization in clothing sizes. This paper discusses an implementation approach for a machine learning-based recommender system capable of providing personalized sizes to online consumers. We trained multiple validated collaborative filtering algorithms including Non-Negative Matrix Factorization (NMF), Singular Value Decomposition (SVD), k-Nearest Neighbors (KNN), and Co-Clustering using purchasing data derived from online commerce and compared their performance. As a result of the study, we were able to confirm that the NMF algorithm showed superior performance compared to other algorithms. Despite the characteristic of purchase data that includes multiple buyers using the same account, the proposed model demonstrated sufficient accuracy. The findings of this study are expected to contribute to reducing the return rate due to sizing errors and improving the customer experience on e-commerce platforms.

Building Error-Reflected Models for Collaborative Filtering Recommender System (협업적 여과 추천 시스템을 위한 에러반영 모델 구축)

  • Kim, Heung-Nam;Jo, Geun-Sik
    • The KIPS Transactions:PartD
    • /
    • v.16D no.3
    • /
    • pp.451-462
    • /
    • 2009
  • Collaborative Filtering (CF), one of the most successful technologies among recommender systems, is a system assisting users in easily finding the useful information. However, despite its success and popularity, CF encounters a serious limitation with quality evaluation, called cold start problems. To alleviate this limitation, in this paper, we propose a unique method of building models derived from explicit ratings and applying the models to CF recommender systems. The proposed method is divided into two phases, an offline phase and an online phase. First, the offline phase is a building pre-computed model phase in which most of tasks can be conducted. Second, the online phase is either a prediction or recommendation phase in which the models are used. In a model building phase, we first determine a priori predicted rating and subsequently identify prediction errors for each user. From this error information, an error-reflected model is constructed. The error-reflected model, which is reflected average prior prediction errors of user neighbors and item neighbors, can make accurate predictions in the situation where users or items have few opinions; this is known as the cold start problems. In addition, in order to reduce the re-building tasks, the error-reflected model is designed such that the model is updated effectively and users'new opinions are reflected incrementally, even when users present a new rating feedback.

Recommending System of Products based on Data mining Technique (데이터 마이닝 기법을 이용한 상품 추천 시스템)

  • Jung, Min-A.;Park, Kyung-Woo;Cho, Sung-Eui
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.3
    • /
    • pp.608-613
    • /
    • 2006
  • There are many e-showing mall because of revitalization of e-commerce system. It is necessary to recommending system of products that is for saving time and effort of customer. In this paper, we propose the system that is applying classification among data mining techniques to analysis of log data of customer. This log data contains access of user and purchasing of products. The proposed system operates in two phases. The first phase is composed of data filter module and association extraction module among web pages. The second phase is composed of personalization module and rule generation module. Customer can easily know the recommended sites because the proposed system can present rank of the recommended web pages to customer. As a result, the proposed system can efficiently do recommending of products to customer.