A framework for classification using genetic algorithm based clustering

Satish Gajawada, Durga Toshniwal
{"title":"A framework for classification using genetic algorithm based clustering","authors":"Satish Gajawada, Durga Toshniwal","doi":"10.1109/ISDA.2012.6416631","DOIUrl":null,"url":null,"abstract":"Clustering has been used in literature to enhance classification accuracy. But most partitional clustering methods need the number of clusters as input and also they are sensitive to initialization. Although hierarchical clustering methods may be more effective in finding clustering structure of the dataset than partitional methods but hierarchical clustering methods give tree structure known as dendrogram which is a sequence of clustering solutions. Hence hierarchical clustering algorithms are not generally applied in the preprocessing step to classification methods. This problem can be solved by cutting the dendrogram to get single clustering solution. In this paper we propose a framework for classification which uses Optimal Clustering Genetic Algorithm (OCGA) to obtain optimal level of cutting the dendrogram. A single clustering solution is obtained by cutting the dendrogram at optimal level. The clusters obtained are used to enhance classification accuracy of the classification methods. The proposed classification methods have been applied for the diagnosis of diabetes disease.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISDA.2012.6416631","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Clustering has been used in literature to enhance classification accuracy. But most partitional clustering methods need the number of clusters as input and also they are sensitive to initialization. Although hierarchical clustering methods may be more effective in finding clustering structure of the dataset than partitional methods but hierarchical clustering methods give tree structure known as dendrogram which is a sequence of clustering solutions. Hence hierarchical clustering algorithms are not generally applied in the preprocessing step to classification methods. This problem can be solved by cutting the dendrogram to get single clustering solution. In this paper we propose a framework for classification which uses Optimal Clustering Genetic Algorithm (OCGA) to obtain optimal level of cutting the dendrogram. A single clustering solution is obtained by cutting the dendrogram at optimal level. The clusters obtained are used to enhance classification accuracy of the classification methods. The proposed classification methods have been applied for the diagnosis of diabetes disease.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于遗传算法的聚类分类框架
文献中已经使用聚类来提高分类精度。但大多数分区聚类方法都需要簇数作为输入,而且对初始化很敏感。虽然分层聚类方法在寻找数据集的聚类结构方面可能比分区方法更有效,但分层聚类方法给出的树状结构称为树形图,它是聚类解的序列。因此,在分类方法的预处理阶段一般不采用分层聚类算法。这个问题可以通过对树状图进行切割得到单一的聚类解来解决。本文提出了一种基于最优聚类遗传算法(OCGA)的树状图分类框架。通过在最优水平切割树形图,得到单个聚类解。将得到的聚类用于提高分类方法的分类精度。所提出的分类方法已应用于糖尿病疾病的诊断。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Prediction of risk score for heart disease using associative classification and hybrid feature subset selection WSDL-TC: Collaborative customization of web services Knowledge representation and reasoning based on generalised fuzzy Petri nets Interval-valued fuzzy graph representation of concept lattice Community optimization: Function optimization by a simulated web community
×
引用
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