Optimal subset selection for active learning
- Publication Type:
- Conference Proceeding
- Proceedings of the National Conference on Artificial Intelligence, 2011, 2 pp. 1776 - 1777
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Active learning traditionally relies on instance based utility measures to rank and select instances for labeling, which may result in labeling redundancy. To address this issue, we explore instance utility from two dimensions: individual uncertainty and instance disparity, using a correlation matrix. The active learning is transformed to a semi-definite programming problem to select an optimal subset with maximum utility value. Experiments demonstrate the algorithm performance in comparison with baseline approaches. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.
Please use this identifier to cite or link to this item: