Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 505

The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.

A novel optimized SVM classification algorithm with multi-domain feature and its application to fault diagnosis of rolling bearing

Yan, Xiaoan, Jia, Minping·2018·Neurocomputing

Abstract

Abstract Sensitive feature extraction from the raw vibration signal is still a great challenge for intelligent fault diagnosis of rolling bearing. Current fault classification framework generally concentrates on the pattern of classifier with single-domain feature, which is easy to induce insufficient feature extraction and low recognition accuracy. Therefore, to address this issue and improve intelligent diagnostic accuracy of rolling bearing, this paper proposes a novel fault classification algorithm based on optimized SVM with multi-domain feature, which mainly consists of three stages (i.e. multi-domain feature extraction, feature selection and fault identification). In this first stage, three approaches (i.e. statistical analysis, FFT and VMD) are separately applied to extract the fault feature information from multi-domain aspect (e.g. time-domain, frequency-domain and time-frequency domain), which can excavate comprehensively the condition information and intrinsic property of the raw vibration signal. Secondly, Laplace score algorithm is introduced to select automatically the meaningful sensitive feature according to the importance of each feature, which is aimed at removing some redundant information and improving the calculation efficiency. Finally, particle swarm optimization-based support vector machine (PSO-SVM) classification model is employed to implement the identification of multiple fault condition of rolling bearing. Performance of the proposed method is evaluated on two experimental examples of rolling bearing fault diagnosis. Experimental results show that the proposed method achieves high diagnosis accuracy for different working conditions of rolling bearing and outperforms some traditional methods both mentioned in this paper and published in other literature.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.neucom.2018.05.002

Cites

44 of 44 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 44 references

Cited by

See all 505

Metadata

Authors
Yan, X., & Jia, M.
Venue
Neurocomputing
Publisher
Elsevier BV
Published
2018-11
Volume
313
Pages
47-64
ISSN
0925-2312 (ISSN-L)
OpenAlex
W2809350318
Cited by
505
References
44
FWCI
31.65
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A novel optimized SVM classification algorithm with multi-domain feature and its application to fault diagnosis of rolling bearing. https://app.cochat.ai/papers/10.1016/j.neucom.2018.05.002
The paper
Yan, X., & Jia, M. (2018). A novel optimized SVM classification algorithm with multi-domain feature and its application to fault diagnosis of rolling bearing. Neurocomputing. https://doi.org/10.1016/j.neucom.2018.05.002

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.