Efficient Classification for Large-scale Problems by Multiple LDA Subspaces

Explore this paper's citation graph

Summary

The main idea is to split the original data into multiple sub-sets and to compute a single LDA space for each sub-set, which means the separability in the obtained subspaces is increased and the overall classification power is improved.

Type
article
Published
2009-01-01
Cited by
11
References
17
Access
Open access

Keywords

Discriminative model, Linear subspace, Computer science, Weighting, Computational complexity theory

References

Cited by

Related papers