Adaptive Multiscale Convolution Manifold Embedding Networks for Intelligent Fault Diagnosis of Servo Motor-Cylindrical Rolling Bearing Under Variable Working Conditions
Bibliographic record
Abstract
The rolling bearing of the servo motor is widely used in precision-controlled mechanical systems. It usually works at variable speed and load, possibly resulting in partial bearing failure. Meanwhile, the varying conditions may cause the smearing of classable features, increasing the diagnostic difficulty. To this end, an intelligent fault diagnosis method of servo motor-cylindrical roller bearings based on adaptive multiscale convolution manifold embedding networks (AMCMENet) under variable working conditions is proposed. The core of the proposed algorithm is to apply the designed intraclass and interclass constraints to reprocess the feature extracted by designed multiscale convolutional neural networks (MSCNN). In this way, the distribution differences of samples could be improved. The training sample under variable conditions is first input to the designed MSCNN for initial feature extraction. Afterward, the constructed locality sensitive discriminant analysis algorithm module is used, which is adjusted to optimal parameters by the particle swarm optimization algorithm, to enlarge the heterogeneous distance and narrow the homogeneous distance of the extracted feature. Finally, the testing subset is provided to the trained AMCMENet algorithm for fault diagnosis. The experimental results of two datasets demonstrate that the proposed intelligent fault diagnosis method performs better under cross working 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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| 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 source (direct Gemma or distilled Codex), 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".