An efficient alternative to SVM based recursive feature elimination with applications in natural language processing and bioinformatics
The SVM based Recursive Feature Elimination (RFE-SVM) algorithm is a popular technique for feature selection, used in natural language processing and bioinformatics. Recently it was demonstrated that a small regularisation constant C can considerably impr
|Collections||ANU Research Publications|
|01_Bedo_An_efficient_alternative_to_2006.pdf||384.03 kB||Adobe PDF||Request a copy|
|02_Bedo_An_efficient_alternative_to_2006.pdf||93.93 kB||Adobe PDF||Request a copy|
|03_Bedo_An_efficient_alternative_to_2006.pdf||132.9 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.