Definition
The term Active Learning is generally used to refer to a learningproblem or system where the learner has some role in determining on what data it will be trained. This is in contrast to Passive Learning, where the learner is simply presented with a training set over which it has no control. Active learning is often used in settings where obtaining labeled data is expensive or time-consuming; by sequentially identifying which examples are most likely to be useful, an active learner can sometimes achieve good performance, using far less training data than would otherwise be required.
Structure of Learning System
In many machine learning problems, the training data are treated as a fixed and given part of the problem definition. In practice, however, the training data are often not fixed beforehand. Rather, the learner has an opportunity to play a role in deciding what data will be acquired for training. This process is usually referred to as “active learning,” recognizing that...
This is a preview of subscription content, log in via an institution to check access.
Recommended Reading
Angluin, D. (1987). Learning regular sets from queries and counterexamples. Information and Computation, 75(2), 87–106.
Angluin, D. (1988). Queries and concept learning. Machine Learning, 2, 319–342.
Box, G. E. P., & Draper, N. (1987). Empirical model-building and response surfaces. New York: Wiley.
Cleveland, W., Devlin, S., & Gross, E. (1988). Regression by local fitting. Journal of Econometrics, 37, 87–114.
Cohn, D., Atlas, L., & Ladner, R. (1990). Training connectionist networks with queries and selective sampling. In D. Touretzky (Ed.)., Advances in neural information processing systems. Morgan Kaufmann.
Cohn, D., Ghahramani, Z., & Jordan, M. I. (1996). Active learning with statistical models. Journal of Artificial Intelligence Research, 4, 129–145. http://citeseer.ist.psu.edu/321503.html
Dasgupta, S. (1999). Learning mixtures of Gaussians. Foundations of Computer Science, 634–644.
Fedorov, V. (1972). Theory of optimal experiments. New York: Academic Press.
Kearns, M., Li, M., Pitt, L., & Valiant, L. (1987). On the learnability of Boolean formulae, Proceedings of the 19th annual ACM conference on theory of computing (pp. 285–295). New York: ACM Press.
Lewis, D. D., & Gail, W. A. (1994). A sequential algorithm for training text classifiers. Proceedings of the 17th annual international ACM SIGIR conference (pp. 3–12). Dublin.
McCallum, A., & Nigam, K. (1998). Employing EM and pool-based active learning for text classification. In Machine learning: Proceedings of the fifteenth international conference (ICML’98) (pp. 359–367).
North, D. W. (1968). A tutorial introduction to decision theory. IEEE Transactions Systems Science and Cybernetics, 4(3).
Pitt, L., & Valiant, L. G. (1988). Computational limitations on learning from examples. Journal of the ACM (JACM), 35(4), 965–984.
Robbins, H. (1952). Some aspects of the sequential design of experiments. Bulletin of the American Mathematical Society, 55, 527–535.
Ruff, R., & Dietterich, T. (1989). What good are experiments? Proceedings of the sixth international workshop on machine learning. Ithaca, NY.
Seung, H. S., Opper, M., & Sompolinsky, H. (1992). Query by committee. In Proceedings of the fifth workshop on computational learning theory (pp. 287–294). San Mateo, CA: Morgan Kaufmann.
Steck, H., & Jaakkola, T. (2002). Unsupervised active learning in large domains. In Proceeding of the conference on uncertainty in AI. http://citeseer.ist.psu.edu/steck02unsupervised.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Cohn, D. (2011). Active Learning. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30164-8_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-30164-8_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30768-8
Online ISBN: 978-0-387-30164-8
eBook Packages: Computer ScienceReference Module Computer Science and Engineering