hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Mining infrequent group of motifs from multidimensional time series: A case study at Alfa Laval AB
Halmstad University, School of Information Technology.
Halmstad University, School of Information Technology.
2024 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

In collaboration with an industrial partner, Alfa Laval AB, this thesis discusses a novel approach for identifying operational modes, specifically a cleaning mode, in separator machines without the benefit of labelled data and with very limited operating knowledge. Understanding the operational modes is crucial for comprehending the machine’s behaviour and ensuring its optimal performance.

 

Alfa Laval AB relies on a threshold-based fault detection system. The cleaning mode triggers vibrations that confuse the machine’s fault detection system, resulting in false alarms. The primary challenge revolves around the limited understanding of this infrequent cleaning mode, occurring periodically for 1-2 hours at intermittent intervals. To tackle this, we approach the problem as a data mining task. Matrix Profile (MP), a powerful tool in time series data analysis excels at identifying motifs and discords but struggles to distinguish between frequent and non-frequent motifs.

 

To address the drawback, we introduced an innovative approach capable of detecting frequent motifs and non-frequent motifs from the matrix profile output. The fundamental concept involves extracting the top-K motif matches using the Matrix Profile (MP) and systematically monitoring the evolution of structural similarity through pairwise similarity matrix calculation, progressing from pairs of two motifs to a group of K motifs.

 

This approach helps us to identify infrequent motifs that contain the most similar patterns which will be a good fit to address our challenge of identifying the cleaning mode.

Place, publisher, year, edition, pages
2024.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:hh:diva-52449OAI: oai:DiVA.org:hh-52449DiVA, id: diva2:1829921
External cooperation
Alfa Laval AB
Educational program
Master's Programme in Embedded and Intelligent Systems, 120 credits
Supervisors
Examiners
Available from: 2024-01-22 Created: 2024-01-21 Last updated: 2024-01-23Bibliographically approved

Open Access in DiVA

fulltext(4445 kB)256 downloads
File information
File name FULLTEXT02.pdfFile size 4445 kBChecksum SHA-512
ad485b0bc9fac4c95061eb4a37c8df025ebb177033e36d549584d68f078392d220de3d0334c0af44b39e93eff7864a1217b92d64ca8657947dd6629b8a3d595e
Type fulltextMimetype application/pdf

By organisation
School of Information Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 257 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 542 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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