Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/155764
COMPARTIR / EXPORTAR:
SHARE CORE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Serra, Joan | - |
dc.contributor.author | Matic, Aleksandar | - |
dc.contributor.author | Arcos Rosell, Josep Lluís | - |
dc.contributor.author | Karatzoglou, Alexandros | - |
dc.date.accessioned | 2017-09-27T15:57:31Z | - |
dc.date.available | 2017-09-27T15:57:31Z | - |
dc.date.issued | 2016-12-12 | - |
dc.identifier | doi: 10.1109/ICDMW.2016.0166 | - |
dc.identifier | issn: 23759232 | - |
dc.identifier | isbn: 978-150905472-5 | - |
dc.identifier.citation | 16th IEEE International Conference on Data Mining Workshops, ICDMW 2016, p. 1153-1158. | - |
dc.identifier.uri | http://hdl.handle.net/10261/155764 | - |
dc.description.abstract | Finding 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. | - |
dc.description.sponsorship | This research has been partially funded by ICT-2014-15-645323 from the European Commission (JS) and 2014-SGR-118 from Generalitat de Catalunya (JLA). | - |
dc.publisher | Institute of Electrical and Electronics Engineers. Computer Group | - |
dc.relation | info:eu-repo/grantAgreement/EC/H2020/645323 | - |
dc.rights | closedAccess | - |
dc.subject | Genetic algorithms | - |
dc.subject | Time series | - |
dc.subject | Clustering | - |
dc.subject | Motifs | - |
dc.title | A Genetic Algorithm to Discover Flexible Motifs with Support | - |
dc.type | artículo | - |
dc.identifier.doi | 10.1109/ICDMW.2016.0166 | - |
dc.date.updated | 2017-09-27T15:57:31Z | - |
dc.description.version | Peer Reviewed | - |
dc.language.rfc3066 | eng | - |
dc.contributor.funder | Generalitat de Catalunya | - |
dc.contributor.funder | European Commission | - |
dc.relation.csic | Sí | - |
dc.identifier.funder | http://dx.doi.org/10.13039/501100002809 | es_ES |
dc.identifier.funder | http://dx.doi.org/10.13039/501100000780 | es_ES |
dc.type.coar | http://purl.org/coar/resource_type/c_6501 | es_ES |
item.openairetype | artículo | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | No Fulltext | - |
Aparece en las colecciones: | (IIIA) Comunicaciones congresos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
accesoRestringido.pdf | 15,38 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
SCOPUSTM
Citations
3
checked on 22-abr-2024
Page view(s)
274
checked on 22-abr-2024
Download(s)
99
checked on 22-abr-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.