TY - JOUR
T1 - Active learning using pessimistic expectation estimators.
AU - Rokach, Lior
AU - Naamani, Lihi
AU - Shmilovici, Armin
N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2009
Y1 - 2009
N2 - Active learning is the process in which unlabeled instances are dynamically selected for expert labelling, and then a classifier is trained on the labeled data. Active learning is particularly useful when there is a large set of unlabeled instances, and acquiring a label is costly. In business scenarios such as direct marketing, active learning can be used to indicate which customer to approach such that the potential benefit from the approached customer can cover the cost of approach. This paper presents a new algorithm for cost-sensitive active learning using a conditional expectation estimator. The new estimator focuses on acquisitions that are likely to improve the profit. Moreover, we investigate simulated annealing techniques to combine exploration with exploitation in the classifier construction. Using five evaluation metrics, we evaluated the algorithm on four benchmark datasets. The results demonstrate the superiority of the proposed method compared to other algorithms.
AB - Active learning is the process in which unlabeled instances are dynamically selected for expert labelling, and then a classifier is trained on the labeled data. Active learning is particularly useful when there is a large set of unlabeled instances, and acquiring a label is costly. In business scenarios such as direct marketing, active learning can be used to indicate which customer to approach such that the potential benefit from the approached customer can cover the cost of approach. This paper presents a new algorithm for cost-sensitive active learning using a conditional expectation estimator. The new estimator focuses on acquisitions that are likely to improve the profit. Moreover, we investigate simulated annealing techniques to combine exploration with exploitation in the classifier construction. Using five evaluation metrics, we evaluated the algorithm on four benchmark datasets. The results demonstrate the superiority of the proposed method compared to other algorithms.
KW - Active learning
KW - Cost-sensitive learning
KW - Decision trees
KW - Direct marketing
UR - https://www.scopus.com/pages/publications/69549135603
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
SN - 0324-8569
VL - 38
SP - 261
EP - 280
JO - Control and Cybernetics
JF - Control and Cybernetics
IS - 1
ER -