A comparative investigation of the robustness of unsupervised clustering techniques for rotating machine fault diagnosis with poorly-separated data

Tapana Mekaroonkamon, S. Wongsa
{"title":"A comparative investigation of the robustness of unsupervised clustering techniques for rotating machine fault diagnosis with poorly-separated data","authors":"Tapana Mekaroonkamon, S. Wongsa","doi":"10.1109/ICACI.2016.7449821","DOIUrl":null,"url":null,"abstract":"The data recorded in industry for rotating machine health monitoring are often a large number and unlabelled. It is impractical to label these data manually. Traditionally unsupervised algorithms have been applied to address this challenge. In the situation where relevant features are included or when the features are not selected properly, it could lead to poorly-separated clusters and deteriorate the clustering performance. It is of interest to investigate the performance of clustering techniques in these circumstances. This paper aims to provide a comparative study and investigation of three well-known clustering techniques, i.e. the k-means clustering algorithm, hierarchical clustering algorithm and expectation-maximisation (EM) clustering algorithm, combined with Calinski-Harabasz index, Davies-Bouldin index, Gap value index, and Silhouette index for determining the number of clusters for both well- and poorly-separated clusters. The experimental results on two real bearing datasets show that the expectation-maximisation (EM) clustering algorithm combined with the Gap value index is the most efficient and robust method to determine the optimal number of clusters in the dataset and classify the unlabelled data.","PeriodicalId":211040,"journal":{"name":"2016 Eighth International Conference on Advanced Computational Intelligence (ICACI)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Eighth International Conference on Advanced Computational Intelligence (ICACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACI.2016.7449821","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

The data recorded in industry for rotating machine health monitoring are often a large number and unlabelled. It is impractical to label these data manually. Traditionally unsupervised algorithms have been applied to address this challenge. In the situation where relevant features are included or when the features are not selected properly, it could lead to poorly-separated clusters and deteriorate the clustering performance. It is of interest to investigate the performance of clustering techniques in these circumstances. This paper aims to provide a comparative study and investigation of three well-known clustering techniques, i.e. the k-means clustering algorithm, hierarchical clustering algorithm and expectation-maximisation (EM) clustering algorithm, combined with Calinski-Harabasz index, Davies-Bouldin index, Gap value index, and Silhouette index for determining the number of clusters for both well- and poorly-separated clusters. The experimental results on two real bearing datasets show that the expectation-maximisation (EM) clustering algorithm combined with the Gap value index is the most efficient and robust method to determine the optimal number of clusters in the dataset and classify the unlabelled data.
无监督聚类技术在旋转机械故障诊断中的鲁棒性比较研究
工业上用于旋转机械健康监测的数据通常是大量且未标记的。手工标记这些数据是不切实际的。传统上,无监督算法已被应用于解决这一挑战。在包含相关特征或特征选择不当的情况下,可能导致聚类分离不良,降低聚类性能。在这些情况下研究聚类技术的性能是很有意义的。本文对k-means聚类算法、分层聚类算法和期望最大化(EM)聚类算法这三种著名的聚类技术进行了比较研究和探讨,并结合Calinski-Harabasz指数、Davies-Bouldin指数、Gap值指数和Silhouette指数来确定分离良好和分离不良的聚类数量。在两个真实轴承数据集上的实验结果表明,结合Gap值指数的期望最大化聚类算法是确定数据集中最优聚类数量并对未标记数据进行分类的最有效和鲁棒的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信