Abstract
In this paper, we investigate two novel indexing schemes called D-HS and D-HS+PSR(II) designed for use in case-based reasoning systems. D-HS is based on a matrix of cases indexed by their discretised attribute values. D-HS+PSR(II) extends D-HS by combining the matrix with an additional tree-like indexing structure to allow for solution reuse. D-HS+PSR(II)’s novelty lies in its ability to improve retrieval efficiency over time by reusing previously encountered solution patterns. Benefits include simplicity, accuracy, speed, robustness to missing values and ability to facilitate efficient real time maintenance of retrieval knowledge as the size of the case-base grows. We present empirical results from an analyses of 20 case-bases and demonstrate the techniques to be of similar competency to C4.5 yet much more efficient. Performance advantages over C4.5 are shown to be especially apparent when tested on case-bases which grow in size over time or those with missing values.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aha, D. &Breslow, L. (1997). Refining Conversational Case Libraries. In Proceedings of The 2nd International Conference on Case-based Reasoning, ICCBR-97 , 267–276. Providence RI, USA.
Aha, D. W. &Breslow, L. (1998). Comparing Simplification Procedures for Decision Trees on an Economics Classification Task (Technical Report NRL/FR/5510–98-9881 and crosslisted at NCARAI as AIC-98-009). Naval Research Laboratory, Navy Center for Applied Research in Artificial Intelligence, Washington, DC.
D. Aha L. Breslow H. Munoz-Avila (2001) ArticleTitleConversational Case-Based Reasoning Applied Intelligence 14 IssueID1 9–32
Anand, S., Patterson, D. & Hughes, J. (1998). Knowledge Intensive Exception Spaces. In Proceedings of The 14th National Conference on Artificial Intelligence, 574–579.
S. Cost S. Salzberg (1993) ArticleTitleA Weighted Nearest Neighbour Algorithm for Learning with Symbolic Features Machine Learning 10 57–78
Deangdej, J., Lukose, D., Tsui, E., Beinat, P. & Prophet, L. (1996). Dynamically Creating Indices for Two Million Cases: A Real World Problem. In Smith, I. & Faltings, B. (eds.) Advances in Case-Based Reasoning. Lecture Notes in AI, 105–119. Springer-Verlag: Berlin.
Fox, S. &Leake, D. (1995). Using Introspective Reasoning to Refine Indexing. In Proceedings of The 14th International Joint Conference on Artificial Intelligence , 391–387. Montreal, Canada.
Lenz, M. (1996). Applying Case Retrieval Nets to Diagnostic Tasks in Technical Domains. In Smith, I. & Faltings, B. (eds.) Advances in Case-Based Reasoning. Lecture Notes in Artificial Intelligence, Vol. 1168, 219–233. Springer-Verlag: Berlin, Heidelberg, New York.
JK Martin DS Hirschberg (1995) The Time Complexity of Decision Tree Induction . Technical report, 95–27, Department of Information and Computer Science University of California, Irvine
McSherry, D. (2001). Precision and Recall in Interactive Case-Based Reasoning. In Aha, D. & Watson, I. (eds.) Case-Based Reasoning Research and Development, Vol. 2080, 392–406. Springer Verlag: Berlin, Heidelberg.
S. Nene S. Nayar (1997) ArticleTitleA Simple Algorithm for Nearest Neighbour Search in High Dimensions IEEE Transactions on Pattern Analysis and Machine Intelligence 19 IssueID9 989–1003
D. Patterson S. Anand D. Dubitzky J. Hughes (1999) ArticleTitleTowards Automated Case Knowledge Discovery in the M2 Case-Based Reasoning System Knowledge and Information Systems 1 61–82
Patterson, D., Anand, S., Dubitzky, D. & Hughes, J. (2000). A Knowledge Light Approach to Similarity Maintenance for Improving Case-Based Competence. In Proceedings of The 14th European Conference on Artificial Intelligence, Workshop on Flexible Strategies for Maintaining Knowledge Containers, 65–77.
Patterson, D., Rooney, N. & Galushka, M. (2002a). Efficient Similarity Determination and Case Construction Techniques For Case-Based Reasoning. In Proceedings of The 4th European Conference on CBR, 292–305.
Patterson, D., Rooney, N. &Galushka, M. (2002b). Towards Dynamic Maintenance of Retrieval Knowledge in CBR. In Proceedings of The 15th International FLAIRS Conference . AAAI Press.
J. R. Quinlin (1993) C4.5 Programs for Machine Learning San Meteo, California Morgan Kauffman
Smyth, B. &Cunningham, P. (1996). The Utility Problem Analysed: A Case-Based Reasoning Perspective. In Proceedings of The 3rd European Workshop on Case-Based Reasoning , 392–399. Lausanne, Switzerland.
Smyth, B. &McKenna, E. (1999). Footprint-Based Retrieval. In Proceedings of The 3rd International Conference on Case-Based Reasoning , 343–357, Munich, Germany.
C. Stanfill D. Waltz (1986) ArticleTitleTowards Memory-Based Reasoning Communications of the ACM 29 IssueID12 1213–1228
Wess, S., Althoff, K. &Richter, M. (1993). Using k-d Trees to Improve the Retrieval Step in Case-Based Reasoning. In Proceedings of The 1st European Workshop, Topics in Case-based Reasoning , 67–81. Springer Verlag.
D. Wettschereck D. Aha T. Mohri (1997) ArticleTitleA Review of Empirical Evaluation of Feature Weighting Methods for a Class of Lazy Learning Algorithms Artificial Intelligence Review Journal 11 IssueID1–5 273–314
Witten, I. &Frank, E. (1999). Data Mining: Practival Maching Learning Tools and Techniques with Java Implementations . Morgan Kauffman.
Zhang, Z. & Yang, Q. (1998). Towards Lifetime Maintenance of Case Base Indexes for Continual Case Based Reasoning. In Proceedings of The 8th International Conference on Artificial Intelligence: Methodology, Systems, Applications. Sozopol, Bulgaria.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Patterson, D.W., Galushka, M. & Rooney, N. Characterisation of a Novel Indexing Technique for Case-Based Reasoning. Artif Intell Rev 23, 359–393 (2005). https://doi.org/10.1007/s10462-004-7188-y
Issue Date:
DOI: https://doi.org/10.1007/s10462-004-7188-y