2020
DOI: 10.1109/access.2020.3021720
|View full text |Cite
|
Sign up to set email alerts
|

Semi-Supervised Fuzzy C-Means Clustering Optimized by Simulated Annealing and Genetic Algorithm for Fault Diagnosis of Bearings

Abstract: As a popular clustering algorithms, fuzzy c-means (FCM) algorithm has been used in various fields, including fault diagnosis, machine learning. To overcome the sensitivity to outliers problem and the local minimum problem of the fuzzy c-means new algorithm is proposed based on the simulated annealing (SA) algorithm and the genetic algorithm (GA). The combined algorithm utilizes the simulated annealing algorithm due to its local search abilities. Thereby, problems associated with the genetic algorithm, such as … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 23 publications
(13 citation statements)
references
References 25 publications
0
12
0
Order By: Relevance
“…The earliest idea of SA was proposed by N. Metropolis et al in 1953. Then, in 1983, S. Kirkpatrick and others successfully introduced the idea of annealing to the field of combinatorial optimization, which is a stochastic optimization algorithm based on the Monte-Carlo iterative solution strategy similar to that used in [ 40 ]. The solution obtained by the SA algorithm has been shown to converge to the global optimal solution according to the probability theory.…”
Section: The Proposed Bearing Fault Diagnosis Methodsmentioning
confidence: 99%
“…The earliest idea of SA was proposed by N. Metropolis et al in 1953. Then, in 1983, S. Kirkpatrick and others successfully introduced the idea of annealing to the field of combinatorial optimization, which is a stochastic optimization algorithm based on the Monte-Carlo iterative solution strategy similar to that used in [ 40 ]. The solution obtained by the SA algorithm has been shown to converge to the global optimal solution according to the probability theory.…”
Section: The Proposed Bearing Fault Diagnosis Methodsmentioning
confidence: 99%
“…If the stopping criteria are met, the search process is stopped. Otherwise, new individuals are produced by genetic operators [43]. Genetic operators are reproduction, crossover, recombination, and mutation [44].…”
Section: A Genetic Algorithmmentioning
confidence: 99%
“…The earliest idea of SA was proposed by N. Metropolis et al in 1953. Then, in 1983, S. Kirkpatrick and others successfully introduced the idea of annealing to the field of combinatorial optimization, which is a stochastic optimization algorithm based on the Monte-Carlo iterative solution strategy similar to that used in [26]. The solution obtained by the SA algorithm has been shown to converge to the global optimal solution according to the probability theory.…”
Section: Optimization Based On Simulated Annealing Algorithmmentioning
confidence: 99%