Incremental Eigenanalysis for Classification
نویسندگان
چکیده
Eigenspace models are a convenient way to represent sets of observations with widespread applications, including classification. In this paper we describe a new constructive method for incrementally adding observations to an eigenspace model. Our contribution is to explicitly account for a change in origin as well as a change in the number of eigenvectors needed in the basis set. No other method we have seen considers change of origin, yet both are needed if an eigenspace model is to be used for classification purposes. We empirically compare our incremental method with two alternatives from the literature and show our method is the more useful for classification because it computes the smaller eigenspace model representing the observations.
منابع مشابه
On the use of a Decimative Spectra on Eigenanalysis and SVD for F Tracking of Speec
In this paper, a Decimative Spectral estimation method based on Eigenanalysis and SVD (Singular Value Decomposition) is presented and applied to speech signals in order to estimate Formant/Bandwidth values. The underlying model decomposes a signal into complex damped sinusoids. The algorithm is applied not only on speech samples but on a small amount of the autocorrelation coefficients of a spe...
متن کاملHigh Dimensional Dataset Compression Using Principal Components
Until recently, computational power was insufficient to diagonalize atmospheric datasets of order 10 10 elements. Eigenanalysis of tens of thousands of variables now can achieve massive data compression for spatial fields with strong correlation properties. Application of eigenanalysis to 26,394 variable dimensions, for three severe weather datasets (tornado, hail and wind) retains 9 11 princip...
متن کاملComplex Eigenvalues for Binary Subdivision Schemes
Convergence properties of binary stationary subdivision schemes for curves have been analyzed using the techniques of z-transforms and eigenanalysis. Eigenanalysis provides a way to determine derivative continuity at specific points based on the eigenvalues of a finite matrix. None of the well-known subdivision schemes for curves have complex eigenvalues. We prove when a convergent scheme with ...
متن کاملEfficient Computation of Recursive Principal Component Analysis for Structured Input
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...
متن کاملParallel eigenanalysis of multiaquifer systems
Finite element discretizations of flow problems involving multiaquifer systems deliver large, sparse, unstructured matrices, whose partial eigenanalysis is important for both solving the flow problem and analysing its main characteristics. We studied and implemented an effective preconditioning of the Jacobi–Davidson algorithm by FSAI-type preconditioners. We developed efficient parallelization...
متن کامل