Abstract
In this paper we propose a case base reduction technique which uses a metric defined on the solution space. The technique utilises the Generalised Shepard Nearest Neighbour (GSNN) algorithm to estimate nominal or real valued solutions in case bases with solution space metrics. An overview of GSNN and a generalised reduction technique, which subsumes some existing decremental methods, such as the Shrink algorithm, are presented. The reduction technique is given for case bases in terms of a measure of the importance of each case to the predictive power of the case base. A trial test is performed on two case bases of different kinds, with several metrics proposed in the solution space. The tests show that GSNN can out-perform standard nearest neighbour methods on this set. Further test results show that a caseremoval order proposed based on a GSNN error function can produce a sparse case base with good predictive power.
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
Aha, D. W., “Tolerating noisy, irrelevant and novel attributes in instance-based learning algorithms”, International Journal of Man-Machine Studies, 36, (1992) 267–287.
Aha, D. W., Kibler, D., & Albert, M. K., “Instance-Based Learning Algorithms”, Machine Learning, 6, (1991) 37–66.
Cameron-Jones, R. M., “Instance Selection by Encoding Length Heuristic with Random Mutation Hill Climbing” Proceedings of the Eighth Australian Joint Conference on Artificial Intelligence (1995) 99–106.
Cover, T. M., Hart, P., “Nearest Neighbour Pattern Classification”, IEEE Transactions on Information Theory, 13, (1967) 21–27.
Fisher, R. A., “The use of Multiple Measurements in Taxonomic Problems” Annual Eugenics, 7, Part II, (1936), pp.179–188; also in “Contributions to Mathematical Statistics” (John Wiley, NY, 1950).
Gates, G. W., “The Reduced Nearest Neighbour Rule”, IEEE Transactions on Information Theory, 18(3), (1972) 431–433.
Hanson, R., Allsopp, D., Deng, T., Smith, D., Bradley, M. S. A., Hutchings, I. M., Patel, M. K., “A Model to Predict the Life of Pneumatic Conveyor Bends”, Proc Instn Mech Engrs Vol 216 Part E: J Process Mechanical Engineering, IMechE, (2002) 143–149.
Hart, P.E., “The Condensed Nearest Neighbour Rule”, IEEE Transactions on Information Theory, 14, (1968) 515–516.
Kalman, H., “Attrition of Powders and Granules at Various Bends during Pneumatic Conveying”, Powder Technology 112, Elsevier Science S.A. (2000) 244–250.
Kibler, D. & Aha, D. W., “Learning Representative Exemplars Of Concepts: an Initial Case Study”, Proceedings of the Fourth International Workshop on Machine Learning, Irvine, CA: Morgan Kaufmann (1987) 24–30.
Knight, B., Woon, F., “Case Base Adaptation Using Solution-Space Metrics”, to be appear in: Proceedings of the 18th International Joint Conference on Artificial Intelligence, IJCAI-03, Acapulco, Mexico (2003).
Kolodner, J., “Case Based Reasoning” Morgan Kaufmann Publishers; ISBN: 1558602372; (November 1993).
Mitchell T, “Machine Learning”, McGraw-Hill Series in Computer Science, WCB/McGraw-Hill, USA, (1997) 230–247.
Richter, M., “Case-Based Reasoning: Past, Present, Future”, ICCBR 2001, Vancouver, Canada.
Salamo, M., Golobardes, E., “Deleting and Building Sort Out Techniques for Case Base Maintenance”, LNAI 2416: published by Springer, Germany.6th European Conference, ECCBR-02, September, Aberdeen, Scotland, UK (2002) 365–379.
Shepard, D., “A Two-dimensional Interpolation Function for Irregularly-Spaced Data”, Proceeding of the 23rd National Conference, ACM, (1968) 517–523.
Smyth, B., Keane, M. T., “Remembering to Forget: a Competence-Preserving Deletion Policy for Case-Based Reasoning Systems” In: Proceedings of the 14th International Joint Conference on Artificial Intelligence. Morgan-Kaufmann. (1995) 377–382.
Smyth, B., McKenna, E., “Modeling the Competence of Case-Bases” In: Smyth, B. & Cunningham, P. (eds.): Advances in Case-Based Reasoning. Lecture Notes in Artificial Intelligence, Vol.1488. published by Springer-Verlag, Berlin Heidelberg New York (1998) 208–220
Smyth, B., McKenna, E., “Building Compact Competent Case-Bases” Lecture Notes in Artificial Intelligence, Vol.1650: published by Springer-Verlag. 3rd International Conference on Case-Based Reasoning, ICCBR-99, Seeon Monastery, Germany, (July 1999) 329–342.
Watson, I. D., “Applying Case-Based Reasoning: Techniques for Enterprise Systems”, Morgan Kaufmann Publishers; ISBN: 1558604626; (July 1997).
Wilson, D. R., Martinez, T. R., “Reduction Techniques for Instance-Based Learning Algorithms”, Machine Learning, 38: Published by Kluwer Academic Publishers, Netherlands, (2000) 257–286.
Witten, I. H., Frank, E., “Data Mining”, Practical Machine Learning Tools and Techniques with Java Implementations, Morgan Kaufmann Publishers; (2000) 125–127.
Yang, Q., Zhu, J., “A Case-Addition Policy for Case-Base Maintenance” Computational Intelligence, Vol. 17, No.2, published by Blackwell Publishers, (2001) 250–262.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Woon, F.L., Knight, B., Petridis, M. (2003). Case Base Reduction Using Solution-Space Metrics. In: Ashley, K.D., Bridge, D.G. (eds) Case-Based Reasoning Research and Development. ICCBR 2003. Lecture Notes in Computer Science(), vol 2689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45006-8_49
Download citation
DOI: https://doi.org/10.1007/3-540-45006-8_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40433-0
Online ISBN: 978-3-540-45006-1
eBook Packages: Springer Book Archive