This is a supporting page of the paper

Particle Swarm Optimization for Time Series Motif Discovery

by Joan Serrą and Josep Lluis Arcos


J. Serrą and J.L. Arcos. "Particle Swarm Optimization for Time Series Motif Discovery". Knowledge-Based Systems. In press.


Efficiently finding similar segments or motifs in time series data is a fundamental task that, due to the ubiquity of these data, is present in a wide range of domains and situations. Because of this, countless solutions have been devised but, to date, none of them seems to be fully satisfactory and flexible. In this article, we propose an innovative standpoint and present a solution coming from it: an anytime multimodal optimization algorithm for time series motif discovery based on particle swarms. By considering data from a variety of domains, we show that this solution is extremely competitive when compared to the state-of-the-art, obtaining comparable motifs in considerably less time using minimal memory. In addition, we show that it is robust to different implementation choices and see that it offers an unprecedented degree of flexibility with regard to the task. All these qualities make the presented solution stand out as one of the most prominent candidates for motif discovery in long time series streams. Besides, we believe the proposed standpoint can be exploited in further time series analysis and mining tasks, widening the scope of research and potentially yielding novel effective solutions.

Code and executable

Our C++ source code, a 64-bit executable and a Python wrapper can be found here. An improved development version handling multidimensional time series can be found here.

Data sets

The data used in the article can be found here. For completeness, we also add our personal copies of previously existing time series. Details can be found in the article.

Additional results

Additional results are available here.


If using original code, data or results from here, please cite the above reference. We do not provide any support or assistance for the supplied code nor we offer any other compilation/variant of it. In addition, we assume no responsibility regarding this web page or the use of the contents linked in it.

This page was last modified by
Joan Serrą on November 2015.