{"title":"FCM分类器的三元组","authors":"H. Ichihashi, A. Notsu, Katsuhiro Honda","doi":"10.1109/FUZZY.2009.5277336","DOIUrl":null,"url":null,"abstract":"This paper proposes an additional version of the fuzzy c-means based classifier (FCMC). The classifier FCMC-R treats relational data instead of object data. FCMCs use covariance structures to represent flexible shapes of clusters. Despite its effectiveness, the intense computation of covariance matrices is an impediment for classifying a set of high-dimensional feature data. In order to tackle with this problem, we proposed a way of directly handling high-dimensional data, i.e., FCMC-H. The third type of the FCM classifier is the relational classifier FCMC-R, which is derived from FCMC-H. The relational data represented by a relational matrix are based on dissimilarities or distances between object data. The triplets, i.e., FCMC, FCMC-H, and FCMC-R are equivalent when the dimensionality of feature vectors is not very high and the dissimilarity is represented by Euclidean distances. The randomized test set performance of FCMC on the sets of object data from UCI repository is comparable to that of the support vector machine (SVM) classifier. The performances of the triplet in terms of 100 times three way data splits (3-WDS) procedure are compared. The triplet surpasses the k-nearest neighbor (k-NN) classifier, which is a well established and very popular relational classifier.","PeriodicalId":117895,"journal":{"name":"2009 IEEE International Conference on Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Triplet of FCM classifiers\",\"authors\":\"H. Ichihashi, A. Notsu, Katsuhiro Honda\",\"doi\":\"10.1109/FUZZY.2009.5277336\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an additional version of the fuzzy c-means based classifier (FCMC). The classifier FCMC-R treats relational data instead of object data. FCMCs use covariance structures to represent flexible shapes of clusters. Despite its effectiveness, the intense computation of covariance matrices is an impediment for classifying a set of high-dimensional feature data. In order to tackle with this problem, we proposed a way of directly handling high-dimensional data, i.e., FCMC-H. The third type of the FCM classifier is the relational classifier FCMC-R, which is derived from FCMC-H. The relational data represented by a relational matrix are based on dissimilarities or distances between object data. The triplets, i.e., FCMC, FCMC-H, and FCMC-R are equivalent when the dimensionality of feature vectors is not very high and the dissimilarity is represented by Euclidean distances. The randomized test set performance of FCMC on the sets of object data from UCI repository is comparable to that of the support vector machine (SVM) classifier. The performances of the triplet in terms of 100 times three way data splits (3-WDS) procedure are compared. The triplet surpasses the k-nearest neighbor (k-NN) classifier, which is a well established and very popular relational classifier.\",\"PeriodicalId\":117895,\"journal\":{\"name\":\"2009 IEEE International Conference on Fuzzy Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Fuzzy Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FUZZY.2009.5277336\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Fuzzy Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FUZZY.2009.5277336","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper proposes an additional version of the fuzzy c-means based classifier (FCMC). The classifier FCMC-R treats relational data instead of object data. FCMCs use covariance structures to represent flexible shapes of clusters. Despite its effectiveness, the intense computation of covariance matrices is an impediment for classifying a set of high-dimensional feature data. In order to tackle with this problem, we proposed a way of directly handling high-dimensional data, i.e., FCMC-H. The third type of the FCM classifier is the relational classifier FCMC-R, which is derived from FCMC-H. The relational data represented by a relational matrix are based on dissimilarities or distances between object data. The triplets, i.e., FCMC, FCMC-H, and FCMC-R are equivalent when the dimensionality of feature vectors is not very high and the dissimilarity is represented by Euclidean distances. The randomized test set performance of FCMC on the sets of object data from UCI repository is comparable to that of the support vector machine (SVM) classifier. The performances of the triplet in terms of 100 times three way data splits (3-WDS) procedure are compared. The triplet surpasses the k-nearest neighbor (k-NN) classifier, which is a well established and very popular relational classifier.