English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/155764
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


A Genetic Algorithm to Discover Flexible Motifs with Support

AuthorsSerra, Joan ; Matic, Aleksandar; Arcos Rosell, Josep Lluís ; Karatzoglou, Alexandros
KeywordsGenetic algorithms
Time series
Issue Date12-Dec-2016
PublisherInstitute of Electrical and Electronics Engineers. Computer Group
Citation16th IEEE International Conference on Data Mining Workshops, ICDMW 2016, p. 1153-1158.
AbstractFinding repeated patterns or motifs in a time series is an important unsupervised task that has still a number of open issues, starting by the definition of motif. In this paper, we revise the notion of motif support, characterizing it as the number of patterns or repetitions that define a motif. We then propose GENMOTIF, a genetic algorithm to discover motifs with support which, at the same time, is flexible enough to accommodate other motif specifications and task characteristics. GENMOTIF is an anytime algorithm that easily adapts to many situations: searching in a range of segment lengths, applying uniform scaling, dealing with multiple dimensions, using different similarity and grouping criteria, etc. GENMOTIF is also parameter-friendly: it has only two intuitive parameters which, if set within reasonable bounds, do not substantially affect its performance. We demonstrate the value of our approach in a number of synthetic and real-world settings, considering traffic volume measurements, accelerometer signals, and telephone call records. © 2016 IEEE.
Identifiersdoi: 10.1109/ICDMW.2016.0166
issn: 23759232
isbn: 978-150905472-5
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.