A novel complex network community clustering method for fault diagnosis
Bibliographic record
Abstract
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.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".