Fundamental Mechanisms in Machine Learning and Inductive Inference

Computer science has historically required programmers of systems to anticipate every possible behavior that could be desired and to program in advance all the knowledge and mechanisms needed to achieve it. Unfortunately, it has been found that such extensive and explicit programing is expensive and it still, in many cases, does not achieve the range of behaviors that might be needed. The only alternative is to have the machines program themselves to acquire the knowledge they need to function satisfactorily. This chapter has described many mechanisms for machine learning and provides an introduction to the field. Additional information can be found in the references and in the textbook on learning edited by Michalski et al. [83].

[1]  Jean-Pierre Jouannaud,et al.  Characterization of a Class of Functions Synthesized from Examples by a SUMMERS Like Method Using a "B.M.W." Matching Technique , 1979, IJCAI.

[2]  Sandara A Mamrak,et al.  Estimation of Run Times using Signature Table Analysis. , 1978 .

[3]  Alan W. Biermann,et al.  The Inference of Regular LISP Programs from Examples , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  A. L. Samuel,et al.  Some studies in machine learning using the game of checkers. II: recent progress , 1967 .

[5]  Alan W. Biermann,et al.  Speeding up the Synthesis of Programs from Traces , 1975, IEEE Transactions on Computers.

[6]  Phillip D. Summers,et al.  A Methodology for LISP Program Construction from Examples , 1977, J. ACM.

[7]  J. Ross Quinlan,et al.  Learning Efficient Classification Procedures and Their Application to Chess End Games , 1983 .

[8]  Steve Hardy,et al.  Synthesis Of LISP Functions From Examples , 1975, IJCAI.

[9]  William J. Clancey,et al.  Overview of the Odysseus learning apprentice , 1986 .

[10]  Geoffrey E. Hinton,et al.  Learning and relearning in Boltzmann machines , 1986 .

[11]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[12]  King-Sun Fu,et al.  Syntactic Methods in Pattern Recognition , 1974, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  Philip Klahr,et al.  Design issues for exemplary programming , 1980 .

[14]  Alan W. Biermann,et al.  A Production Rule Mechanism for Generating LISP Code , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[15]  Jerome A. Feldman,et al.  On the Synthesis of Finite-State Machines from Samples of Their Behavior , 1972, IEEE Transactions on Computers.

[16]  Michael H. Smith.  A learning program which plays partnership dominoes , 1973, CACM.

[17]  Ehud Shapiro,et al.  Algorithmic Program Debugging , 1983 .

[18]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[19]  R. M. Wharton.  Grammar Enumeration and Inference , 1977, Inf. Control..

[20]  Saburo Muroga,et al.  Threshold logic and its applications , 1971 .

[21]  Douglas B. Lenat,et al.  Automated Theory Formation in Mathematics , 1977, IJCAI.

[22]  Alan W. Biermann,et al.  On the Inference of Turing Machines from Sample Computations , 1972, Artif. Intell..

[23]  Donald A. Waterman,et al.  Adaptive Production Systems , 1975, IJCAI.

[24]  Jerome A. Feldman,et al.  Some Decidability Results on Grammatical Inference and Complexity , 1972, Inf. Control..

[25]  Tom M. Mitchell,et al.  Generalization as Search , 2002 .

[26]  Herbert A. Simon,et al.  The Search for Regularity: Four Aspects of Scientific Discovery , 1984 .

[27]  Alan W. Biermann,et al.  Fundamental Mechanisms in Machine Learning and Inductive Inference: Part 2 , 1987, Advanced Topics in Artificial Intelligence.

[28]  J. Hopfield,et al.  Computing with neural circuits: a model. , 1986, Science.

[29]  Alan W. Biermann,et al.  The Correction of Ill-Formed Input Using History-Based Expectation with Applications to Speech Understanding , 1986, Comput. Linguistics.

[30]  Alan W. Biermann,et al.  Signature Table Systems and Learning , 1982, IEEE Transactions on Systems, Man, and Cybernetics.

[31]  Ryszard S. Michalski,et al.  Pattern Recognition as Rule-Guided Inductive Inference , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[32]  Bruce G. Buchanan,et al.  Dendral and Meta-Dendral: Their Applications Dimension , 1978, Artif. Intell..

[33]  Alan W. Biermann,et al.  Constructing Programs from Example Computations , 1976, IEEE Transactions on Software Engineering.

[34]  Alan W. Biermann,et al.  Automatic Program Construction Techniques , 1984 .

[35]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.

[36]  Kathleen Martin,et al.  The Learning Machines. , 1981 .

[37]  Carl V. Page,et al.  Heuristics for Signature Table Analysis as a Pattern Recognition Technique , 1977, IEEE Transactions on Systems, Man, and Cybernetics.