Abstract
Knowledge in a case-based reasoning (CBR) system is often more extensive than simply the cases, therefore knowledge engineering may still be very demanding. This paper offers a first step towards an automated knowledge acquisition and refinement tool for non-case CBR knowledge. A data-driven approach is presented where a Genetic Algorithm learns effective feature selection for inducing case-base index, and feature weights for similarity measure for case retrieval. The optimisation can be viewed as knowledge acquisition or maintenance depending on whether knowledge is being created or refined. Optimising CBRretrieval is achieved using cases from the case-base and only minimal expert input, and so can be easily applied to an evolving case-base or a changing environment. Experiments with a real tablet formulation problem show the gains of simultaneously optimising the index and similarity measure. Provided that the available data represents the problem domain well, the optimisation has good generalisation properties and the domain knowledge extracted is comparable to expert knowledge.
This work is supported by EPSRC grant GR/L98015 awarded to Susan Craw.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Aha. Feature weighting for lazy learning algorithms. In H. Liu and H. Motoda, (editors), Feature Extraction, Construction and Selection: A Data Mining Perspective. Norwell MA: Kluwer, 1998.
D. W. Aha and R. L. Bankert. Feature selection for case-based classification of cloud types: An empirical comparison. In Proceedings of the AAAI-94 Workshop on Case-Based Reasoning, pages 106–112. AAAI Press, Seattle, 1994.
H. Almuallim and T. G. Dietterich. Efficient algorithms for identifying relevant features. In Proceedings of the Ninth Conference on Artificial Intelligence, pages 38–45. Morgan Kaufman, Vancouver, 1992.
A. L. Blum and P. Langley. Selection of relevant features and examples in machine learning. Artificial Intelligence, 97(1–2):245–271, 1997.
C. Cardie. Using decision trees to improve case-based learning. In Proceedings of the 10th ICML, pages 25–32. Morgan Kaufmann, 1993.
S. Craw, N. Wiratunga, and R. Rowe. Case-based design for tablet formulation. In Proceedings of the Fourth European Workshop on Case-Based Reasoning, pages 358–369, Dublin, Eire, 1998. Springer.
P. Cunningham and A. Bonzano. Knowledge engineering issues in developing a case-based reasoning application. Knowledge-Based Systems, 12, 1999.
J. Jarmulak and S. Craw. Genetic algorithms for feature selection and weighting. In S. S. Anand, A. Aamodt, and D. W. Aha, (editors), IJCAI-99 Workshop on Automating the Construction of Case-Based Reasoners, pages 28–33, 1999.
G. John, R. Kohavi, and K. Pfleger. Irrelevant features and the subset selection problem. In W. W. Cohen and H. Hirsh, (editors), Machine Learning: Proceedings of the 11th International Conference, pages 121–129. Morgan Kaufmann, 1994.
J. D. Kelly and L. Davis. A hybrid genetic algorithm for classification. In Proceedings of the 12th IJCAI, pages 645–650, Sidney, Australia, 1991.
R. Kohavi, P. Langley, and Y. Yun. The utility of feature weighting in nearest-neighbor algorithms. In Proceedings of the European Conference on Machine Learning (ECML-97), 1997.
I. Kononenko. Estimating attributes: Analysis and extenstions of relief. In Proceedings of the European Conference on Machine Learning (ECML-94), Catania, Italy, 1994.
G. Oatley, J. Tait, and J. MacIntyre. A case-based reasoning tool for vibration analysis. In R. Milne, A. Macintosh, and M. Bramer, (editors), Applications and Innovations in Expert Systems VI: Proceedings of the BCS Expert Systems’ 98 Conference, pages 132–146, Cambridge, December1998, 1998. Springer-Verlag.
M. M. Richter. Introduction. In M. Lenz, B. Bartsch-Spörl, H.-D. Burkhard, and S. Wess, (editors), Case-Based Reasoning Technology: From Foundations to Applications, Lecture Notes in Artificial Intelligence 1400. Springer Verlag, 1998.
D. B. Skalak. Prototype and feature selection by sampling and random mutation hill-climbing algorithms. In Proceedings of the Eleventh International Conference on Machine Learning, pages 293–301, New Brunswick, New Jersey, 1994.
D. Wettchereck and D. W. Aha. Weighting features. In Proceedings of the 1st International Conference on CBR (ICCBR-95), pages 347–358, 1995.
D. R. Wilson and T. R. Martinez. Instance-based learning with genetically derived attribute weights. In Proceedings of the International Conference on Artificial Intelligence, Expert Systems, and Neural Networks (AIE’96), pages 11–14, 1996.
D. R. Wilson and T. R. Martinez. Improved heterogenous distance functions. Journal of Artificial Intelligence Research, 6:1–34, 1997.
J. Yang and V. Honavar. Feature subset selection using a genetic algorithm. In Motoda and Liu, (editors), Feature Extraction, Construction and Selection-A Data Mining Perspective. Kluwer, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jarmulak, J., Craw, S., Rowe, R. (2000). Genetic Algorithms to Optimise CBR Retrieval. In: Blanzieri, E., Portinale, L. (eds) Advances in Case-Based Reasoning. EWCBR 2000. Lecture Notes in Computer Science, vol 1898. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44527-7_13
Download citation
DOI: https://doi.org/10.1007/3-540-44527-7_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67933-2
Online ISBN: 978-3-540-44527-2
eBook Packages: Springer Book Archive