Support, Relevance and Spectral Learning for Time Series

  • Authors:
  • Bernardete Ribeiro

  • Affiliations:
  • Department of Informatics Engineering, Center for Informatics and Systems, University of Coimbra, Polo II, P-3030-290 Coimbra, Portugal

  • Venue:
  • ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes the Spectral Clustering Kernel Machine (SCKM) for times series prediction. Support Vector Machine (SVM), Relevance Vector Machine (RVM) and the Spectral Clustering Kernel Machine (SCKM) are compared in terms of performance accuracy for a simple time series approximation problem. The three outlined algorithms each of which with interesting features to perform automated learning are examined, analysed and empirically tested. In case of the SVM, our tests combine also a preprocessing stage including Kohonen Maps (SOM) as well as K-means clustering. In the case of RVM we also implemented a constructive approach based on the fast marginal likelihood maximization described in [14]. Prediction results in two benchmark time series have been addressed using various performance metrics. The results demonstrate that whereas RVM models achieve larger parsimony of the fitted model, both SVM and SCKM attain higher accuracy. The learning models are competitive for real world problems.