• Title/Summary/Keyword: Recommender System

Search Result 441, Processing Time 0.023 seconds

An Expert System for the Estimation of the Growth Curve Parameters of New Markets (신규시장 성장모형의 모수 추정을 위한 전문가 시스템)

  • Lee, Dongwon;Jung, Yeojin;Jung, Jaekwon;Park, Dohyung
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.4
    • /
    • pp.17-35
    • /
    • 2015
  • Demand forecasting is the activity of estimating the quantity of a product or service that consumers will purchase for a certain period of time. Developing precise forecasting models are considered important since corporates can make strategic decisions on new markets based on future demand estimated by the models. Many studies have developed market growth curve models, such as Bass, Logistic, Gompertz models, which estimate future demand when a market is in its early stage. Among the models, Bass model, which explains the demand from two types of adopters, innovators and imitators, has been widely used in forecasting. Such models require sufficient demand observations to ensure qualified results. In the beginning of a new market, however, observations are not sufficient for the models to precisely estimate the market's future demand. For this reason, as an alternative, demands guessed from those of most adjacent markets are often used as references in such cases. Reference markets can be those whose products are developed with the same categorical technologies. A market's demand may be expected to have the similar pattern with that of a reference market in case the adoption pattern of a product in the market is determined mainly by the technology related to the product. However, such processes may not always ensure pleasing results because the similarity between markets depends on intuition and/or experience. There are two major drawbacks that human experts cannot effectively handle in this approach. One is the abundance of candidate reference markets to consider, and the other is the difficulty in calculating the similarity between markets. First, there can be too many markets to consider in selecting reference markets. Mostly, markets in the same category in an industrial hierarchy can be reference markets because they are usually based on the similar technologies. However, markets can be classified into different categories even if they are based on the same generic technologies. Therefore, markets in other categories also need to be considered as potential candidates. Next, even domain experts cannot consistently calculate the similarity between markets with their own qualitative standards. The inconsistency implies missing adjacent reference markets, which may lead to the imprecise estimation of future demand. Even though there are no missing reference markets, the new market's parameters can be hardly estimated from the reference markets without quantitative standards. For this reason, this study proposes a case-based expert system that helps experts overcome the drawbacks in discovering referential markets. First, this study proposes the use of Euclidean distance measure to calculate the similarity between markets. Based on their similarities, markets are grouped into clusters. Then, missing markets with the characteristics of the cluster are searched for. Potential candidate reference markets are extracted and recommended to users. After the iteration of these steps, definite reference markets are determined according to the user's selection among those candidates. Then, finally, the new market's parameters are estimated from the reference markets. For this procedure, two techniques are used in the model. One is clustering data mining technique, and the other content-based filtering of recommender systems. The proposed system implemented with those techniques can determine the most adjacent markets based on whether a user accepts candidate markets. Experiments were conducted to validate the usefulness of the system with five ICT experts involved. In the experiments, the experts were given the list of 16 ICT markets whose parameters to be estimated. For each of the markets, the experts estimated its parameters of growth curve models with intuition at first, and then with the system. The comparison of the experiments results show that the estimated parameters are closer when they use the system in comparison with the results when they guessed them without the system.

A Matchmaking System Adjusting the Mate-Selection Criteria based on a User's Behaviors using the Decision Tree (고객의 암묵적 이상형을 반영하여 배우자 선택기준을 동적으로 조정하는 온라인 매칭 시스템: 의사결정나무의 활용을 중심으로)

  • Park, Yoon-Joo
    • 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.

  • PDF

An Adaptive Recommendation Service Scheme Using Context-Aware Information in Ubiquitous Environment (유비쿼터스 환경에서 상황 인지 정보를 이용한 적응형 추천 서비스 기법)

  • Choi, Jung-Hwan;Ryu, Sang-Hyun;Jang, Hyun-Su;Eom, Young-Ik
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.3
    • /
    • pp.185-193
    • /
    • 2010
  • With the emergence of ubiquitous computing era, various models for providing personalized service have been proposed, and, especially, several recommendation service schemes have been proposed to give tailored services to users proactively. However, the previous recommendation service schemes utilize a wide range of data without and filtering and consider the limited context-aware information to predict user preferences so that they are not adequate to provide personalized service to users. In this paper, we propose an adaptive recommendation service scheme which proactively provides suitable services based on the current context. We use accumulated interaction contexts (IC) between users and devices for predicting the user's preferences and recommend adaptive service based on the current context by utilizing clustering and collaborative filtering. The clustering algorithm improves efficiency of the recommendation service by focusing and analyzing the data that is collected from the locations nearby the users. Collaborative filtering guarantees an accurate recommendation, even when the data is insufficient. Finally, we evaluate the performance and the reliability of the proposed scheme by simulations.

A Study on Recommendation Technique Using Mining and Clustering of Weighted Preference based on FRAT (마이닝과 FRAT기반 가중치 선호도 군집을 이용한 추천 기법에 관한 연구)

  • Park, Wha-Beum;Cho, Young-Sung;Ko, Hyung-Hwa
    • Journal of Digital Contents Society
    • /
    • v.14 no.4
    • /
    • pp.419-428
    • /
    • 2013
  • Real-time accessibility and agility are required in u-commerce under ubiquitous computing environment. Most of the existing recommendation techniques adopt the method of evaluation based on personal profile, which has been identified with difficulties in accurately analyzing the customers' level of interest and tendencies, as well as the problems of cost, consequently leaving customers unsatisfied. Researches have been conducted to improve the accuracy of information such as the level of interest and tendencies of the customers. However, the problem lies not in the preconstructed database, but in generating new and diverse profiles that are used for the evaluation of the existing data. Also it is difficult to use the unique recommendation method with hierarchy of each customer who has various characteristics in the existing recommendation techniques. Accordingly, this dissertation used the implicit method without onerous question and answer to the users based on the data from purchasing, unlike the other evaluation techniques. We applied FRAT technique which can analyze the tendency of the various personalization and the exact customer.

