• Title/Summary/Keyword: Preference Matrix

Search Result 70, Processing Time 0.024 seconds

Hybrid Structural Control System Design Using Preference-Based Optimization (선호도 기반 최적화 방법을 사용한 복합 구조 제어 시스템 설계)

  • Park, Won-Suk;Park, Kwan-Soon;Koh, Hyun-Moo
    • Proceedings of the Earthquake Engineering Society of Korea Conference
    • /
    • 2006.03a
    • /
    • pp.401-408
    • /
    • 2006
  • An optimum design method for hybrid control systems is proposed in this study. By considering both active and passive control systems as a combined or a hybrid system, the optimization of the hybrid system can be achieved simultaneously. In the proposed approach, we consider design parameters of active control devices and the elements of the feedback gain matrix as design variables for the active control system. Required quantity of the added dampers are also treated as design variables for the passive control system. In the proposed method, the cost of both active and passive control devices, the required control efforts and dynamic responses of a target structure are selected as objective functions to be minimized. To effectively address the multi-objective optimization problem, we adopt a preference-based optimization model and apply a genetic algorithm as a numerical searching technique. As an example to verify the validity of the proposed optimization technique, a wind-excited 20-storey building with hybrid control systems is used and the results are presented.

  • PDF

Handling Incomplete Data Problem in Collaborative Filtering System

  • Noh, Hyun-ju;Kwak, Min-jung;Han, In-goo
    • Proceedings of the KAIS Fall Conference
    • /
    • 2003.11a
    • /
    • pp.105-110
    • /
    • 2003
  • Collaborative filtering is one of the methodologies that are most widely used for recommendation system. It is based on a data matrix of each customer's preferences of products. There could be a lot of missing values in such preference. data matrix. This incomplete data is one of the reasons to deteriorate the accuracy of recommendation system. Multiple imputation method imputes m values for each missing value. It overcomes flaws of single imputation approaches through considering the uncertainty of missing values.. The objective of this paper is to suggest multiple imputation-based collaborative filtering approach for recommendation system to improve the accuracy in prediction performance. The experimental works show that the proposed approach provides better performance than the traditional Collaborative filtering approach, especially in case that there are a lot of missing values in dataset used for recommendation system.

  • PDF

Compare to Factorization Machines Learning and High-order Factorization Machines Learning for Recommend system (추천시스템에 활용되는 Matrix Factorization 중 FM과 HOFM의 비교)

  • Cho, Seong-Eun
    • Journal of Digital Contents Society
    • /
    • v.19 no.4
    • /
    • pp.731-737
    • /
    • 2018
  • The recommendation system is actively researched for the purpose of suggesting information that users may be interested in in many fields such as contents, online commerce, social network, advertisement system, and the like. However, there are many recommendation systems that propose based on past preference data, and it is difficult to provide users with little or no data in the past. Therefore, interest in higher-order data analysis is increasing and Matrix Factorization is attracting attention. In this paper, we study and propose a comparison and replay of the Factorization Machines Leaning(FM) model which is attracting attention in the recommendation system and High-Order Factorization Machines Learning(HOFM) which is a high - dimensional data analysis.

Study on Tag, Trust and Probability Matrix Factorization Based Social Network Recommendation

  • Liu, Zhigang;Zhong, Haidong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2082-2102
    • /
    • 2018
  • In recent years, social network related applications such as WeChat, Facebook, Twitter and so on, have attracted hundreds of millions of people to share their experience, plan or organize, and attend social events with friends. In these operations, plenty of valuable information is accumulated, which makes an innovative approach to explore users' preference and overcome challenges in traditional recommender systems. Based on the study of the existing social network recommendation methods, we find there is an abundant information that can be incorporated into probability matrix factorization (PMF) model to handle challenges such as data sparsity in many recommender systems. Therefore, the research put forward a unified social network recommendation framework that combine tags, trust between users, ratings with PMF. The uniformed method is based on three existing recommendation models (SoRecUser, SoRecItem and SoRec), and the complexity analysis indicates that our approach has good effectiveness and can be applied to large-scale datasets. Furthermore, experimental results on publicly available Last.fm dataset show that our method outperforms the existing state-of-art social network recommendation approaches, measured by MAE and MRSE in different data sparse conditions.

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.

Movie Recommendation Using Co-Clustering by Infinite Relational Models (Infinite Relational Model 기반 Co-Clustering을 이용한 영화 추천)

  • Kim, Byoung-Hee;Zhang, Byoung-Tak
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.4
    • /
    • pp.443-449
    • /
    • 2014
  • Preferences of users on movies are observables of various factors that are related with user attributes and movie features. For movie recommendation, analysis methods for relation among users, movies, and preference patterns are mandatory. As a relational analysis tool, we focus on the Infinite Relational Model (IRM) which was introduced as a tool for multiple concept search. We show that IRM-based co-clustering on preference patterns and movie descriptors can be used as the first tool for movie recommender methods, especially content-based filtering approaches. By introducing a set of well-defined tag sets for movies and doing three-way co-clustering on a movie-rating matrix and a movie-tag matrix, we discovered various explainable relations among users and movies. We suggest various usages of IRM-based co-clustering, espcially, for incremental and dynamic recommender systems.

