Skip to main navigation Skip to search Skip to main content

A novel complex network community clustering method for fault diagnosis

  • Xi'an Jiaotong University
  • Key Lab of the Ministry of Education for Process Control and Efficiency Egineering
  • University of British Columbia
  • Northeastern University China

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

The complex network, as a method for the analysis of nonlinear and non-stationary signals, overcomes the shortcomings of traditional time-frequency analysis methods and proves its effectiveness in mechanical fault diagnosis. Community clustering, a type of complex network, has made great progress in recent years. However, the existing community clustering algorithms have disadvantages in that they lack significant global extreme value and huge search spaces. Therefore, a Fast Newman algorithm based on reliability judgment is proposed. Starting from the community structure characteristics of the complex network, with the fault sample as a network node, the relationship between the samples as a connected edge and a complex network model of fault data is established. Clusters in troubleshooting are transformed into community structure discovery in the network. Firstly, the initial division of the community is obtained by measuring the distance between the samples. Then, the modularity index of the network is used as a standard function of the community division, and the bottom-up community merger is performed. The local edge density index is used for reliability determination before each combination to achieve global optimization, and the network block structure is the most obvious. Finally, with all the data merged into one community, the optimal division of the community structure is obtained, while accurate community clustering and fault diagnosis is realized. The benchmark graphs for testing community detection (Lancichinetti-Fortunato-Radicchi benchmark standard test network, LFR) and different fault data of rolling bearings under multiple operating conditions are applied to verify the effectiveness of this method; the results prove that the modified Fast Newman algorithm has better clustering effects and a higher accuracy rate than the original algorithm. Compared with K-means clustering and fuzzy clustering, the modified Fast Newman algorithm achieves higher performance in fault diagnosis of rolling bearings under multiple operating conditions.

Original languageEnglish
Article number014010
JournalMeasurement Science and Technology
Volume34
Issue number1
DOIs
StatePublished - Jan 2023

Keywords

  • community clustering
  • fault diagnosis
  • modified Fast Newman algorithm
  • reliability judgment

Fingerprint

Dive into the research topics of 'A novel complex network community clustering method for fault diagnosis'. Together they form a unique fingerprint.

Cite this