Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Developing Industrial Case-Based Reasoning Applications: The Inreca Methodology
Developing Industrial Case-Based Reasoning Applications: The Inreca Methodology
Fast Nearest Neighbor Search in High-Dimensional Space
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Intelligent Sales Support with CBR
Case-Based Reasoning Technology, From Foundations to Applications
Retrieving cases from relational data-bases: another stride towards corporate-wide case-base systems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 2
A Fuzzy Case Retrieval Approach Based on SQL for Implementing Electronic Catalogs
ECCBR '02 Proceedings of the 6th European Conference on Advances in Case-Based Reasoning
Ranking Algorithms for Costly Similarity Measures
ICCBR '01 Proceedings of the 4th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
K Nearest Neighbor Equality: Giving equal chance to all existing classes
Information Sciences: an International Journal
Towards fuzzy query-relaxation for RDF
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
| Hi-index | 0.01 |
This paper presents an approach to realize a case retrieval engine on top of a relational database. In a nutshell the core idea is to approximate a similarity-basedre trieval with SQL-queries. The approach avoids duplicating the case data or compiling index structures and is therefore ideal for huge case bases which are often subject to changes. The presented approach is fully implementeda s part of the commercial CBR toolbox orenge andt he experimental evaluation demonstrates impressive retrieval behaviour.