Optimal Sparse Principal Component Analysis With a Varying Regularization Coefficient for Industrial Fault Diagnosis

With the increasing complexity of industrial systems, modeling and intelligent diagnosis of high-dimensional industrial data have become increasingly challenging. To address this issue, this study proposes an optimal sparse principal component analysis (OSPCA) method with a varying regularization coefficient. The lower bound of the sparse regularization coefficient for achieving optimal feature selection is given, and theoretical proof is provided. Subsequently, an iterative optimization algorithm with a varying regularization coefficient is proposed for model optimization. The proposed OSPCA are applied to unsupervised fault clustering and dynamic industrial process monitoring, and the experimental results show the excellent performance of OSPCA in the fault diagnosis tasks.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Instrumentation and Measurement
Published
2025-01-01
DOI
https://doi.org/10.1109/tim.2025.3527600
Citations
4
Primary Topic
Fault Detection and Control Systems
Type
article
Field-Weighted Citation Impact
4.86

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Sparse Principal Component Analysis With a Varying Regularization Coefficient for Industrial Fault Diagnosis

Mingliang Cui, Tongze Hou, Youqing Wang, Xin Ma et al.
4 citations
IEEE Transactions on Instrumentation and Measurement
Fault Detection and Control Systems
4.86
article

Optimal Sparse Principal Component Analysis With a Varying Regularization Coefficient for Industrial Fault Diagnosis

Mingliang Cui, Tongze Hou, Youqing Wang, Xin Ma, Jipeng Guo
article en
4 citations

Abstract

With the increasing complexity of industrial systems, modeling and intelligent diagnosis of high-dimensional industrial data have become increasingly challenging. To address this issue, this study proposes an optimal sparse principal component analysis (OSPCA) method with a varying regularization coefficient. The lower bound of the sparse regularization coefficient for achieving optimal feature selection is given, and theoretical proof is provided. Subsequently, an iterative optimization algorithm with a varying regularization coefficient is proposed for model optimization. The proposed OSPCA are applied to unsupervised fault clustering and dynamic industrial process monitoring, and the experimental results show the excellent performance of OSPCA in the fault diagnosis tasks.

IEEE Transactions on Instrumentation and MeasurementVol. 74
Beijing University of Chemical Technology (CN)
National Natural Science Foundation of China, China Postdoctoral Science Foundation, Natural Science Foundation of Beijing Municipality, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 6%
Fault Detection and Control Systems
4.86
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.