• Title/Summary/Keyword: Preference Prediction

Search Result 118, Processing Time 0.022 seconds

A Study on the Real-Time Preference Prediction for Personalized Recommendation on the Mobile Device (모바일 기기에서 개인화 추천을 위한 실시간 선호도 예측 방법에 대한 연구)

  • Lee, Hak Min;Um, Jong Seok
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.336-343
    • /
    • 2017
  • We propose a real time personalized recommendation algorithm on the mobile device. We use a unified collaborative filtering with reduced data. We use Fuzzy C-means clustering to obtain the reduced data and Konohen SOM is applied to get initial values of the cluster centers. The proposed algorithm overcomes data sparsity since it extends data to the similar users and similar items. Also, it enables real time service on the mobile device since it reduces computing time by data clustering. Applying the suggested algorithm to the MovieLens data, we show that the suggested algorithm has reasonable performance in comparison with collaborative filtering. We developed Android-based smart-phone application, which recommends restaurants with coupons and restaurant information.

Accuracy improvement of a collaborative filtering recommender system using attribute of age (목표고객의 연령속성을 이용한 협력적 필터링 추천 시스템의 정확도 향상)

  • Lee, Seog-Hwan;Park, Seung-Hun
    • Journal of the Korea Safety Management & Science
    • /
    • v.13 no.2
    • /
    • pp.169-177
    • /
    • 2011
  • In this paper, the author devised new decision recommendation ordering method of items attributed by age to improve accuracy of recommender system. In conventional recommendation system, recommendation order is decided by high order of preference prediction. However, in this paper, recommendation accuracy is improved by decision recommendation order method that reflect age attribute of target customer and neighborhood in preference prediction. By applying decision recommendation order method to recommender system, recommendation accuracy is improved more than conventional ordering method of recommendation.

Pre-Evaluation for Detecting Abnormal Users in Recommender System

  • Lee, Seok-Jun;Kim, Sun-Ok;Lee, Hee-Choon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.18 no.3
    • /
    • pp.619-628
    • /
    • 2007
  • This study is devoted to suggesting the norm of detection abnormal users who are inferior to the other users in the recommender system compared with estimation accuracy. To select the abnormal users, we propose the pre-filtering method by using the preference ratings to the item rated by users. In this study, the experimental result shows the possibility of detecting the abnormal users before the process of preference estimation through the prediction algorithm. And It will be possible to improve the performance of the recommender system by using this detecting norm.

  • PDF

A Combined Forecast Scheme of User-Based and Item-based Collaborative Filtering Using Neighborhood Size (이웃크기를 이용한 사용자기반과 아이템기반 협업여과의 결합예측 기법)

  • Choi, In-Bok;Lee, Jae-Dong
    • The KIPS Transactions:PartB
    • /
    • v.16B no.1
    • /
    • pp.55-62
    • /
    • 2009
  • Collaborative filtering is a popular technique that recommends items based on the opinions of other people in recommender systems. Memory-based collaborative filtering which uses user database can be divided in user-based approaches and item-based approaches. User-based collaborative filtering predicts a user's preference of an item using the preferences of similar neighborhood, while item-based collaborative filtering predicts the preference of an item based on the similarity of items. This paper proposes a combined forecast scheme that predicts the preference of a user to an item by combining user-based prediction and item-based prediction using the ratio of the number of similar users and the number of similar items. Experimental results using MovieLens data set and the BookCrossing data set show that the proposed scheme improves the accuracy of prediction for movies and books compared with the user-based scheme and item-based scheme.

Vehicle Stop and Go Cruise Control using a Vehicle Trajectory Prediction Method (차량 궤적 예측기법을 이용한 차량 정지/서행 순항 제어)

  • 조상민;이경수
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.10 no.5
    • /
    • pp.206-213
    • /
    • 2002
  • This paper proposes a vehicle trajectory prediction method for application to vehicle-to-vehicle distance control. This method is based on 2-dimensional kinematics and a Kalman filter has been used to estimate acceleration of the object vehicle. The simulation results using the proposed control method show that the relative distance characteristics can be improved via the trajectory prediction method compared to the customary vehicle stop and go cruise control systems which makes the vehicle remain at a safe distance from a preceding vehicle according to the driver's preference, automatically slow down and come to a full stop behind a preceding vehicle.

Study on Collaborative Filtering Algorithm Considering Temporal Variation of User Preference (사용자 성향의 시간적 변화를 고려한 협업 필터링 알고리즘에 관한 연구)

  • Park, Young-Yong;Lee, Hak-Sung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.5
    • /
    • pp.526-529
    • /
    • 2003
  • Recommender systems or collaborative filtering are methods to identify potentially interesting or valuable items to a particular user Under the assumption that people with similar interest tend to like the similar types of items, these methods use a database on the preference of a set of users and predict the rating on the items that the user has not rated. Usually the preference of a particular user is liable to vary with time and this temporal variation may cause an inaccurate identification and prediction. In this paper we propose a method to adapt the temporal variation of the user preference in order to improve the predictive performance of a collaborative filtering algorithm. To be more specific, the correlation weight of the GroupLens system which is a general formulation of statistical collaborative filtering algorithm is modified to reflect only recent similarity between two user. The proposed method is evaluated for EachMovie dataset and shows much better prediction results compared with GrouPLens system.

