Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

An efficient alternative to SVM based recursive feature elimination with applications in natural language processing and bioinformatics

Date

Authors

Bedo, Justin

Sanderson, Conrad

Kowalczyk, Adam

Publisher

Springer

Abstract

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

Keywords

Keywords: Computable limits; Convex optimisation; Microarray classification; Microarray data sets; NAtural language processing; Recursive feature elimination; Straight-forward method; Verification task; Artificial intelligence; Natural language processing systems;

URI

http://hdl.handle.net/1885/27657

Collections

ANU Research Publications

Type

Book Title

AI 2006: Advances in Artificial Intelligence: 19th Australian Joint Conference on Artificial Intelligence, Proceedings

DOI

10.1007/11941439-21

Restricted until

2037-12-31

Downloads

File

Description

01_Bedo_An_efficient_alternative_to_2006.pdf (384.03 KB)

02_Bedo_An_efficient_alternative_to_2006.pdf (93.93 KB)

03_Bedo_An_efficient_alternative_to_2006.pdf (132.9 KB)