A method based on clustering fast search for bearing performance degradation assessment

To address the problem of relying on manual experience to determine the number of cluster centers, this paper introduces an approach for evaluating the performance degradation of rolling bearings using the clustering by fast search (CFS) algorithm. Few studies have explored the application of CFS for bearing performance degradation assessment (PDA). Unlike traditional cluster models, such as Fuzzy C-Means, Gustafson-Kessel, Gath-Geva, K-means, and K-medoids, CFS automatically selects the cluster centers according to local density and distance. First, the original vibration signals are processed using local mean decomposition to obtain several product functions (PFs). The top two PFs are selected based on the correlation coefficient and then analyzed using singular-value decomposition to extract the top two singular values (SV1 and SV2). Second, SV1 and SV2 are used as input to the CFS algorithm to identify the cluster centers automatically. Lastly, a confidence value is calculated based on the differences between the sample features and the identified clustering centers for bearing PDA. The results show that CFS outperforms other clustering methods and models, including root mean square, kurtosis, Shannon entropy, approximate entropy, and permutation entropy, detecting early-stage degradation more precisely.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-05-23
DOI
https://doi.org/10.1038/s41598-025-01513-1
Primary Topic
Gear and Bearing Dynamics Analysis
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A method based on clustering fast search for bearing performance degradation assessment

Roger Luo, Wenhui Zeng, Xiaoming Yang, Baigang Du et al.
Scientific Reports
Gear and Bearing Dynamics Analysis
article

A method based on clustering fast search for bearing performance degradation assessment

Roger Luo, Wenhui Zeng, Xiaoming Yang, Baigang Du, Fan Xu, ShengWen Zhou, Li Zhang
article en

Abstract

To address the problem of relying on manual experience to determine the number of cluster centers, this paper introduces an approach for evaluating the performance degradation of rolling bearings using the clustering by fast search (CFS) algorithm. Few studies have explored the application of CFS for bearing performance degradation assessment (PDA). Unlike traditional cluster models, such as Fuzzy C-Means, Gustafson-Kessel, Gath-Geva, K-means, and K-medoids, CFS automatically selects the cluster centers according to local density and distance. First, the original vibration signals are processed using local mean decomposition to obtain several product functions (PFs). The top two PFs are selected based on the correlation coefficient and then analyzed using singular-value decomposition to extract the top two singular values (SV1 and SV2). Second, SV1 and SV2 are used as input to the CFS algorithm to identify the cluster centers automatically. Lastly, a confidence value is calculated based on the differences between the sample features and the identified clustering centers for bearing PDA. The results show that CFS outperforms other clustering methods and models, including root mean square, kurtosis, Shannon entropy, approximate entropy, and permutation entropy, detecting early-stage degradation more precisely.

Scientific ReportsVol. 15(1)
Wuhan University of Technology (CN)
National Natural Science Foundation of China, Natural Science Foundation of Hubei Province, Jingchu University of Technology, National Key Research and Development Program of China
Climate action
Openalex Percentile: Top 89%
Gear and Bearing Dynamics Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.