Virtual attribute subsetting
Horton, M and Cameron-Jones, M and Williams, R (2006) Virtual attribute subsetting. In: 19th Australian Joint Conference on Artificial Intelligence, 04-08 Dec 2006, Hobart, Australia.
|PDF - Full text restricted - Requires a PDF viewer|
Official URL: http://www.springerlink.com/content/wk5r285q58488v3q/
Attribute subsetting is a meta-classification technique, based on learning multiple base-level classifiers on projections of the training data. In prior work with nearest-neighbour base classifiers, attribute subsetting was modified to learn only one classifier, then to selectively ignore attributes at classification time to generate multiple predictions. In this paper, the approach is generalized to any type of base classifier. This 'virtual attribute subsetting' requires a fast subset choice algorithm; one such algorithm is found and described. In tests with three different base classifier types, virtual attribute subsetting is shown to yield some or all of the benefits of standard attribute subsetting while reducing training time and storage requirements.
|Item Type:||Conference or Workshop Item (Paper)|
|Keywords:||Machine learning, Classifier learning, Meta-classification|
|Deposited By:||Mr Michael Horton|
|Deposited On:||29 Nov 2006|
|Last Modified:||23 Oct 2012 10:48|
|ePrint Statistics:||View statistics for this ePrint|
Repository Staff Only: item control page