Searching and Mining Trillions of Time Series Subsequences under Dynamic Time Warping

Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series data mining algorithms. The difficulty of scaling search to large datasets largely explains why most academic work on time...

Descripción completa

Detalles Bibliográficos
Autores principales: Rakthanmanon, Thanawin, Campana, Bilson, Mueen, Abdullah, Batista, Gustavo, Westover, Brandon, Zhu, Qiang, Zakaria, Jesin, Keogh, Eamonn
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2012
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6816304/
https://www.ncbi.nlm.nih.gov/pubmed/31660254
http://dx.doi.org/10.1145/2339530.2339576

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6816304/
https://www.ncbi.nlm.nih.gov/pubmed/31660254
http://dx.doi.org/10.1145/2339530.2339576

Ejemplares similares