Forward feature selection based on approximate markov blanket

Authors:
Min Han;Xiaoxin Liu
Affiliations:
Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, China;Faculty of Electronic Information and Electrical Engineering, Dalian University of Technology, Dalian, China
Venue:
ISNN'12 Proceedings of the 9th international conference on Advances in Neural Networks - Volume Part II
Year:
2012

Citing 6
Cited 0

Wrappers for feature subset selection

Artificial Intelligence - Special issue on relevance
Efficient Feature Selection via Analysis of Relevance and Redundancy

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
Normalized mutual information feature selection

IEEE Transactions on Neural Networks
Strengthening the Forward Variable Selection Stopping Criterion

ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part II
Using mutual information for selecting features in supervised neural net learning

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Feature selection has many applications in solving the problems of multivariate time series . A novel forward feature selection method is proposed based on approximate Markov blanket. The relevant features are selected according to the mutual information between the features and the output. To identify the redundant features, a heuristic method is proposed to approximate Markov blanket. A redundant feature is identified according to whether there is a Markov blanket for it in the selected feature subset or not.The simulations based on the Friedman data, the Lorenz time series and the Gas Furnace time series show the validity of our proposed feature selection method.