Kernel entropy discriminant analysis for dimension reduction
From MaRDI portal
Recommendations
- A conditional entropy minimization criterion for dimensionality reduction and multiple kernel learning
- Regularized discriminant entropy analysis
- A modification of kernel discriminant analysis for high-dimensional data-with application to face recognition
- Nonlinear Discriminant Analysis Using Kernel Functions and the Generalized Singular Value Decomposition
- Application of kernel density estimation of full bandwidth matrix in kernel entropy component analysis
Cites work
- Classifier evaluation and attribute selection against active adversaries
- Dueling algorithms
- scientific article; zbMATH DE number 1099353 (Why is no real title available?)
- Information theoretic learning. Renyi's entropy and kernel perspectives
- Machine learning in adversarial environments
- Modeling the shape of the scene: A holistic representation of the spatial envelope
- On Estimation of a Probability Density Function and Mode
- Pattern classification.
- RELATIONS BETWEEN TWO SETS OF VARIATES
- The empirical behavior of sampling methods for stochastic programming
- The sample average approximation method applied to stochastic routing problems: a computational study
- Understanding machine learning. From theory to algorithms
Cited in
(5)- Kernel based multiscale partial Renyi transfer entropy and its applications
- Effective dimensionality reduction using kernel locality preserving partial least squares discriminant analysis
- A conditional entropy minimization criterion for dimensionality reduction and multiple kernel learning
- On the Choice of the Kernel Function in Kernel Discriminant Analysis Using Information Complexity
- Application of kernel density estimation of full bandwidth matrix in kernel entropy component analysis
This page was built for publication: Kernel entropy discriminant analysis for dimension reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045350)