Sparse kernel density estimations and its application in variable selection based on quadratic Renyi entropy

Authors:
Min Han;Zhiping Liang;Decai Li
Affiliations:
Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, Liaoning 116023, China;Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, Liaoning 116023, China;Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, Liaoning 116023, China
Venue:
Neurocomputing
Year:
2011

Citing 20
Cited 1

Input Feature Selection by Mutual Information Based on Parzen Window

IEEE Transactions on Pattern Analysis and Machine Intelligence
Sparse bayesian learning and the relevance vector machine

The Journal of Machine Learning Research
Feature Selection Based on Mutual Information: Criteria of Max-Dependency, Max-Relevance, and Min-Redundancy

IEEE Transactions on Pattern Analysis and Machine Intelligence
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Feature Extraction Using Information-Theoretic Learning

IEEE Transactions on Pattern Analysis and Machine Intelligence
Resampling methods for parameter-free and robust feature selection with mutual information

Neurocomputing
A Sparse Nonlinear Bayesian Online Kernel Regression

ADVCOMP '08 Proceedings of the 2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences
Adaptive spherical Gaussian kernel in sparse Bayesian learning framework for nonlinear regression

Expert Systems with Applications: An International Journal
Independent component analysis based on gradient equation and kernel density estimation

Neurocomputing
Feature selection with dynamic mutual information

Pattern Recognition
KNN-kernel density-based clustering for high-dimensional multivariate data

Computational Statistics & Data Analysis
Normalized mutual information feature selection

IEEE Transactions on Neural Networks
Sparse Bayesian modeling with adaptive kernel learning

IEEE Transactions on Neural Networks
Effective feature selection scheme using mutual information

Neurocomputing
Kernel bandwidth optimization in spike rate estimation

Journal of Computational Neuroscience
The kernel recursive least-squares algorithm

IEEE Transactions on Signal Processing
Sparse kernel density construction using orthogonal forward regression with leave-one-out test score and local regularization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Probability density estimation from optimally condensed data samples

IEEE Transactions on Pattern Analysis and Machine Intelligence
Independent component analysis based on nonparametric density estimation

IEEE Transactions on Neural Networks
Data classification with radial basis function networks based on a novel kernel density estimation algorithm

IEEE Transactions on Neural Networks

Graph embedding based feature selection

Neurocomputing

Quantified Score

Hi-index	0.01

Visualization

Abstract

A novel sparse kernel density estimation method is proposed based on the sparse Bayesian learning with random iterative dictionary preprocessing. Using empirical cumulative distribution function as the response vectors, the sparse weights of density estimation are estimated by sparse Bayesian learning. The proposed iterative dictionary learning algorithm is used to reduce the number of kernel computations, which is an essential step of the sparse Bayesian learning. With the sparse kernel density estimation, the quadratic Renyi entropy based normalized mutual information feature selection method is proposed. The simulation of three examples demonstrates that the proposed method is comparable to the typical Parzen kernel density estimations. And compared with other state-of-art sparse kernel density estimations, our method also has a shown very good performance as to the number of kernels required in density estimation. For the last example, the Friedman data and Housing data are used to show the property of the proposed feature variables selection method.