Feature Selection with Kernel Class Separability
Classification can often benefit from efficient feature selection. However, the presence of linearly nonseparable data, quick response requirement, small sample problem and noisy features makes the feature selection quite challenging. In this work, a class separability criterion is developed in a high-dimensional kernel space, and feature selection is performed by the maximization of this criterion. To make this feature selection approach work, the issues of automatic kernel parameter tuning,...[Show more]
|Collections||ANU Research Publications|
|Source:||IEEE Transactions on Pattern Analysis and Machine Intelligence|
|01_Wang_Feature_Selection_with_Kernel_2008.pdf||2.84 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.