Using k-d trees to improve the retrieval step in case-based reasoning
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 167-181
- https://doi.org/10.1007/3-540-58330-0_85
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Goal-driven similarity assessmentPublished by Springer Nature ,2005
- Similarity, Uncertainty and Case-Based Reasoning in PatdexPublished by Springer Nature ,1991
- Strategies for efficient incremental nearest neighbor searchPattern Recognition, 1990
- Models of incremental concept formationArtificial Intelligence, 1989
- Toward memory-based reasoningCommunications of the ACM, 1986
- Data Structures and Algorithms 3Published by Springer Nature ,1984
- LEARNING EFFICIENT CLASSIFICATION PROCEDURES AND THEIR APPLICATION TO CHESS END GAMESPublished by Elsevier ,1983
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- Features of similarity.Psychological Review, 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975