FCM分类器的三元组

H. Ichihashi, A. Notsu, Katsuhiro Honda
{"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}
引用次数: 6

摘要

本文提出了基于模糊c均值的分类器(FCMC)的一个附加版本。分类器fmc - r处理关系数据而不是对象数据。fcmc使用协方差结构来表示簇的灵活形状。尽管协方差矩阵的计算量很大,但对高维特征数据进行分类是一个障碍。为了解决这个问题,我们提出了一种直接处理高维数据的方法,即FCMC-H。FCM分类器的第三种类型是关系分类器fmc - r,它是由fmc - h衍生而来的。由关系矩阵表示的关系数据基于对象数据之间的不相似性或距离。当特征向量的维数不是很高,差异用欧氏距离表示时,FCMC、fmc - h和fmc - r这三个三元组是等价的。FCMC在UCI存储库对象数据集上的随机测试集性能与支持向量机(SVM)分类器相当。比较了三元组在100次三路数据分割(3-WDS)过程中的性能。三元组优于k近邻(k-NN)分类器,k-NN是一种建立良好且非常流行的关系分类器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Triplet of FCM classifiers
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信