An Experimental Comparison of Symbolic and Connectionist Learning Algorithms

Despite the fact that many symbolic and connectionist (neural net) learning algorithms are addressing the same problem of learning from classified examples, very little Is known regarding their comparative strengths and weaknesses. This paper presents the results of experiments comparing the ID3 symbolic learning algorithm with the perceptron and back-propagation connectionist learning algorithms on several large real-world data sets. The results show that ID3 and perceptron run significantly faster than does backpropagation, both during learning and during classification of novel examples. However, the probability of correctly classifying new examples is about the same for the three systems. On noisy data sets there is some indication that backpropagation classifies more accurately.

• Type: Conference
• Year: 1989
• Where: IJCAI
• Authors: Raymond J. Mooney, Jude W. Shavlik, Geoffrey G. Towell, Alan Gove
• Keywords: Connectionist Learning Algorithms, IJCAI 1989, IJCAI 2007, Learning Algorithms, Symbolic Learning Algorithm