基于教-学优化的基本聚类技术评估

B. Mishra, N. Nayak, A. Rath
{"title":"基于教-学优化的基本聚类技术评估","authors":"B. Mishra, N. Nayak, A. Rath","doi":"10.1504/IJKESDP.2016.075977","DOIUrl":null,"url":null,"abstract":"There has been lot of talk regarding the initial cluster centre selection, because a bad centroid may result in malicious clustering. Due to this reason, we have taken the help of a latest population-based evolutionary optimisation technique called teaching-learning-based optimisation TLBO for selecting near about optimum cluster centres. After getting the finest initial centroids, we perform the necessary clustering by means of our proposed Enhanced clustering algorithm. In this paper, we have evaluated and assessed the performances of three different TLBO-based clustering algorithms: TLBO-supported classical K-means, TLBO-based fuzzy c-mean and our proposed approach of TLBO-based data clustering. Their clustering efficiency has been compared in conjunction with two typical cluster validity indices, namely the Davies-Bouldin's index and the Dunn's index. We extend our comparison by taking into account their calculated average quantisation error. Each algorithm is then tested on several datasets taken from UCI repository of machine learning databases. Experimental results show that our proposed approach produces better clustering with minimum quantisation error for most of the datasets as compared to the other discussed methods. Also the problem of initial centre selection is minimised to a greater extent.","PeriodicalId":347123,"journal":{"name":"Int. J. Knowl. Eng. Soft Data Paradigms","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Assessment of basic clustering techniques using teaching-learning-based optimisation\",\"authors\":\"B. Mishra, N. Nayak, A. Rath\",\"doi\":\"10.1504/IJKESDP.2016.075977\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There has been lot of talk regarding the initial cluster centre selection, because a bad centroid may result in malicious clustering. Due to this reason, we have taken the help of a latest population-based evolutionary optimisation technique called teaching-learning-based optimisation TLBO for selecting near about optimum cluster centres. After getting the finest initial centroids, we perform the necessary clustering by means of our proposed Enhanced clustering algorithm. In this paper, we have evaluated and assessed the performances of three different TLBO-based clustering algorithms: TLBO-supported classical K-means, TLBO-based fuzzy c-mean and our proposed approach of TLBO-based data clustering. Their clustering efficiency has been compared in conjunction with two typical cluster validity indices, namely the Davies-Bouldin's index and the Dunn's index. We extend our comparison by taking into account their calculated average quantisation error. Each algorithm is then tested on several datasets taken from UCI repository of machine learning databases. Experimental results show that our proposed approach produces better clustering with minimum quantisation error for most of the datasets as compared to the other discussed methods. Also the problem of initial centre selection is minimised to a greater extent.\",\"PeriodicalId\":347123,\"journal\":{\"name\":\"Int. J. Knowl. Eng. Soft Data Paradigms\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Knowl. Eng. Soft Data Paradigms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJKESDP.2016.075977\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Knowl. Eng. Soft Data Paradigms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJKESDP.2016.075977","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

关于初始聚类中心的选择有很多讨论,因为错误的质心可能导致恶意聚类。由于这个原因,我们采用了一种最新的基于种群的进化优化技术,称为基于教学的优化TLBO,用于选择接近最优的聚类中心。在得到最优的初始质心后,利用本文提出的增强聚类算法进行必要的聚类。在本文中,我们评估和评估了三种不同的基于tlbo的聚类算法的性能:支持tlbo的经典K-means,基于tlbo的模糊c-mean和我们提出的基于tlbo的数据聚类方法。并结合Davies-Bouldin指数和Dunn指数这两种典型的聚类效度指标对它们的聚类效率进行了比较。我们通过考虑它们计算的平均量化误差来扩展我们的比较。然后,每个算法在取自UCI机器学习数据库存储库的几个数据集上进行测试。实验结果表明,与其他讨论的方法相比,我们提出的方法在大多数数据集上产生了更好的聚类,并且量化误差最小。同时,在更大程度上最小化了初始中心选择问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Assessment of basic clustering techniques using teaching-learning-based optimisation
There has been lot of talk regarding the initial cluster centre selection, because a bad centroid may result in malicious clustering. Due to this reason, we have taken the help of a latest population-based evolutionary optimisation technique called teaching-learning-based optimisation TLBO for selecting near about optimum cluster centres. After getting the finest initial centroids, we perform the necessary clustering by means of our proposed Enhanced clustering algorithm. In this paper, we have evaluated and assessed the performances of three different TLBO-based clustering algorithms: TLBO-supported classical K-means, TLBO-based fuzzy c-mean and our proposed approach of TLBO-based data clustering. Their clustering efficiency has been compared in conjunction with two typical cluster validity indices, namely the Davies-Bouldin's index and the Dunn's index. We extend our comparison by taking into account their calculated average quantisation error. Each algorithm is then tested on several datasets taken from UCI repository of machine learning databases. Experimental results show that our proposed approach produces better clustering with minimum quantisation error for most of the datasets as compared to the other discussed methods. Also the problem of initial centre selection is minimised to a greater extent.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信