A nearest neighbours-based algorithm for big time series data forecasting

29Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A forecasting algorithm for big data time series is presented in this work. A nearest neighbours-based strategy is adopted as the main core of the algorithm. A detailed explanation on how to adapt and implement the algorithm to handle big data is provided. Although some parts remain iterative, and consequently requires an enhanced implementation, execution times are considered as satisfactory. The performance of the proposed approach has been tested on real-world data related to electricity consumption from a public Spanish university, by using a Spark cluster.

Cite

CITATION STYLE

APA

Talavera-Llames, R. L., Pérez-Chacón, R., Martínez-Ballesteros, M., Troncoso, A., & Martínez-Álvarez, F. (2016). A nearest neighbours-based algorithm for big time series data forecasting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9648, pp. 174–185). Springer Verlag. https://doi.org/10.1007/978-3-319-32034-2_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free