构建决策聚类分类器的聚类模糊k均值方法

Yanfeng Zhang, Xiaofei Xu, Yingqun Liu, Xutao Li, Yunming Ye
{"title":"构建决策聚类分类器的聚类模糊k均值方法","authors":"Yanfeng Zhang, Xiaofei Xu, Yingqun Liu, Xutao Li, Yunming Ye","doi":"10.1109/IBICA.2011.99","DOIUrl":null,"url":null,"abstract":"Classification is an important task in machine learning and data mining. Lots of classification models have been proposed based on different theories and assumptions. Several researchers have proposed to build classifiers by using a sequence of nested clusterings based on the assumption that if objects are spatially close to one another in data space, they tend to have the same categorical label. In this paper, we pro- pose to build such classifiers by using the agglomerative fuzzy k-means because of its three good properties: (1) the clustering algorithm is insensitive to initial centers; (2) the algorithm can automatically determine the number of clusters combined with cluster validation techniques; (3) the algorithm can control the density level of clusters identified. The comparison experiments with traditional classifiers on benchmark data sets from UCI Machine Learning Repository have shown the effectiveness of our proposed approach.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An Agglomerative Fuzzy K-means Approach to Building Decision Cluster Classifiers\",\"authors\":\"Yanfeng Zhang, Xiaofei Xu, Yingqun Liu, Xutao Li, Yunming Ye\",\"doi\":\"10.1109/IBICA.2011.99\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Classification is an important task in machine learning and data mining. Lots of classification models have been proposed based on different theories and assumptions. Several researchers have proposed to build classifiers by using a sequence of nested clusterings based on the assumption that if objects are spatially close to one another in data space, they tend to have the same categorical label. In this paper, we pro- pose to build such classifiers by using the agglomerative fuzzy k-means because of its three good properties: (1) the clustering algorithm is insensitive to initial centers; (2) the algorithm can automatically determine the number of clusters combined with cluster validation techniques; (3) the algorithm can control the density level of clusters identified. The comparison experiments with traditional classifiers on benchmark data sets from UCI Machine Learning Repository have shown the effectiveness of our proposed approach.\",\"PeriodicalId\":158080,\"journal\":{\"name\":\"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IBICA.2011.99\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IBICA.2011.99","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

分类是机器学习和数据挖掘中的一项重要任务。基于不同的理论和假设,提出了许多分类模型。一些研究人员已经提出使用一系列嵌套聚类来构建分类器,这些聚类基于这样的假设:如果对象在数据空间中空间上彼此接近,那么它们往往具有相同的分类标签。本文提出用聚类模糊k-均值方法来构建这类分类器,因为聚类算法具有以下三个优点:(1)聚类算法对初始中心不敏感;(2)该算法可结合聚类验证技术自动确定聚类数量;(3)该算法可以控制识别出的聚类的密度水平。在UCI机器学习库的基准数据集上与传统分类器的对比实验表明了我们提出的方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Agglomerative Fuzzy K-means Approach to Building Decision Cluster Classifiers
Classification is an important task in machine learning and data mining. Lots of classification models have been proposed based on different theories and assumptions. Several researchers have proposed to build classifiers by using a sequence of nested clusterings based on the assumption that if objects are spatially close to one another in data space, they tend to have the same categorical label. In this paper, we pro- pose to build such classifiers by using the agglomerative fuzzy k-means because of its three good properties: (1) the clustering algorithm is insensitive to initial centers; (2) the algorithm can automatically determine the number of clusters combined with cluster validation techniques; (3) the algorithm can control the density level of clusters identified. The comparison experiments with traditional classifiers on benchmark data sets from UCI Machine Learning Repository have shown the effectiveness of our proposed approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fighting Detection Based on Optical Flow Context Histogram Some Researches for Lorenz-Based Secure Communication in Time and Frequency Domains A Cognitive Model to Mimic an Aspect of Low Level Perception of Sound: Modelling Reverberation Perception by Statistical Signal Analysis The Sustained Exhilarating Cardiac Responses after Listening to the Very Fast and Complex Rhythm Smart Classroom Roll Caller System with IOT Architecture
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1