Analysis of Market Share using Brand Switching Matrix in the Korean Mobile Market (상표전환행렬을 이용한 이동통신 시장점유율 분석)

  • Seong, Gi Seong;Kang, Man Su;Suk, Yeung Ki
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.6
    • /
    • pp.385-396
    • /
    • 2014
  • In the Korean mobile market, the mobile phone has reach the stage of maturity in terms of demand. Since the long-term evolution(LTE) service was introduced in 2011, there have been drastic changes in the market structure. The purpose of this paper is to examine the user intension of brand switching, to analyse the market share among 3 major mobile service companies using the brand switching matrix and to provide some insights. The results show that the smartphone subscriber rate provided by Ministry of Science, lCT and Future Planning agrees with the market share by brand switching matrix of this study. The potential rate of costumer retention would be arranges in order of SKT>KT>LGU+. The preference of mobile service company on switch be in order of SKT>KT>LGU+. The future market share be SKT 63.55%, KT 21.99%, LGU+ 14.36%. The potential rate of costumer retention fell sharply over the past year, suggesting the drastic fluctuations in market share for a while.

Increasing Accuracy of Classifying Useful Reviews by Removing Neutral Terms (중립도 기반 선택적 단어 제거를 통한 유용 리뷰 분류 정확도 향상 방안)

  • Lee, Minsik;Lee, Hong Joo
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.3
    • /
    • pp.129-142
    • /
    • 2016
  • Customer product reviews have become one of the important factors for purchase decision makings. Customers believe that reviews written by others who have already had an experience with the product offer more reliable information than that provided by sellers. However, there are too many products and reviews, the advantage of e-commerce can be overwhelmed by increasing search costs. Reading all of the reviews to find out the pros and cons of a certain product can be exhausting. To help users find the most useful information about products without much difficulty, e-commerce companies try to provide various ways for customers to write and rate product reviews. To assist potential customers, online stores have devised various ways to provide useful customer reviews. Different methods have been developed to classify and recommend useful reviews to customers, primarily using feedback provided by customers about the helpfulness of reviews. Most shopping websites provide customer reviews and offer the following information: the average preference of a product, the number of customers who have participated in preference voting, and preference distribution. Most information on the helpfulness of product reviews is collected through a voting system. Amazon.com asks customers whether a review on a certain product is helpful, and it places the most helpful favorable and the most helpful critical review at the top of the list of product reviews. Some companies also predict the usefulness of a review based on certain attributes including length, author(s), and the words used, publishing only reviews that are likely to be useful. Text mining approaches have been used for classifying useful reviews in advance. To apply a text mining approach based on all reviews for a product, we need to build a term-document matrix. We have to extract all words from reviews and build a matrix with the number of occurrences of a term in a review. Since there are many reviews, the size of term-document matrix is so large. It caused difficulties to apply text mining algorithms with the large term-document matrix. Thus, researchers need to delete some terms in terms of sparsity since sparse words have little effects on classifications or predictions. The purpose of this study is to suggest a better way of building term-document matrix by deleting useless terms for review classification. In this study, we propose neutrality index to select words to be deleted. Many words still appear in both classifications - useful and not useful - and these words have little or negative effects on classification performances. Thus, we defined these words as neutral terms and deleted neutral terms which are appeared in both classifications similarly. After deleting sparse words, we selected words to be deleted in terms of neutrality. We tested our approach with Amazon.com's review data from five different product categories: Cellphones & Accessories, Movies & TV program, Automotive, CDs & Vinyl, Clothing, Shoes & Jewelry. We used reviews which got greater than four votes by users and 60% of the ratio of useful votes among total votes is the threshold to classify useful and not-useful reviews. We randomly selected 1,500 useful reviews and 1,500 not-useful reviews for each product category. And then we applied Information Gain and Support Vector Machine algorithms to classify the reviews and compared the classification performances in terms of precision, recall, and F-measure. Though the performances vary according to product categories and data sets, deleting terms with sparsity and neutrality showed the best performances in terms of F-measure for the two classification algorithms. However, deleting terms with sparsity only showed the best performances in terms of Recall for Information Gain and using all terms showed the best performances in terms of precision for SVM. Thus, it needs to be careful for selecting term deleting methods and classification algorithms based on data sets.

On Multiple Comparison of Geometric Means of Exponential Parameters via Graphical Model (그래프 모형을 이용한 지수분포 모수들의 기하평균 비교에 관한 연구)

  • Kim, Dae-Hwang;Kim, Hea-Jung
    • The Korean Journal of Applied Statistics
    • /
    • v.19 no.3
    • /
    • pp.447-460
    • /
    • 2006
  • This paper develops a multiple comparison method for finding an optimal ordering of K geometric means of exponential parameters. This is based on the paired comparison experimental arrangement whose results can naturally be represented by a completely oriented graph. Introducing posterior preference probabilities and stochastic transitivity conditions to the graph, we obtain a new graphical model that yields criteria for the optimal ordering in the multiple comparison. Necessary theories involved in the method and some computational aspects are provided. Some numerical examples are given to illustrate the efficiency of the suggested method.

Weighted Markov Model for Recommending Personalized Broadcasting Contents (개인화된 방송 컨텐츠 추천을 위한 가중치 적용 Markov 모델)

  • Park, Sung-Joon;Hong, Jong-Kyu;Kang, Sang-Gil;Kim, Young-Kuk
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.12 no.5
    • /
    • pp.326-338
    • /
    • 2006
  • In this paper, we propose the weighted Markov model for recommending the users' prefered contents in the environment with considering the users' transition of their content consumption mind according to the kind of contents providing in time. In general, TV viewers have an intention to consume again the preferred contents consumed in recent by them. In order to take into the consideration, we modify the preference transition matrix by providing weights to the consecutively consumed contents for recommending the users' preferred contents. We applied the proposed model to the recommendation of TV viewer's genre preference. The experimental result shows that our method is more efficient than the typical methods.