Advanced search
Start date

Time series classification algorithms applied to embedded systems

Grant number: 09/06349-0
Support type:Scholarships abroad - New Frontiers
Effective date (Start): February 01, 2010
Effective date (End): January 31, 2011
Field of knowledge:Physical Sciences and Mathematics - Computer Science
Principal researcher:Gustavo Enrique de Almeida Prado Alves Batista
Grantee:Gustavo Enrique de Almeida Prado Alves Batista
Host: Eamonn John Keogh
Home Institution: Instituto de Ciências Matemáticas e de Computação (ICMC). Universidade de São Paulo (USP). São Carlos , SP, Brazil
Research place: University of California, Riverside (UCR), United States  


Integrating sequential and temporal data into the Data Mining process is of one of the most important challenges in Machine Learning. In this project, we are mostly interested in developing time series classification algorithms. The k-nearest neighbor algorithm is a common approach to time series classification. This algorithm has been known to perform well, especially when allied to distance measures that can deal with time lags, such as the Dynamic Time Warping. However, the classical k-nearest neighbor algorithm is computationally intensive. One may solve this problem by using indexes to increase the efficiency of similarity queries. This project proposes to investigate indexing algorithms that have the properties of anyspace algorithms. Anyspace algorithms are able to deal with different amounts of memory, in such a way that the algorithm performance depends directly on the amount of available memory. Such algorithms allow specifying the amount of memory based on the performance required by an embedded application. This project also deals with classification methods based on induction of classification rules. An approach to induce rules from time series data is the identification of motifs. Motifs are frequently occurring subsequences that usually represent a phenomenon of interest. A convenient aspect of rules is the ease one finds in writing a procedural program which implements the rule's logic with little memory and processing resources. The algorithms developed in this post-doctoral stage will be applied in insect control and monitoring using devices developed by ISCA Technologies. (AU)

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items

Scientific publications
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
BATISTA, GUSTAVO E. A. P. A.; KEOGH, EAMONN J.; TATAW, OBEN MOSES; DE SOUZA, VINICIUS M. A. CID: an efficient complexity-invariant distance for time series. DATA MINING AND KNOWLEDGE DISCOVERY, v. 28, n. 3, p. 634-669, MAY 2014. Web of Science Citations: 76.
RAKTHANMANON, THANAWIN; CAMPANA, BILSON; MUEEN, ABDULLAH; BATISTA, GUSTAVO; WESTOVER, BRANDON; ZHU, QIANG; ZAKARIA, JESIN; KEOGH, EAMONN. Addressing Big Data Time Series: Mining Trillions of Time Series Subsequences Under Dynamic Time Warping. ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, v. 7, n. 3, SI SEP 2013. Web of Science Citations: 53.

Please report errors in scientific publications list by writing to: