Skip to main content
Log in

Inductive learning: Algorithms and frontiers

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

Machine learning is a major subfield of artificial intelligence. It has been seen as a feasible way of avoiding the knowledge bottleneck problem in knowledge-based systems development. Research on machine learning has concentrated in the main on inductive learning. This paper surveys the current inductive learning research. The three typical inductive algorithms, AQ11, ID3 and HCV, are summarized with their main features being analyzed and three research frontiers, i.e., constructive learning, incremental learning and learning from data bases, in inductive learning are introduced.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Breiman, Y., Friedman, J. H., Olshen, R. A. & Stone, C. J. (1984).Classification and Regression Trees. Wadsworth, Belmont.

    Google Scholar 

  • Brodie, M. L. (1988). Future Intelligent Information Systems: The Combination of Artificial Intelligence and Data Base Technology. InReadings in Artificial Intelligence and Databases.

  • Clark, P. & Niblett, T. (1986).Learning If Then Rules in Noisy Domains. TIRM 86-019, The Turing Institute, Glasgow.

    Google Scholar 

  • Feigenbaum, E. A. (1981). Expert Systems in the 1980s. In Bond, A. (ed.)Infotech State of the Art Report on Machine Intelligence; Maidenhead: Pergamon-Infotech.

    Google Scholar 

  • Hong, J. (1985). AE1: An Extension Matrix Approximate Method for the General Covering Problem.International Journal of Computer and Information Sciences 14(6): 421–437.

    Google Scholar 

  • Hong, J. (1989a). A New Attribute-Based Learning Algorithm GS and a Comparison with Existing Algorithms.Journal of Computer Science and Technology 4: 218–228.

    Google Scholar 

  • Hong, J. (1989b). Learning from Examples and a Multi-Purpose Learning System AE5.Chinese Journal of Computers 12: 98–105.

    Google Scholar 

  • [Hong et al. 86a] Hong, J. R., Michalski, R. S. & Uhrik, C. (1986a). An Extension Matrix Approach to the General Covering Problem. In Gilmore, J. (ed.)Applications of Artificial Intelligence I (Proceedings of SPIE 635); Orlando, Florida, USA.

  • Hong, J. R., Mozetic, I. & Michalski, R. S. (1986b).AQ15: Incremental Learning of Attribute-Based Descriptions from Examples — The Method and User's Guide. Report ISG 85-5, UIUCDCS-F-86-949, Dept. of Computer Science, Univ. of Illinois, Urbana.

    Google Scholar 

  • Hong, J. R. & Uhrik, C. (1987). The Extension Matrix Approach to Attribute-Based Learning. In Bratko, I. & Lavrac, N. (eds.)Progress in Machine Learning: Wimslow: Sigma Press, England.

    Google Scholar 

  • Hunt, E. B., Marin, J. & Stone, P. T. (1966).Experiments in Induction. Academic Press, New York.

    Google Scholar 

  • Jackson, P. (1990).Introduction to Expert Systems, Second Edition. Addison-Wesley.

  • Lenat, D. B. (1979). On Automated Scientific Theory Formation: A Case Study Using the AM Program. In Hayes J.,et al. (eds.)Machine Intelligence 9; New York: Halstead.

    Google Scholar 

  • Lenat, D. B. (1983). EURISKO: A Program that Learns New Heuristics and Domain Concepts — The Nature of Heuristics III: Program Design and Results.Artificial Intelligence 21: 61–98.

    Google Scholar 

  • Matheus, C. (1989). A Constructive Induction Framework. InProceedings of the Sixth International Workshop on Machine Learning. California: Morgan Kauffman.

    Google Scholar 

  • Matheus, C. & Rendell, L. (1989). Constructive Induction on Decision Trees. InProceedings of the Eleventh International Joint Conference on Artificial Intelligence. California: Morgan Kauffman.

    Google Scholar 

  • Mehra, P., Rendell, L. & Wah, B. (1989). Principled Constructive Induction. InProceedings of the Eleventh International Joint Conference on Artificial Intelligence. California: Morgan Kauffman.

    Google Scholar 

  • Michalski, R. S. (1975). Variable-Valued Logic and Its Applications to Pattern Recognition and Machine Learning. In Rine, D. C. (ed.)Computer Science and Multiple-Valued Logic Theory and Applications, 506–534; Amsterdam: North-Holland.

    Google Scholar 

  • Michalski, R. S. & Larson, J. (1978).Selection of Most Representative Training Examples and Incremental Generation of VL1 Hypothesis: the Underlying Methodology and Description of Programs ESEL and AQ11. Tech. Report UIUCDCS-R-78-867, Dept. of Computer Science, Univ. of Illinois at Champaign-Urbana, Urbana.

    Google Scholar 

  • Michalski, R. S. & Chilausky, R. L. (1980). Learning by Being Told and Learning from Examples: An Experimental Comparison of Two Methods of Knowledge Acquisition in the Context of Developing an Expert System for Soybean Disease Diagnosis.International Journal of Policy Analysis and Information Systems 4: 125–161.

    Google Scholar 

  • Michalski, R., Mozetic, I., Hong, J. & Lavrac, N. (1986). The AQ15 Inductive Learning System: An Overview and Experiments. InProceedings of IMAL 1986. Universite de Paris-Sud, Orsay.

    Google Scholar 

  • Michie, D. (1987). Current Developments in Expert Systems. In Quinlan, J. R. (ed.)Applications of Expert Systems; Addison-Wesley.

  • [Mitchell 77] Mitchell, T. (1977). Version Spaces: A Candidate Elimination Approach to Rule Learning. InProceedings of the Fifth International Joint Conference on Artificial Intelligence. Cambridge, Mass.

  • Niblett, T. (1988).Learning New Concepts. Newsletter No. 20, 25–35, The British Computer Society Specialist Group on Expert Systems.

  • Niblett, T. & Bratko, I. (1987). Learning Decision Rules in Noisy Domains. In Bramer, M. A. (ed.)Research and Development in Expert Systems III, 25–34; Cambridge University Press.

  • Núñez, M. (1991). The Use of Background Knowledge in Decision Tree Induction.Machine Learning 6: 231–250.

    Article  Google Scholar 

  • O'Rorke, P. (1982).A Comparative Study of Inductive Learning Systems AQ11P and ID3 Using a Chess End-Game Test Problem. ISG 82-2, Computer Science Department, University of Illinois at Urbana-Champaign, Urbana.

    Google Scholar 

  • Paterson, A. & Niblett, T. (1982).ACLS Manual, Version 1. The Turing Institute, Glasgow.

    Google Scholar 

  • Quinlan, J. R. (1979). Discovering Rules by Induction from Large Collections of Examples. In Michie, D (ed.)Introductory Readings in Expert Systems, 33–46; Gordon and Breach, London.

    Google Scholar 

  • Quinlan, J. R. (1986). Learning from Noisy Data. In Carbonell, J. & Mitchell, T. (eds.)Machine Learning, Vol. 2; Tioga, Palo Alto, USA.

    Google Scholar 

  • [Quinlan 88] Quinlan, J. R. (1988). Induction, Knowledge and Expert Systems. In Gero, J. S. & Stanton, R. (eds.)Artificial Intelligence Developments and Applications, 253–271: North-Holland: Elsevier Science Publishers B. V.

  • Quinlan, J. R. (1989a). Simplifying Decision Trees. In Gaines, B. & Boose, J. (eds.)Knowledge Acquisition for Knowledge Based Systems, Vol. 1; Academic Press.

  • [Quinlan 89b] Quinlan, J. R. (1989b). Requirements for Knowledge Discovery in Databases. InProceedings of IJCAI-89 Workshop on Knowledge Discovery in Databases, xiv. Detroit, USA.

  • Quinlan, J. R. (1991). Knowledge Acquisition from Structured Data: Using Determinate Literals to Assist Search.IEEE Expert 6(6): 32–37.

    Google Scholar 

  • Quinlan, J. R., Horn, K. A. & Lazarus, L. (1986). Inductive Knowledge Acquisition: A Case Study: InProceedings of the Second Australian Conference on the Applications of Expert Systems, 183–204. New South Wales Institute of Technology, Sydney.

    Google Scholar 

  • Schlimmer, J. C. & Fisher, D. (1986). A Case Study of Incremental Concept Induction. InProceedings of the Fifth National Conference on Artificial Intelligence, 496–501. Philadelphia, Morgan Kauffman, USA.

    Google Scholar 

  • Thornton, C. J. (1991).The Complexity of Constructive Learning. Dept. of Artificial Intelligence, Univ. of Edinburgh.

  • Utgoff, P. E. (1989). Incremental Induction of Decision Trees.Machine Learning 4: 161–186.

    Article  Google Scholar 

  • Winston, P. (1970).Learning Structural Description from Examples. Ph.D. Thesis, Mass.: MIT AI Lab.

    Google Scholar 

  • Wirth, J. & Catlett, J. (1988). Experiments on the Costs and Benefits of Windowing in ID3. InProceedings of the Fifth International Conference on Machine Learning. Morgan Kauffman Publishers Inc.

  • Wu, X. (1990a). A Study on Intelligent Data Base Techniques. InProceedings of the First Chinese Joint Conference on Artificial Intelligence, 23–30. Jilin, China.

  • Wu, X. (1990b).Covering Algorithms for Extension Matrix Approach. Tech. Report NNSFC-HUT-CS-68975025-90-5, Hefei University of Technology, China.

    Google Scholar 

  • Wu, X. (1992a). Optimization Problems in Extension Matrixes.Science in China, Series A35: 363–373.

    Google Scholar 

  • Wu, X. (1992b).HCV: A Heuristic Covering Algorithm for Extension Matrix Approach. DAI Research Paper No. 578, Dept. of Artificial Intelligence, Univ. of Edinburgh.

  • Wu, X. (1992c).A Prolog-Based Representation for Integrating Knowledge and Data. DAI Research Paper No. 580, Dept. of Artificial Intelligence, Univ. of Edinburgh.

  • Wu, X. & Zhang, D. (1991). An Approach to Generation of Semantic Network from Relational Database Schema.Chinese Science Bulletin 36: 1222–1225.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, X. Inductive learning: Algorithms and frontiers. Artif Intell Rev 7, 93–108 (1993). https://doi.org/10.1007/BF00849079

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00849079

Key Words

Navigation