Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKaramitopoulos, Leonidas-
dc.contributor.authorEvangelidis, Georgios-
dc.description.abstractIn this paper, we present a new method that accelerates similarity search implemented via one-nearest neighbor on time series data. The main idea is to identify the most similar time series to a given query without necessarily searching over the whole database. Our method is based on partitioning the search space by applying the K-means algorithm on the data. Then, similarity search is performed hierarchically starting from the cluster that lies most closely to the query. This procedure aims at reaching the most similar series without searching all clusters. In this work, we propose to reduce the intrinsically high dimensionality of time series prior to clustering by applying a well known dimensionality reduction technique, namely, the piecewise aggregate approximation, for its simplicity and efficiency. Experiments are conducted on twelve real-world and synthetic datasets covering a wide range of applications.en_US
dc.rightsAttribution-NonCommercial-ShareAlike 4.0 International*
dc.subjectFRASCATI::Natural sciences::Computer and information sciencesen_US
dc.subject.othersimilarity searchen_US
dc.subject.othertime seriesen_US
dc.subject.otherdata miningen_US
dc.titleCluster-Based Similarity Search in Time Seriesen_US
dc.typeConference Paperen_US
dc.contributor.departmentΤμήμα Εφαρμοσμένης Πληροφορικήςen_US
local.identifier.volumetitle2009 Fourth Balkan Conference in Informaticsen_US
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
2009_BCI.pdf204,97 kBAdobe PDFThumbnail

This item is licensed under a Creative Commons License Creative Commons