• Title/Summary/Keyword: Preference Clustering

Search Result 79, Processing Time 0.026 seconds

The Effect of Bias in Data Set for Conceptual Clustering Algorithms

  • Lee, Gye Sung
    • International journal of advanced smart convergence
    • /
    • v.8 no.3
    • /
    • pp.46-53
    • /
    • 2019
  • When a partitioned structure is derived from a data set using a clustering algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of data. This problem is known as the order bias problem. Many algorithms in machine learning fields try to achieve optimized result from available training and test data. Optimization is determined by an evaluation function which has also a tendency toward a certain goal. It is inevitable to have a tendency in the evaluation function both for efficiency and for consistency in the result. But its preference for a specific goal in the evaluation function may sometimes lead to unfavorable consequences in the final result of the clustering. To overcome this bias problems, the first clustering process proceeds to construct an initial partition. The initial partition is expected to imply the possible range in the number of final clusters. We apply the data centric sorting to the data objects in the clusters of the partition to rearrange them in a new order. The same clustering procedure is reapplied to the newly arranged data set to build a new partition. We have developed an algorithm that reduces bias effect resulting from how data is fed into the algorithm. Experiment results have been presented to show that the algorithm helps minimize the order bias effects. We have also shown that the current evaluation measure used for the clustering algorithm is biased toward favoring a smaller number of clusters and a larger size of clusters as a result.

Performance Improvement of Collaborative Filtering System Using Associative User′s Clustering Analysis for the Recalculation of Preference and Representative Attribute-Neighborhood (선호도 재계산을 위한 연관 사용자 군집 분석과 Representative Attribute -Neighborhood를 이용한 협력적 필터링 시스템의 성능향상)

  • Jung, Kyung-Yong;Kim, Jin-Su;Kim, Tae-Yong;Lee, Jung-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.10B no.3
    • /
    • pp.287-296
    • /
    • 2003
  • There has been much research focused on collaborative filtering technique in Recommender System. However, these studies have shown the First-Rater Problem and the Sparsity Problem. The main purpose of this Paper is to solve these Problems. In this Paper, we suggest the user's predicting preference method using Bayesian estimated value and the associative user clustering for the recalculation of preference. In addition to this method, to complement a shortcoming, which doesn't regard the attribution of item, we use Representative Attribute-Neighborhood method that is used for the prediction when we find the similar neighborhood through extracting the representative attribution, which most affect the preference. We improved the efficiency by using the associative user's clustering analysis in order to calculate the preference of specific item within the cluster item vector to the collaborative filtering algorithm. Besides, for the problem of the Sparsity and First-Rater, through using Association Rule Hypergraph Partitioning algorithm associative users are clustered according to the genre. New users are classified into one of these genres by Naive Bayes classifier. In addition, in order to get the similarity value between users belonged to the classified genre and new users, and this paper allows the different estimated value to item which user evaluated through Naive Bayes learning. As applying the preference granted the estimated value to Pearson correlation coefficient, it can make the higher accuracy because the errors that cause the missing value come less. We evaluate our method on a large collaborative filtering database of user rating and it significantly outperforms previous proposed method.

Image recommendation algorithm based on profile using user preference and visual descriptor (사용자 선호도와 시각적 기술자를 이용한 사용자 프로파일 기반 이미지 추천 알고리즘)

  • Kim, Deok-Hwan;Yang, Jun-Sik;Cho, Won-Hee
    • The KIPS Transactions:PartD
    • /
    • v.15D no.4
    • /
    • pp.463-474
    • /
    • 2008
  • The advancement of information technology and the popularization of Internet has explosively increased the amount of multimedia contents. Therefore, the requirement of multimedia recommendation to satisfy a user's needs increases fastly. Up to now, CF is used to recommend general items and multimedia contents. However, general CF doesn't reflect visual characteristics of image contents so that it can't be adaptable to image recommendation. Besides, it has limitations in new item recommendation, the sparsity problem, and dynamic change of user preference. In this paper, we present new image recommendation method FBCF (Feature Based Collaborative Filtering) to resolve such problems. FBCF builds new user profile by clustering visual features in terms of user preference, and reflects user's current preference to recommendation by using preference feedback. Experimental result using real mobile images demonstrate that FBCF outperforms conventional CF by 400% in terms of recommendation ratio.

Clustering-Based Recommendation Using Users' Preference (사용자 선호도를 사용한 군집 기반 추천 시스템)

  • Kim, Younghyun;Shin, Won-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.2
    • /
    • pp.277-284
    • /
    • 2017
  • In a flood of information, most users will want to get a proper recommendation. If a recommender system fails to give appropriate contents, then quality of experience (QoE) will be drastically decreased. In this paper, we propose a recommender system based on the intra-cluster users' item preference for improving recommendation accuracy indices such as precision, recall, and F1 score. To this end, first, users are divided into several clusters based on the actual rating data and Pearson correlation coefficient (PCC). Afterwards, we give each item an advantage/disadvantage according to the preference tendency by users within the same cluster. Specifically, an item will be received an advantage/disadvantage when the item which has been averagely rated by other users within the same cluster is above/below a predefined threshold. The proposed algorithm shows a statistically significant performance improvement over the item-based collaborative filtering algorithm with no clustering in terms of recommendation accuracy indices such as precision, recall, and F1 score.

