Fast discriminative stochastic neighbor embedding analysis
Summary: Feature is important for many applications in biomedical signal analysis and living system analysis. A fast discriminative stochastic neighbor embedding analysis (FDSNE) method for feature extraction is proposed in this paper by improving the existing DSNE method. The proposed algorithm adopts an alternative probability distribution model constructed based on its \(K\)-nearest neighbors from the interclass and intraclass samples. Furthermore, FDSNE is extended to nonlinear scenarios using the kernel trick and then kernel-based methods, that is, KFDSNE1 and KFDSNE2. FDSNE, KFDSNE1, and KFDSNE2 are evaluated in three aspects: visualization, recognition, and elapsed time. Experimental results on several datasets show that, compared with DSNE and MSNP, the proposed algorithm not only significantly enhances the computational efficiency but also obtains higher classification accuracy.
- Discriminant sparse neighborhood preserving embedding for face recognition
- Discriminant neighborhood embedding for classification
- Fast Algorithms for the Generalized Foley–Sammon Discriminant Analysis
- Dimensionality reduction by supervised neighbor embedding using Laplacian search
- FAST CLUSTERING-BASED KERNEL FOLEY–SAMMON TRANSFORM
This page was built for publication: Fast discriminative stochastic neighbor embedding analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2262015)