A Discretization Algorithm of Continuous Attributes Based on Supervised Clustering

Haiyang Hua, Huaici Zhao
{"title":"A Discretization Algorithm of Continuous Attributes Based on Supervised Clustering","authors":"Haiyang Hua, Huaici Zhao","doi":"10.1109/CCPR.2009.5344142","DOIUrl":null,"url":null,"abstract":"Many machine learning algorithms can be applied only to data described by categorical attributes. So discretizatioti of continuous attributes is one of the important steps in preprocessing of extracting knowledge. Traditional discretization algorithms based on clustering need a pre-determined clustering number k, also typically are applied in an unsupervised learning framework. This paper describes such an algorithm, called SX-means (Supervised X-means), which is a new algorithm of supervised discretization of continuous attributes on clustering. The algorithm modifies clusters with knowledge of the class distribution dynamically. And this procedure can not stop until the proper k is found. For the number of clusters k is not pre-determined by the user and class distribution is applied, the random of result is decreased greatly. Experimental evaluation of several discretization algorithms on six artificial data sets show that the proposed algorithm is more efficient and can generate a better discretization schema. Comparing the output of C4.5, resulting tree is smaller, less classification rules, and high accuracy of classification.","PeriodicalId":354468,"journal":{"name":"2009 Chinese Conference on Pattern Recognition","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Chinese Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCPR.2009.5344142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Many machine learning algorithms can be applied only to data described by categorical attributes. So discretizatioti of continuous attributes is one of the important steps in preprocessing of extracting knowledge. Traditional discretization algorithms based on clustering need a pre-determined clustering number k, also typically are applied in an unsupervised learning framework. This paper describes such an algorithm, called SX-means (Supervised X-means), which is a new algorithm of supervised discretization of continuous attributes on clustering. The algorithm modifies clusters with knowledge of the class distribution dynamically. And this procedure can not stop until the proper k is found. For the number of clusters k is not pre-determined by the user and class distribution is applied, the random of result is decreased greatly. Experimental evaluation of several discretization algorithms on six artificial data sets show that the proposed algorithm is more efficient and can generate a better discretization schema. Comparing the output of C4.5, resulting tree is smaller, less classification rules, and high accuracy of classification.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于监督聚类的连续属性离散化算法
许多机器学习算法只能应用于由分类属性描述的数据。因此,连续属性的离散化是知识提取预处理的重要步骤之一。传统的基于聚类的离散化算法需要预先确定聚类数k,通常也应用于无监督学习框架。本文描述了这样一种算法,称为SX-means (Supervised X-means),它是一种对连续属性进行聚类监督离散化的新算法。该算法根据类分布的知识动态修改聚类。直到找到合适的k,这个过程才会停止。对于非用户预先确定的簇数k,采用类分布,大大降低了结果的随机性。在6个人工数据集上对几种离散化算法进行了实验评价,结果表明该算法具有较高的效率,能够生成较好的离散化模式。对比C4.5的输出,得到的树更小,分类规则更少,分类准确率更高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Motion Detection Based on Directional Rectangular Pattern and Adaptive Threshold Propagation in the Complex Background An Algorithm for Ellipse Detection Based on Geometry Color Image Segmentation Using Combined Information of Color and Texture Use Fukunaga-Koontz Transform to Solve Occlusion Problems in Multitarget Tracking A Discretization Algorithm of Continuous Attributes Based on Supervised Clustering
×
引用
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