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
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.
Integrity signals
Registry
Cites
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.
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
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
Peng, H., Long, F., & Ding, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.159 · Cited by 10,544
Variational Mode Decomposition
Dragomiretskiy, K., & Zosso, D. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2288675 · Cited by 9,184
Permutation Entropy: A Natural Complexity Measure for Time Series
Bandt, C., & Pompe, B. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.174102 · Cited by 4,867
Laplacian Score for Feature Selection
He, X., Cai, D., & Niyogi, P. (2005) · Cited by 1,962
Support vector machines for spam categorization
Drucker, H., Wu, D., & Vapnik, V. N. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.788645 · Cited by 1,471
Combining SVMs with Various Feature Selection Strategies
Chen, Y.-W., & Lin, C.-J. (2008) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-35488-8_13 · Cited by 980
Ben Ali, J., Fnaiech, N., Saidi, L., Chebel-Morello, B., & Fnaiech, F. (2015) · Applied Acoustics · doi:10.1016/j.apacoust.2014.08.016 · Cited by 768
Zhang, X., Liang, Y., Zhou, J., & zang, Y. (2015) · Measurement · doi:10.1016/j.measurement.2015.03.017 · Cited by 586
Cited by
Ding, Y., Jia, M., Miao, Q., & Cao, Y. (2022) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2021.108616 · Cited by 559
Self-citationJalayer, M., Orsenigo, C., & Vercellis, C. (2021) · Computers in Industry · doi:10.1016/j.compind.2020.103378 · Cited by 382
Machine Learning Applications based on SVM Classification A Review
Mustafa Abdullah, D., & Mohsin Abdulazeez, A. (2021) · Qubahan Academic Journal · doi:10.48161/qaj.v1n2a50 · Cited by 376
A stochastic configuration network based on chaotic sparrow search algorithm
Zhang, C., & Ding, S. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2021.106924 · Cited by 342
A Time Series Transformer based method for the rotating machinery fault diagnosis
Jin, Y., Hou, L., & Chen, Y. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.04.111 · Cited by 336
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.