Precision and recall in interactive case-based reasoning

MaRDI QIDQ2779856zbMATH OpenFDO

Authors David McSherry

Publication date 15 April 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2080/20800392

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Review text

Often in interactive case-based reasoning (CBR), the case library is \textit{irreducible} in the sense that the deletion of a single case means that a unique product or fault is no longer represented in the case library. We present empirical measures of precision and recall for irreducible case libraries, identify sources of imperfect precision and recall, and establish an upper bound for the level of precision that can be achieved with any retrieval strategy. Finally, we present a retrieval strategy for irreducible case libraries that gives better precision and recall than inductive retrieval or nearest-neighbour retrieval based on the number of matching features in a target case. For the entire collection see [Zbl 0968.68550].

Recommendations

• scientific article; zbMATH DE number 4162257
• A framework for retrieval in case-based reasoning systems
• Case-based reasoning
• Case retrieval nets as a model for building flexible information systems (Thesis, Humboldt-Univ. Berlin, 1999)
• Enhancing the effectiveness of interactive case-based reasoning with clustering and decision forests

Cited in

(3)

• Characterisation of a novel indexing technique for case-based reasoning
• A new approach to applicable memory-based reasoning
• Enhancing the effectiveness of interactive case-based reasoning with clustering and decision forests

This page was built for publication: Precision and recall in interactive case-based reasoning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2779856)