Drexel University Home Pagewww.drexel.edu DREXEL UNIVERSITY LIBRARIES HOMEPAGE >>

iDEA: Drexel E-repository and Archives > Drexel Academic Community > College of Information Science and Technology > Faculty Research and Publications (IST) > Using typicality theory to select the best match

Please use this identifier to cite or link to this item: http://hdl.handle.net/1860/2049

Title: Using typicality theory to select the best match
Authors: Weber, Rosina O.
Barcia, Ricardo Miranda
Martins, Alejandro
Pacheco, Roberto
Issue Date: 1996
Publisher: Springer Verlag
Citation: Paper presented at The 3rd European Workshop on Case-Based Reasoning, EWCBR-96: pp. 445-459.
Abstract: This paper focuses on the problem of choosing the best match among a set of retrieved cases. The Select step is subtask of case retrieval that produces the case that suggests the solution for the input case. There are many different ways to accomplish this task and we propose an automatic means for it. Following the original motivation of paralleling the human similarity heuristic we argue that the selection of the best match is performed by humans choosing the solution that best represents the set of candidate solutions retrieved. The solution that best represent a given data set is the “most typical” solution. Therefore, we describe an application in a Case-Based Reasoning system using the Theory of Typicality to calculate the Most Typical Value of a given set to automatically perform the Select task. An example illustrates the application.
URI: http://hdl.handle.net/1860/2049
Appears in Collections:Faculty Research and Publications (IST)

Files in This Item:

File Description SizeFormat
2006175321.pdf106.48 kBAdobe PDFView/Open
View Statistics

Items in iDEA are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! iDEA Software Copyright © 2002-2010  Duraspace - Feedback