Efficient computation of recursive principal component analysis for structured input

Abstract

Recently, a successful extension of Principal Component Analysis for structured input, such as sequences, trees, and graphs, has been proposed. This allows the embedding of discrete structures into vectorial spaces, where all the classical pattern recognition and machine learning methods can be applied. The proposed approach is based on eigenanalysis of extended vectorial representations of the input structures and substructures. One problem with the approach is that eigenanalysis can be computationally quite demanding when considering large dataseis of structured objects. In this paper we propose a general approach for reducing the computational burden. Experimental results show a significant speed-up of the computation. © Springer-Verlag Berlin Heidelberg 2007.