Bias-Based Predictor to Improve the Recommendation Performance of the Rating Frequency Weight-based Baseline Predictor (평점 빈도 가중치 기반 기준선 예측기의 추천 성능 향상을 위한 편향 기반 추천기)

  • Hwang, Tae-Gyu;Kim, Sung Kwon
    • Journal of KIISE
    • /
    • v.44 no.5
    • /
    • pp.486-495
    • /
    • 2017
  • Collaborative Filtering is limited because of the cost that is required to perform the recommendation (such as the time complexity and space complexity). The RFWBP (Rating Frequency Weight-based Baseline Predictor) that approximates the precision of the existing methods is one of the efficiency methods to reduce the cost. But, the following issues need to be considered regarding the RFWBP: 1) It does not reduce the error because the RFWBP does not learn for the recommendation, and 2) it recommends all of the items because there is no condition for an appropriate recommendation list when only the RFWBP is used for the achievement of efficiency. In this paper, the BBP (Bias-Based Predictor) is proposed to solve these problems. The BBP reduces the error range, and it determines some of the cases to make an appropriate recommendation list, thereby forging a recommendation list for each case.

A Recommendation Technique using Weight of User Information (사용자 정보 가중치를 이용한 추천 기법)

  • Yun, So-Young;Youn, Sung-Dae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.4
    • /
    • pp.877-885
    • /
    • 2011
  • A collaborative filtering(CF) is the most widely used technique in recommender system. However, CF has sparsity and scalability problems. These problems reduce the accuracy of recommendation and extensive studies have been made to solve these problems, In this paper, we proposed a method that uses a weight so as to solve these problems. After creating a user-item matrix, the proposed method analyzes information about users who prefer the item only by using data with a rating over 4 for enhancing the accuracy in the recommendation. The proposed method uses information about the genre of the item as well as analyzed user information as a weight during the calculation of similarity, and it calculates prediction by using only data for which the similarity is over a threshold and uses the data as the rating value of unrated data. It is possible simultaneously to reduce sparsity and to improve accuracy by calculating prediction through an analysis of the characteristics of an item. Also, it is possible to conduct a quick classification based on the analyzed information once a new item and a user are registered. The experiment result indicated that the proposed method has been more enhanced the accuracy, compared to item based, genre based methods.

An Improved Personalized Recommendation Technique for E-Commerce Portal (E-Commerce 포탈에서 향상된 개인화 추천 기법)

  • Ko, Pyung-Kwan;Ahmed, Shekel;Kim, Young-Kuk;Kamg, Sang-Gil
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.9
    • /
    • pp.835-840
    • /
    • 2008
  • This paper proposes an enhanced recommendation technique for personalized e-commerce portal analyzing various attitudes of customer. The attitudes are classifies into three types such as "purchasing product", "adding product to shopping cart", and "viewing the product information". We implicitly track customer attitude to estimate the rating of products for recommending products. We classified user groups which have similar preference for each item using implicit user behavior. The preference similarity is estimated using the Cross Correlation Coefficient. Our recommendation technique shows a high degree of accuracy as we use age and gender to group the customers with similar preference. In the experimental section, we show that our method can provide better performance than other traditional recommender system in terms of accuracy.

A Movie Recommendation Method Using Rating Difference Between Items (항목 간 선호도 차이를 이용한 영화 추천 방법)

  • Oh, Se-Chang;Choi, Min
    • 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.

Personalized Recommendation based on Context-Aware for Resource Sharing in Ubiquitous Environments (유비쿼터스 환경에서 자원 공유를 위한 상황인지 기반 개인화 추천)

  • Park, Jong-Hyun;Kang, Ji-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.9
    • /
    • pp.19-26
    • /
    • 2011
  • Users want to receive customized service using users' personal device. To fulfill this requirement, the mobile device has to support a lot of functions. However, the mobile device has limitations such as tiny display screens. To solve this limitation problem and provide customized service to users, this paper proposes the environment to provide services by sharing resources and the method to recommend user-suitable resources among sharable resources. For the resource recommendation, This paper analyzes user's behavior pattern from usage history and proposes the method for recommending customized resources. This paper also shows that the approach is reasonable one for resource recommendation through the satisfaction evaluation.

Using Genre Rating Information for Similarity Estimation in Collaborative Filtering

  • Lee, Soojung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.12
    • /
    • pp.93-100
    • /
    • 2019
  • Similarity computation is very crucial to performance of memory-based collaborative filtering systems. These systems make use of user ratings to recommend products to customers in online commercial sites. For better recommendation, most similar users to the active user need to be selected for their references. There have been numerous similarity measures developed in literature, most of which suffer from data sparsity or cold start problems. This paper intends to extract preference information as much as possible from user ratings to compute more reliable similarity even in a sparse data condition, as compared to previous similarity measures. We propose a new similarity measure which relies not only on user ratings but also on movie genre information provided by the dataset. Performance experiments of the proposed measure and previous relevant measures are conducted to investigate their performance. As a result, it is found that the proposed measure yields better or comparable achievements in terms of major performance metrics.