On Bayesian Case Matching

Abstract. Case retrieval is an important problem in several commercially signi cant application areas, such as industrial con guration and manufacturing problems. In this paper we extend the Bayesian probability theory based approaches to case-based reasoning, focusing on the case matching task, an essential part of any case retrieval system. Traditional approaches to the case matching problem typically rely on some distance measure, e.g., the Euclidean or Hamming distance, although there is no a priori guarantee that such measures really re ect the useful similarities and dissimilarities between the cases. One of the main advantages of the Bayesian framework for solving this problem is that it forces one to explicitly recognize all the assumptions made about the problem domain, which helps in analyzing the performance of the resulting system. As an example of an implementation of the Bayesian case matching approach in practice, we demonstrate how to construct a case retrieval system b...

• Type: Conference
• Year: 1998
• Where: EWCBR
• Authors: Petri Kontkanen, Petri Myllymäki, Tomi Silander, Henry Tirri
• Keywords: Automated Reasoning, Bayesian Case, Case Retrieval, Case Retrieval Systems, EWCBR 1998