FB-DT: Uma Otimização do Algoritmo de Força Bruta para a Identificação de Motifs
(FB-DT: An improvement in the Brute Force algorithm for motifs discovery)
Lucas Guilherme Hübner (email@example.com)1, André Gustavo Maletzke (firstname.lastname@example.org)1, Barbara Lepretti de Nadai (email@example.com)0, Ricardo Luís Schaefer (firstname.lastname@example.org)1, Willian Zalewski (email@example.com)3, Carlos Andres Ferrero (firstname.lastname@example.org)4
1Universidade Estadual do Oeste do Paraná - UNIOESTE23Universidade Federal da Integração Latino-Americana - UNILA4Instituto Federal de Santa Catarina - IFSC
This paper appears in: Revista IEEE América Latina
Publication Date: Aug. 2017
Volume: 15, Issue: 8
Nowadays, the interest for time series analysis using motifs extraction has been expanded to different areas. However, due to the complexity and dimensionality of the time series datasets, this task may become restrictive in certain cases. Thus, several methods have been proposed, which use the Brute Force algorithm as a baseline criterion. In this work, we propose an improvement in the Brute Force algorithm aimed to reduce the execution time and, consequently, allow its use in a larger number of situations. Experimental results show a significant reduction in the execution time of brute force algorithm.
Triangular Inequality, Time Series, Morphological Patterns
Documents that cite this
This function is not implemented yet.
[PDF Full-Text (359)]