Sciweavers

Share
AAAI
2008

Markov Blanket Feature Selection for Support Vector Machines

10 years 6 months ago
Markov Blanket Feature Selection for Support Vector Machines
Based on Information Theory, optimal feature selection should be carried out by searching Markov blankets. In this paper, we formally analyze the current Markov blanket discovery approach for support vector machines and propose to discover Markov blankets by performing a fast heuristic Bayesian network structure learning. We give a sufficient condition that our approach will improve the performance. Two major factors that make it prohibitive for learning Bayesian networks from high-dimensional data sets are the large search space and the expensive cycle detection operations. We propose to restrict the search space by only considering the promising candidates and detect cycles using an online topological sorting method. Experimental results show that we can efficiently reduce the feature dimensionality while preserving a high degree of classification accuracy.
Jianqiang Shen, Lida Li, Weng-Keen Wong
Added 02 Oct 2010
Updated 02 Oct 2010
Type Conference
Year 2008
Where AAAI
Authors Jianqiang Shen, Lida Li, Weng-Keen Wong
Comments (0)
books