Towards a Better Understanding of Memory-Based Reasoning Systems
Abstract
We quantify both experimentally and analytically the performance of memory-based reasoning (MBR) algorithms. To start gaining insight into the capabilities of MBR algorithms, we compare an MBR algorithm using a value difference metric to a popular Bayesian classifier. These two approaches are similar in that they both make certain independence assumptions about the data. However, whereas MBR uses specific cases to perform classification, Bayesian methods summarize the data probabilistically. We demonstrate that a particular MBR system called PEBLS works comparatively well on a wide range of domains using both real and artificial data. With respect to the artificial data, we consider distributions where the concept classes are separated by functional discriminants, as well as time-series data generated by Markov models of varying complexity. Finally, we show formally that PEBLS can learn (in the limit) natural concept classes that the Bayesian classifier cannot learn, and that it will attain perfect accuracy whenever Bayes does.
Cite
Text
Rachlin et al. "Towards a Better Understanding of Memory-Based Reasoning Systems." International Conference on Machine Learning, 1994. doi:10.1016/B978-1-55860-335-6.50037-4Markdown
[Rachlin et al. "Towards a Better Understanding of Memory-Based Reasoning Systems." International Conference on Machine Learning, 1994.](https://mlanthology.org/icml/1994/rachlin1994icml-better/) doi:10.1016/B978-1-55860-335-6.50037-4BibTeX
@inproceedings{rachlin1994icml-better,
title = {{Towards a Better Understanding of Memory-Based Reasoning Systems}},
author = {Rachlin, John and Kasif, Simon and Salzberg, Steven and Aha, David W.},
booktitle = {International Conference on Machine Learning},
year = {1994},
pages = {242-250},
doi = {10.1016/B978-1-55860-335-6.50037-4},
url = {https://mlanthology.org/icml/1994/rachlin1994icml-better/}
}