<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=182664"><dc:title>Evolving clustering of time series for unsupervised analysis of industrial data streams</dc:title><dc:creator>Stržinar,	Žiga	(Avtor)
	</dc:creator><dc:creator>Škrjanc,	Igor	(Avtor)
	</dc:creator><dc:creator>Pratama,	Mahardhika	(Avtor)
	</dc:creator><dc:creator>Pregelj,	Boštjan	(Avtor)
	</dc:creator><dc:subject>time series analysis</dc:subject><dc:subject>evolving clustering</dc:subject><dc:subject>time series clustering</dc:subject><dc:subject>data stream</dc:subject><dc:subject>industrial data</dc:subject><dc:description>In industrial real-time process monitoring and fault detection, detecting and clustering machine events from time series data are essential tasks. However, conventional clustering methods often require the number of clusters to be known in advance, which is impractical in dynamic, real-world industrial scenarios. Therefore, online evolving methods are required. Furthermore, many existing methods used to obtain cluster prototypes generate prototypes containing unwanted artifacts.
This paper introduces Streaming Error in Aligned Series (sERAL), a novel method for online time series alignment and averaging. sERAL aims to produce cluster prototypes that accurately represent the underlying data shape, a property often overlooked by competing methods. sERAL is integrated into an evolving time series clustering algorithm capable of unsupervised real-time clustering of time series streams. The method enables dynamic adaptation of both individual clusters and the number of clusters through updating and merging mechanisms.
The proposed sERAL method is evaluated using sensor data collected from a real-world industrial manufacturing process. Comparison with established alignment and averaging methods reveals that sERAL produces improved cluster prototypes with fewer erroneous shape artifacts, which are common in Dynamic Time Warping-based methods. Complexity analysis shows that sERAL is highly scalable.
This work addresses a significant gap in time series clustering for streaming applications, offering a practical and scalable solution for industrial use cases where signal shape is crucial. The sERAL algorithm and the associated clustering method are made available as an open-source Python package to encourage broad use.</dc:description><dc:date>2025</dc:date><dc:date>2026-05-20 12:49:26</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>182664</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
