An Experimental Comparison of Symbolic and Connectionist Learning Algorithms
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Machine Learning. Pages 775-779.
Abstract
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.
@inproceedings{ijcai1989p124,
title = {An Experimental Comparison of Symbolic and Connectionist Learning Algorithms},
author = {Mooney, Raymond J. and Shavlik, Jude W. and Towell, Geoffrey G. and Gove, Alan},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {775--779},
year = {1989},
month = {8},
note = {Machine Learning},
url = {https://ijcai.org/proceedings/1989/124},
}
TY - CPAPER TI - An Experimental Comparison of Symbolic and Connectionist Learning Algorithms AU - Mooney, Raymond J. AU - Shavlik, Jude W. AU - Towell, Geoffrey G. AU - Gove, Alan T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 775 EP - 779 UR - https://ijcai.org/proceedings/1989/124 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: