Skip to main content

Structured Induction

  • Reference work entry
  • First Online:
Encyclopedia of Machine Learning and Data Mining
  • 113 Accesses

Definition

Structured induction is a method of applying machine learning in which a model for a task is learned using a representation where some of the components are themselves the outputs of learned models for specified sub-tasks. The idea was inspired by structured programming (Dahl et al. 1972), in which a complex task is solved by repeated decomposition into simpler sub-tasks that can be easily analyzed and implemented. The approach was first developed by Alen Shapiro (1987) in the context of constructing expert systems by decision tree learning, but in principle it could be applied using other learning methods.

Motivation and Background

Structured induction is designed to solve complex learning tasks for which it is difficult a priori to obtain a set of attributes or features in which it is possible to represent an accurate approximation of the target hypothesis reasonably concisely. In Shapiro’s approach, a hierarchy of decision trees is learned, where in each tree of the...

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 699.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.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

Recommended Reading

  • Dahl OJ, Dijkstra EW, Hoare CAR (eds) (1972) Structured programming. Academic Press, London

    MATH  Google Scholar 

  • Feigenbaum EA (1977) The art of artificial intelligence: themes and case studies of knowledge engineering. In: Reddy R (ed) Proceedings of the fifth international conference on artificial intelligence (IJCAI’77). William Kaufmann, Los Altos, pp 1014–1029

    Google Scholar 

  • Gaines B (1996) Transforming rules and trees into comprehensible knowledge structures. In: Fayyad U, Piatetsky-Shapiro G, Smyth P, Uthurusamy R (eds) Advances in knowledge discovery and data mining. MIT Press, Cambridge, MA, pp 205–226

    Google Scholar 

  • Michie D (1982) Measuring the knowledge-content of expert programs. Bull Inst Math Appl 18(11/12):216–220

    MathSciNet  Google Scholar 

  • Muggleton S (1987) Duce, an oracle-based approach to constructive induction. In: IJCAI’87. Morgan Kaufmann, Los Altos, pp 287–292

    Google Scholar 

  • Pagallo G, Haussler D (1990) Boolean feature discovery in empirical learning. Mach Learn 5:71–99

    Article  Google Scholar 

  • Quinlan JR (1983) Learning efficient classification procedures and their application to chess end games. In: Michalski R, Carbonnel J, Mitchell T (eds) Machine learning: an artificial intelligence approach. Tioga, Palo Alto, pp 464–482

    Google Scholar 

  • Razzak MA, Hassan T, Pettipher R (1984) Extran-7: a Fortran-based software package for building expert systems. In: Bramer MA (ed) Research and development in expert systems. Cambridge University Press, Cambridge, pp 23–30

    Google Scholar 

  • Shapiro A, Niblett T (1982) Automatic induction of classification rules for a chess endgame. In: Clarke MRB (ed) Advances in computer chess, vol 3. Pergamon Press, Oxford, pp 73–91

    Chapter  Google Scholar 

  • Shapiro AD (1987) Structured induction in expert systems. Turing Institute Press with Addison Wesley, Wokingham

    MATH  Google Scholar 

  • Shawe-Taylor J, Cristianini N (2004) Kernel methods for pattern analysis. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  • Zhang J, Honavar V (2003) Learning decision tree classifiers from attribute value taxonomies and partially specified data. In: ICML-2003: Proceedings of the twentieth international conference on machine learning. AAAI Press, Menlo Park

    Google Scholar 

  • Zheng Z (1995) Constructing nominal X-of-N attributes. In: Proceedings of the fourteenth International joint conference on artificial intelligence (IJCAI’95). Morgan Kaufmann, Los Altos, pp 1064–1070

    Google Scholar 

  • Zupan B, Bohanec M, Demsar J, Bratko I (1999) Learning by discovering concept hierarchies. Artif Intell 109:211–242

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media New York

About this entry

Cite this entry

Bain, M. (2017). Structured Induction. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7687-1_796

Download citation

Publish with us

Policies and ethics