FB-DT: An improvement in the Brute Force algorithm for motifs discovery

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.