Fast Approximated Discriminative Common Vectors Using Rank-One SVD Updates
An efficient incremental approach to the discriminative common vector (DCV) method for dimensionality reduction and classification is presented. The proposal consists of a rank-one update along with an adaptive restriction on the rank of the null space which leads to an approximate but convenient solution. The algorithm can be implemented very efficiently in terms of matrix operations and space complexity, which enables its use in large-scale dynamic application domains. Deep comparative experimentation using publicly available high dimensional image datasets has been carried out in order to properly assess the proposed algorithm against several recent incremental formulations.
Incremental Generalized Discriminative Common Vectors for Image Classification.
Subspace-based methods have become popular due to their ability to appropriately represent complex data in such a way that both dimensionality is reduced and discriminativeness is enhanced. Several recent works have concentrated on the discriminative common vector (DCV) method and other closely related algorithms also based on the concept of null space. In this paper, we present a generalized incremental formulation of the DCV methods, which allows the update of a given model by considering the addition of new examples even from unseen classes. Having efficient incremental formulations of well-behaved batch algorithms allows us to conveniently adapt previously trained classifiers without th…
An overview of incremental feature extraction methods based on linear subspaces
Abstract With the massive explosion of machine learning in our day-to-day life, incremental and adaptive learning has become a major topic, crucial to keep up-to-date and improve classification models and their corresponding feature extraction processes. This paper presents a categorized overview of incremental feature extraction based on linear subspace methods which aim at incorporating new information to the already acquired knowledge without accessing previous data. Specifically, this paper focuses on those linear dimensionality reduction methods with orthogonal matrix constraints based on global loss function, due to the extensive use of their batch approaches versus other linear alter…
An Empirical Evaluation of Common Vector Based Classification Methods and Some Extensions
An empirical evaluation of linear and kernel common vector based approaches has been considered in this work. Both versions are extended by considering directions (attributes) that carry out very little information as if they were null. Experiments on different kinds of data confirm that using this as a regularization parameter leads to usually better (and never worse) results than the basic algorithms.
Null Space Based Image Recognition Using Incremental Eigendecomposition
An incremental approach to the discriminative common vector (DCV) method for image recognition is considered. Discriminative projections are tackled in the particular context in which new training data becomes available and learned subspaces may need continuous updating. Starting from incremental eigendecomposition of scatter matrices, an efficient updating rule based on projections and orthogonalization is given. The corresponding algorithm has been empirically assessed and compared to its batch counterpart. The same good properties and performance results of the original method are kept but with a dramatic decrease in the computation needed.
Image Recognition through Incremental Discriminative Common Vectors
An incremental approach to the discriminative common vector (DCV) method for image recognition is presented. Two different but equivalent ways of computing both common vectors and corresponding subspace projections have been considered in the particular context in which new training data becomes available and learned subspaces may need continuous updating. The two algorithms are based on either scatter matrix eigendecomposition or difference subspace orthonormalization as with the original DCV method. The proposed incremental methods keep the same good properties than the original one but with a dramatic decrease in computational burden when used in this kind of dynamic scenario. Extensive …