liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Data-Driven Clustering Algorithm for Residual Data Using Fault Signatures and Expectation Maximization
Linköping University, Department of Electrical Engineering. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Electrical Engineering, Vehicular Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Electrical Engineering, Vehicular Systems. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0003-0808-052X
2022 (English)In: IFAC PAPERSONLINE, ELSEVIER , 2022, Vol. 55, no 6, p. 121-126Conference paper, Published paper (Refereed)
Abstract [en]

Clustering is an important tool in data-driven fault diagnosis to make use of unlabeled data. Collecting representative data for fault diagnosis is a difficult task since faults are rare events. In addition, using data collected from the field, e.g., logged operational data and data from different workshops about replaced components, can result in labelling uncertainties. A common approach for fault diagnosis of dynamic systems is to use residual-based features that filter out system dynamics while being sensitive to faults. The use of conventional clustering algorithms is complicated by that the distribution of residual data from one fault class varies for different realizations and system operating conditions. In this work, a clustering algorithm is proposed for residual data that clusters data by estimating fault signatures in residual space. The proposed clustering algorithm can be used on time-series data by clustering batches of data from the same fault scenario instead of clustering data sample-by-sample. The usefulness of the proposed clustering algorithm is illustrated using residual data from different fault scenarios collected from an internal combustion engine test bench. Copyright (C) 2022 The Authors.

Place, publisher, year, edition, pages
ELSEVIER , 2022. Vol. 55, no 6, p. 121-126
Keywords [en]
Unsupervised learning; Data clustering; Fault diagnosis; Machine learning
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:liu:diva-189350DOI: 10.1016/j.ifacol.2022.07.116ISI: 000858756200020OAI: oai:DiVA.org:liu-189350DiVA, id: diva2:1704908
Conference
11th International-Federation-of-Automatic-Control (IFAC) Symposium on Fault Detection, Supervision and Safety for Technical Processes (SAFEPROCESS), Pafos, CYPRUS, jun 08-10, 2022
Available from: 2022-10-20 Created: 2022-10-20 Last updated: 2022-10-20

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Lindstrom, KevinJohansson, MaxJung, Daniel
By organisation
Department of Electrical EngineeringFaculty of Science & EngineeringVehicular Systems
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 107 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf