Hybrid K-Means Clustering for Training Special Children using Utility Pattern Mining

J. Jeyachidra, T. Logesh, K. Nandhini, R. Krithiga
{"title":"Hybrid K-Means Clustering for Training Special Children using Utility Pattern Mining","authors":"J. Jeyachidra, T. Logesh, K. Nandhini, R. Krithiga","doi":"10.1109/ICECONF57129.2023.10083709","DOIUrl":null,"url":null,"abstract":"In this Hybrid K-Means Clustering for Grouping research work, the k-means methodology is a well-known process for grouping things together. Most of the time, this algorithm sorts the objects into a set number of clusters, but in this case, the user gives the number k. At first, it picks cluster centres at random and measures how far apart k points are. This kind of cluster centre is called k centroids, and it will keep changing until there are no more changes. When making applications that use machine intelligence, a machine should be able to think like a person and make the right choices. In this case, it's not possible to get k-points from the user. So, the Genetic Algorithm (GA) is used to search with heuristics to find the initial cluster centres. The goal of this research work is to look at how k-means clustering with GA can be used to optimise. The performance evaluation of hybrid k means method illustrates the precision and accuracy of the selected clustering methods. The result states that precision was 78.35% and its accuracy was 72.67% found while using the approach. The ROC curve analysis is performed with sensitivity and specificity data. The result states that the area under curve of the approach is 84.0%.","PeriodicalId":436733,"journal":{"name":"2023 International Conference on Artificial Intelligence and Knowledge Discovery in Concurrent Engineering (ICECONF)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Artificial Intelligence and Knowledge Discovery in Concurrent Engineering (ICECONF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECONF57129.2023.10083709","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this Hybrid K-Means Clustering for Grouping research work, the k-means methodology is a well-known process for grouping things together. Most of the time, this algorithm sorts the objects into a set number of clusters, but in this case, the user gives the number k. At first, it picks cluster centres at random and measures how far apart k points are. This kind of cluster centre is called k centroids, and it will keep changing until there are no more changes. When making applications that use machine intelligence, a machine should be able to think like a person and make the right choices. In this case, it's not possible to get k-points from the user. So, the Genetic Algorithm (GA) is used to search with heuristics to find the initial cluster centres. The goal of this research work is to look at how k-means clustering with GA can be used to optimise. The performance evaluation of hybrid k means method illustrates the precision and accuracy of the selected clustering methods. The result states that precision was 78.35% and its accuracy was 72.67% found while using the approach. The ROC curve analysis is performed with sensitivity and specificity data. The result states that the area under curve of the approach is 84.0%.
基于效用模式挖掘的混合k均值聚类训练特殊儿童
在这个混合K-Means聚类分组研究工作中,K-Means方法是一个众所周知的将事物分组在一起的过程。大多数情况下,该算法将对象分类到一定数量的聚类中,但在这种情况下,用户给出了数字k。首先,它随机选择聚类中心,并测量k点之间的距离。这种簇中心被称为k个质心,它会一直变化,直到没有更多的变化。在制作使用机器智能的应用程序时,机器应该能够像人一样思考并做出正确的选择。在这种情况下,不可能从用户那里获得k点。为此,采用遗传算法(GA)进行启发式搜索,寻找初始聚类中心。这项研究工作的目标是研究如何使用遗传算法进行k-means聚类优化。混合k均值方法的性能评价说明了所选聚类方法的精密度和准确性。结果表明,该方法的精密度为78.35%,准确度为72.67%。根据敏感性和特异性数据进行ROC曲线分析。结果表明,该方法的曲线下面积为84.0%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信