Learning Cost-Sensitive Active Classifiers
Full Text:
active-class-aij02.pdf 
Most classification algorithms are ``passive'', in that they assign a class label to each instance based only on the description given, even if that description is incomplete. By contrast, an active classifier can --- at some cost --- obtain the values of some unspecified attributes, before deciding upon a class label. This can be useful, for instance, when deciding whether to gather information relevant to a medical procedure or experiment. The expected utility of using an active classifier depends on both the cost required to obtain the values of additional attributes and the penalty incurred if the classifier outputs the wrong classification. This paper analyzes the problem of learning optimal active classifiers, using a variant of the probably-approximately-correct (PAC) model. After defining the framework, we show that this task can be achieved efficiently when the active classifier is allowed to perform only (at most) a constant number of tests. We then show that, in more general environments, this task of learning optimal active classifiers is often intractable.
Citation
R. Greiner,
A. Grove,
D. Roth.
"Learning Cost-Sensitive Active Classifiers".
Artificial Intelligence (AIJ), 139(2), pp 137--174, September 2002.
| Keywords: |
cost-sensitive, classifiers, missing information, PAC, machine learning, active classifier |
| Category: |
In Journal |
BibTeX
@article{Greiner+al:AIJ02,
author = {Russ Greiner and Adam Grove and Dan Roth},
title = {Learning Cost-Sensitive Active Classifiers},
Volume = "139",
Number = "2",
Pages = {137--174},
journal = {Artificial Intelligence (AIJ)},
year = 2002,
}Last Updated: May 30, 2008
Submitted by Nelson Loyola 
