Incremental Fast Subclass Discriminant Analysis
Not on the map. Why?
Abstract (arXiv)
This paper proposes an incremental solution to Fast Subclass Discriminant Analysis (fastSDA). We present an exact and an approximate linear solution, along with an approximate kernelized variant. Extensive experiments on eight image datasets with different incremental batch sizes show the superiority of the proposed approach in terms of training time and accuracy being equal or close to fastSDA solution and outperforming other methods.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 11 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.