Clustering and Recommendation for Semantic Web Service in Time Series

  • Yu, Lei;Wang, Zhili;Meng, Luoming;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.8
    • /
    • pp.2743-2762
    • /
    • 2014
  • Promoted by cloud technology and new websites, plenty and variety of Web services are emerging in the Internet. Meanwhile some Web services become outdated even obsolete due to new versions, and a normal phenomenon is that some services work well only with other services of older versions. These laggard or improper services are lowering the performance of the composite service they involved in. In addition, using current technology to identify proper semantic services for a composite service is time-consuming and inaccurate. Thus, we proposed a clustering method and a recommendation method to deal with these problems. Clustering technology is used to classify semantic services according to their topics, functionality and other aspects from plenty of services. Recommendation technology is used to predict the possible preference of a composite service, and recommend possible component services to the composite service according to the history information of invocations and similar composite services. The experiments show that our clustering method with the help of Ontology and TF/IDF technology is more accurate than others, and our recommendation method has less average error than others in the series of missing rate.

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.

Effect of Fatty Acid Profiles on Sensory Properties of Beef Evaluated by Korean and Australian Consumer Group

  • Cho, S.H.;Park, B.Y.;Kim, J.H.;Hwang, I.H.;Kim, D.H.;Kim, Y.K.;Lee, J.M.
    • Proceedings of the Korean Society for Food Science of Animal Resources Conference
    • /
    • 2004.10a
    • /
    • pp.301-304
    • /
    • 2004
  • Total contents of fatty acid compositions such as SFA, MUFA, and PUFA affected the beef preference more for Korean consumers than for Australian consumers while most of fatty acids had no relationship with the beef preference for Australian consumers. Although variations in the absolute concentration and in the relative proportions of different fatty acids would affect the flavor profile, the effect of fatty acids on the preference for clustering depended more on consumer groups than on beef origin.

  • PDF

A method for learning users' preference on fuzzy values using neural networks and k-means clustering (신경망과 k-means 클러스터링을 이용한 사용자의 퍼지값 선호도 학습 방법)

  • Yoon, Tae-Bok;Na, Hyun-Jong;Park, Doo-Kyung;Lee, Jee-Hyong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.6
    • /
    • pp.716-720
    • /
    • 2006
  • Fuzzy sets are good for abstracting and unifying information using natural language like terms. However, fuzzy sets embody vagueness and users may have different attitude to the vagueness, each user may choose difference one as the best among several fuzzy values. In this paper, we develop a method teaming a user's, preference on fuzzy values and select one which fits to his preference. Users' preferences are modeled with artificial neural networks. We gather learning data from users by asking to choose the best from two fuzzy values in several representative cases of comparing two fuzzy sets. In order to establish tile representative comparing cases, we enumerate more than 600 cases and cluster them into several groups. Neural networks ate trained with the users' answer and the given two fuzzy values in each case. Experiments show that the proposed method produces outputs closet to users' preference than other methods.

Preference Differences in Interior Images of Restaurants according to Lifestyles (라이프스타일 유형에 따른 레스토랑 실내이미지 선호도 차이에 관한 연구)

  • Kim, Tae-Hee;Park, Young-Seok
    • Journal of the Korean Home Economics Association
    • /
    • v.43 no.10 s.212
    • /
    • pp.69-79
    • /
    • 2005
  • The purpose of this study was to determine restaurant patrons' preference differences in interior design style of restaurants according to their lifestyles. Written questionnaires were handed out to 500 adults in Seoul and surroundings and the results were sampled by convenience sampling. The questionnaire was composed of respondents' general characteristics, lifestyles, and preference for 10 types of interior design style. A total of 415 questionnaires were usable for data analysis, resulting in a response rate of $83\%$. To analyze the collected data, frequency, factor, reliability, quick clustering K- means and One-Way ANOVA analysis were conducted using SPSS 10.0. The results showed that there were preference differences in 10 types of interior design style of restaurants according to lifestyle types which were categorized into 4 groups. The conservative and self-convinced group showed the lowest preference scores in the 10 types of interior design style which are Romantic, Ethnic, Classic, High-Tech, Elegant, Country, Modem, Minimal, Natural, and Casual style. The quality life pursuing group and extroverted individuality groups showed the high preference scores in most of the styles, especially in the Classic and Elegant styles. The realistic self-centered group showed the highest preference scores in Casual style among the 4 groups. These study findings indicate that restaurants should take into account their patrons' lifestyles as a mean of market segmentation, and respond to their taste and preference when they have established suitable servicescape.

GGenre Pattern based User Clustering for Performance Improvement of Collaborative Filtering System (협업적 여과 시스템의 성능 향상을 위한 장르 패턴 기반 사용자 클러스터링)

  • Choi, Ja-Hyun;Ha, In-Ay;Hong, Myung-Duk;Jo, Geun-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.17-24
    • /
    • 2011
  • Collaborative filtering system is the clustering about user is built and then based on that clustering results will recommend the preferred item to the user. However, building user clustering is time consuming and also once the users evaluate and give feedback about the film then rebuilding the system is not simple. In this paper, genre pattern of movie recommendation systems is being used and in order to simplify and reduce time of rebuilding user clustering. A Frequent pattern networks is used and then extracts user preference genre patterns and through that extracted patterns user clustering will be built. Through built the clustering for all neighboring users to collaborative filtering is applied and then recommends movies to the user. When receiving user information feedback, traditional collaborative filtering is to rebuild the clustering for all neighbouring users to research and do the clustering. However by using frequent pattern Networks, through user clustering based on genre pattern, collaborative filtering is applied and when rebuilding user clustering inquiry limited by search time can be reduced. After receiving user information feedback through proposed user clustering based on genre pattern, the time that need to spent on re-establishing user clustering can be reduced and also enable the possibility of traditional collaborative filtering systems and recommendation of a similar performance.