Basic Research on the Possibility of Developing a Landscape Perceptual Response Prediction Model Using Artificial Intelligence - Focusing on Machine Learning Techniques - (인공지능을 활용한 경관 지각반응 예측모델 개발 가능성 기초연구 - 머신러닝 기법을 중심으로 -)

  • Kim, Jin-Pyo;Suh, Joo-Hwan
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.51 no.3
    • /
    • pp.70-82
    • /
    • 2023
  • The recent surge of IT and data acquisition is shifting the paradigm in all aspects of life, and these advances are also affecting academic fields. Research topics and methods are being improved through academic exchange and connections. In particular, data-based research methods are employed in various academic fields, including landscape architecture, where continuous research is needed. Therefore, this study aims to investigate the possibility of developing a landscape preference evaluation and prediction model using machine learning, a branch of Artificial Intelligence, reflecting the current situation. To achieve the goal of this study, machine learning techniques were applied to the landscaping field to build a landscape preference evaluation and prediction model to verify the simulation accuracy of the model. For this, wind power facility landscape images, recently attracting attention as a renewable energy source, were selected as the research objects. For analysis, images of the wind power facility landscapes were collected using web crawling techniques, and an analysis dataset was built. Orange version 3.33, a program from the University of Ljubljana was used for machine learning analysis to derive a prediction model with excellent performance. IA model that integrates the evaluation criteria of machine learning and a separate model structure for the evaluation criteria were used to generate a model using kNN, SVM, Random Forest, Logistic Regression, and Neural Network algorithms suitable for machine learning classification models. The performance evaluation of the generated models was conducted to derive the most suitable prediction model. The prediction model derived in this study separately evaluates three evaluation criteria, including classification by type of landscape, classification by distance between landscape and target, and classification by preference, and then synthesizes and predicts results. As a result of the study, a prediction model with a high accuracy of 0.986 for the evaluation criterion according to the type of landscape, 0.973 for the evaluation criterion according to the distance, and 0.952 for the evaluation criterion according to the preference was developed, and it can be seen that the verification process through the evaluation of data prediction results exceeds the required performance value of the model. As an experimental attempt to investigate the possibility of developing a prediction model using machine learning in landscape-related research, this study was able to confirm the possibility of creating a high-performance prediction model by building a data set through the collection and refinement of image data and subsequently utilizing it in landscape-related research fields. Based on the results, implications, and limitations of this study, it is believed that it is possible to develop various types of landscape prediction models, including wind power facility natural, and cultural landscapes. Machine learning techniques can be more useful and valuable in the field of landscape architecture by exploring and applying research methods appropriate to the topic, reducing the time of data classification through the study of a model that classifies images according to landscape types or analyzing the importance of landscape planning factors through the analysis of landscape prediction factors using machine learning.

A Split Criterion for Binary Decision Trees

  • Choi, Hyun Jip;Oh, Myong Rok
    • Communications for Statistical Applications and Methods
    • /
    • v.9 no.2
    • /
    • pp.411-423
    • /
    • 2002
  • In this paper, we propose a split criterion for binary decision trees. The proposed criterion selects the optimal split by measuring the prediction success of the candidate splits at a given node. The criterion is shown to have the property of exclusive preference. Examples are given to demonstrate the properties of the criterion.

Scalable Collaborative Filtering Technique based on Adaptive Clustering (적응형 군집화 기반 확장 용이한 협업 필터링 기법)

  • Lee, O-Joun;Hong, Min-Sung;Lee, Won-Jin;Lee, Jae-Dong
    • 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.

A sequential pattern analysis for dynamic discovery of customers' preference (고객의 동적 선호 탐색을 위한 순차패턴 분석 : (주)더페이스샵 사례)

  • Song, Ki-Ryong;Noh, Soeng-Ho;Lee, Jae-Kwang;Choi, Il-Young;Kim, Jae-Kyeong
    • 한국경영정보학회:학술대회논문집
    • /
    • 2008.06a
    • /
    • pp.153-170
    • /
    • 2008
  • Customers' needs change every moment. Profitability of stores can't be increased anymore with an existing standardized chain store management. Accordingly, a personalized store management tool needs through prediction of customers' preference. In this study, we propose a recommending procedure using dynamic customers' preference by analyzing the transaction database. We utilize self-organizing map algorithm and association rule mining which are applied to cluster the chain stores and explore purchase sequence of customers. We demonstrate that the proposed methodology makes an effect on recommendation of products in the market which is characterized by a fast fashion and a short product life cycle.

  • PDF