Active Online Classification via Information Maximization
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 1498-1503.
Abstract
We propose an online classification approach for co-occurrence data which is based on a simple information theoretic principle. We further show how to properly estimate the uncertainty associated with each prediction of our scheme and demonstrate how to exploit these uncertainty estimates. First, in order to abstain highly uncertain predictions. And second, within an active learning framework, in order to preserve classification accuracy while substantially reducing training set size. Our method is highly efficient in terms of run-time and memory footprint requirements. Experimental results in the domain of text classification demonstrate that the classification accuracy of our method is superior or comparable to other state-of-the-art online classification algorithms.
@inproceedings{ijcai2011p252,
title = {Active Online Classification via Information Maximization},
author = {Slonim, Noam and Yom-Tov, Elad and Crammer, Koby},
booktitle = {Proceedings of the Twenty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-11}},
publisher = {AAAI Press/International Joint Conferences on Artificial Intelligence},
editor = {Toby Walsh},
pages = {1498--1503},
year = {2011},
month = {7},
doi = {10.5591/978-1-57735-516-8/IJCAI11-252},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-252},
}
TY - CPAPER TI - Active Online Classification via Information Maximization AU - Slonim, Noam AU - Yom-Tov, Elad AU - Crammer, Koby T2 - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11 PB - AAAI Press/International Joint Conferences on Artificial Intelligence PY - 2011 SP - 1498 EP - 1503 DO - 10.5591/978-1-57735-516-8/IJCAI11-252 UR - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-252 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: