Skip to main content

An Active Learning Formulation for Instance Selection with Applications to Object Detection

  • Chapter
Instance Selection and Construction for Data Mining

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 608))

  • 286 Accesses

Abstract

In certain real-world learning scenarios where there are enormous amounts of training data, the training process can become computationally intractable. Researchers have attempted to address this problem by performing instance selection, which is to automatically identify and preserve a sufficiently small but highly informative data sample for training. In most classical formulations of example-based learning, the learner passively receives randomly drawn training examples from which it recovers the unknown target function. Active Learning describes a different example-based learning paradigm where the learner explicitly seeks for new training examples of high utility, and can thus be viewed as a form of instance selection. This chapter presents a Bayesian formulation for active learning within a classical function approximation learning framework, and shows how one can derive precise example selection algorithms for learning some simple target function classes more accurately with less training data. We then present a real-world learning scenario on object (face) detection, and show how our active learning formulation leads to a useful instance selection heuristic for identifying and retaining high utility training data.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aha, D. W., Kibler, D., and Albert, M. K. (1991). Instance-based Learning Algorithms. Machine Learning, 6:37–66.

    Google Scholar 

  • Bertero, M. (1986). Regularization Methods for Linear Inverse Problems. In C. Talenti, ed, Inverse Problems. Sprg-Vrlg.

    Google Scholar 

  • Blum, A. and Langley, P. (1997). Selection of Relevant Features and Examples in Machine Learning. Artificial Intelligence, 97:245–271.

    Article  MathSciNet  MATH  Google Scholar 

  • Cohn, D. (1991). A Local Approach to Optimal Queries. In D. Touretzky, editor, In Proc. Connectionist Summer School.

    Google Scholar 

  • Duda, R. and Hart, P. (1973). Pattern Classification and Scene Analysis. John Wiley and Sons Inc., New York.

    MATH  Google Scholar 

  • Fayyad, U., Piatetsky-Shapiro, G. and Smyth, P. (1996). From Data Mining to Knowledge Discovery: An Overview. In Proc. Advances in KDD.

    Google Scholar 

  • Fedorov, V. (1972). Theory of Optimal Experiments. Academic Press.

    Google Scholar 

  • MacKay, D. (1992). Bayesian Methods for Adaptive Models. PhD thesis, California Institute of Technology, USA.

    Google Scholar 

  • Musick, R., Catlett, J. and Russel, S. (1993). Decision Theoretic Subsampling for Induction on Large Databases. In Proc. International Conference on Machine Learning.

    Google Scholar 

  • Poggio, T. and Girosi, F. (1989). A Theory of Networks for Approximation and Learning. AIM-1140, MIT AI Lab.

    Google Scholar 

  • Rumelhart, D. and McClelland, J. (1986) Parallel Distributed Processing, volume 1. MIT Press.

    Google Scholar 

  • Sollich, P. (1994). Query Construction, Entropy, Generalization in Neural Network Models. Physical Review E, 49:4637–4651.

    Article  Google Scholar 

  • Sung, K. and Niyogi, P. (1996). A Formulation for Active Learning with Appl. to Obj. Detection. AIM-1438, MIT-AI.

    Google Scholar 

  • Sung, K. and Poggio, T. (1998). Example-based Learning for View-based Human Face Detection. IEEE. Trans. Pattern Analysis and Machine Intelligence, 20:1.

    Article  Google Scholar 

  • Syed, N., Liu, H. and Sung, K. (1999). A Study of SVMs on Model Independent Example Selection. In Proc. SIGKDD.

    Google Scholar 

  • Tikhonov, A. and Arsenin, V. (1977). Solutions of Ill-Posed Problems. W. H. Winston, Washington, DC.

    MATH  Google Scholar 

  • Valiant, L. (1984). A Theory of Learnable. In Pr. STOC.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Sung, KK., Niyogi, P. (2001). An Active Learning Formulation for Instance Selection with Applications to Object Detection. In: Liu, H., Motoda, H. (eds) Instance Selection and Construction for Data Mining. The Springer International Series in Engineering and Computer Science, vol 608. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3359-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3359-4_20

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4861-8

  • Online ISBN: 978-1-4757-3359-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics