A distributed problem-solving approach to inductive learning

Abstract : This paper proposes a distributed approach to the inductive learning problem and present an implementation of the Distributed Learning System (DLS). Our method involves breaking up the data set into different sub-samples, using an inductive learning program (in our cases PLS1) for each sample, and finally synthesizing the results given by each program into a final concept by using a genetic algorithm. We show that such an approach gives significantly better results than using the whole data set on an inductive learning program. We then show how DLS can be generalized to incorporate any learning algorithm and present some of the implications of this approach to DAI (Distributed Artificial Intelligence) systems in general and learning methodologies in particular. Complexity analysis further shows that the time complexity of DLS can be made linear with respect to the size of the problem (data set) irrespective of the time complexity of the learning algorithm it uses.

[1]  Riyaz Sikora,et al.  A double-layered learning approach to acquiring rules for financial classification / 1693 , 1990 .

[2]  Ryszard S. Michalski,et al.  A Theory and Methodology of Inductive Learning , 1983, Artificial Intelligence.

[3]  P. R. Laughlin Collective induction: Group performance, social combination processes, and mutual majority and minority influence. , 1988 .

[4]  James E. Baker,et al.  Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.

[5]  B. Efron The jackknife, the bootstrap, and other resampling plans , 1987 .

[6]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[7]  Randall Davis,et al.  Negotiation as a Metaphor for Distributed Problem Solving , 1988, Artif. Intell..

[8]  Keith S. Decker,et al.  Distributed problem-solving techniques: A survey , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  Kenneth L. Kraemer,et al.  Computer-based systems for cooperative work and group decision making , 1988, CSUR.

[10]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[11]  Tom M. Mitchell,et al.  Version Spaces: A Candidate Elimination Approach to Rule Learning , 1977, IJCAI.

[12]  Randall Davis,et al.  Frameworks for Cooperation in Distributed Problem Solving , 1988, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  Patrick R. Laughlin,et al.  Collective induction: Social combination and sequential transition. , 1985 .