Regularized discriminant entropy analysis

• We propose the regularized discriminant entropy (RDE).
• The RDE is based on the within-class entropy and robust estimation.
• We design a supervised algorithm, regularized discriminant entropy analysis (RDEA).
• RDEA can be regarded as a framework for supervised feature extraction.

In this paper, we propose the regularized discriminant entropy (RDE) which considers both class information and scatter information on original data. Based on the results of maximizing the RDE, we develop a supervised feature extraction algorithm called regularized discriminant entropy analysis (RDEA). RDEA is quite simple and requires no approximation in theoretical derivation. The experiments with several publicly available data sets show the feasibility and effectiveness of the proposed algorithm with encouraging results.