Next Article in Journal
Entropy Generation and Natural Convection of CuO-Water Nanofluid in C-Shaped Cavity under Magnetic Field
Next Article in Special Issue
An Optimization Approach of Deriving Bounds between Entropy and Error from Joint Distribution: Case Study for Binary Classifications
Previous Article in Journal
Particular Solutions of the Confluent Hypergeometric Differential Equation by Using the Nabla Fractional Calculus Operator
Previous Article in Special Issue
A New Process Monitoring Method Based on Waveform Signal by Using Recurrence Plot

Classification Active Learning Based on Mutual Information

Department of Electrical and Computer Engineering, Northeastern University, 360 Huntington Ave, Boston, MA 02115, USA
Department of Electrical and Computer Engineering, University of Pittsburgh, 3700 O’Hara Street, Pittsburgh, PA 15261, USA
National Science Foundation, 4201 Wilson Boulevard, Arlington, VA 22230, USA
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Academic Editors: Badong Chen and Jose C. Principe
Entropy 2016, 18(2), 51;
Received: 15 December 2015 / Revised: 28 January 2016 / Accepted: 1 February 2016 / Published: 5 February 2016
(This article belongs to the Special Issue Information Theoretic Learning)
Selecting a subset of samples to label from a large pool of unlabeled data points, such that a sufficiently accurate classifier is obtained using a reasonably small training set is a challenging, yet critical problem. Challenging, since solving this problem includes cumbersome combinatorial computations, and critical, due to the fact that labeling is an expensive and time-consuming task, hence we always aim to minimize the number of required labels. While information theoretical objectives, such as mutual information (MI) between the labels, have been successfully used in sequential querying, it is not straightforward to generalize these objectives to batch mode. This is because evaluation and optimization of functions which are trivial in individual querying settings become intractable for many objectives when we are to select multiple queries. In this paper, we develop a framework, where we propose efficient ways of evaluating and maximizing the MI between labels as an objective for batch mode active learning. Our proposed framework efficiently reduces the computational complexity from an order proportional to the batch size, when no approximation is applied, to the linear cost. The performance of this framework is evaluated using data sets from several fields showing that the proposed framework leads to efficient active learning for most of the data sets. View Full-Text
Keywords: active learning; mutual information; submodular maximization; classification active learning; mutual information; submodular maximization; classification
Show Figures

Figure 1

MDPI and ACS Style

Sourati, J.; Akcakaya, M.; Dy, J.G.; Leen, T.K.; Erdogmus, D. Classification Active Learning Based on Mutual Information. Entropy 2016, 18, 51.

AMA Style

Sourati J, Akcakaya M, Dy JG, Leen TK, Erdogmus D. Classification Active Learning Based on Mutual Information. Entropy. 2016; 18(2):51.

Chicago/Turabian Style

Sourati, Jamshid, Murat Akcakaya, Jennifer G. Dy, Todd K. Leen, and Deniz Erdogmus. 2016. "Classification Active Learning Based on Mutual Information" Entropy 18, no. 2: 51.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Back to TopTop