Fault detection and root cause diagnosis using sparse principal component analysis (SPCA)
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
Data based methods are widely used in process industries for fault detection and diagnosis. Among the data-based methods multivariate statistical methods, for example, Principal Component Analysis (PCA), Projection to Latent Squares (PLS), and Independent Component Analysis (ICA) are most widely used methods. These methods in general are successful in detecting process fault, however, diagnosis of the root cause is always not very accurate. The primary goal of the thesis is to improve the fault diagnosis ability of PCA based methods. In PCA, each Principal Component (PC) is a linear combination of all the variables, therefore makes it difficult to identify the root cause from the violation of a PC. Sparse Principal Component Analysis (SPCA) is one version of PCA that gets a sparse description of the PCA loading matrix making it more suitable for fault diagnosis. The present research aims to devise novel strategies to find the sparse description of loading matrix, more aligned with process fault detection and diagnosis. The thesis also looks into improving the fault diagnosis of PCA using clustering methods. The entire thesis can be divided into three major tasks. First, a novel fault detection and diagnosis method is proposed based on the Sparse Principal Component Analysis (SPCA) approach. This approach incorporates a new criterion based on the Fault Detection Rates (FDRs) and False Alarm Rates (FARs) into Zou et al.’s (2006) SPCA algorithms. The objective here is to find appropriate the (Number of Non-Zero Loadings) NNZLs for SPCs that can result in low FARs and high FDRs. A comparison between PCA and four SPCA-based methods for FDD using a continuous stirred tank heater (CSTH) as a benchmark system is also carried out. The results indicate that shortcomings of the PCA can be overcome using the Sparse Principal Component Analysis (SPCA) that uses the novel NNZL criterion. The FDR-FAR SPCA approach gives the highest FDRs for the SPE statistic (93.8%). The second task focuses on developing statistical methods to decide on the non-zero elements of the loading elements of SPCA. Rather than using heuristics, the proposed methods use the distribution of the loading elements to decide if an element should be set to zero. Two SPCA algorithms are proposed to find the NNZL and its position of each PC. The first algorithm is based on bootstrapping of the data, and the second approach is based Iterative Principal Component Analysis (IPCA). The proposed methods are implemented on a CSTH process to test the performance with PCA- and other SPCA-based methods for fault detection and diagnosis. The results reveal that the approaches have superior performance in fault detection, as well as diagnosis of the root cause of fault. Both the Bootstrap-SPCA and Sparse-IPCA methods give the highest FDRs for fault 1 for the SPE statistic (99.3% and 95.76%, respectively) As the third task, this research combines the clustering (k-means) algorithm and PCA algorithm to improve the detection and diagnosis of the fault. PCA has the advantage of detecting the fault without the need for data labelling, while clustering is able to distinguish data from different fault groups into separate clusters. By combining these two algorithms we are able to have better detection and diagnosis of fault and eliminate the need for data labelling. The performance of the proposed method is demonstrated in simulated and large-scale industrial case studies.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,001 | 0,002 |
| Études des sciences et des technologies | 0,001 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,001 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle