Similarity Assessment for Generalizied Cases by Optimization Methods

Mougouie, Babak; Bergmann, Ralph

doi:10.1007/3-540-46119-1_19

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

前へ次へ / 522501

公開

会議論文

Similarity Assessment for Generalizied Cases by Optimization Methods

MPS-Authors

/persons/resource/persons45067

Mougouie, Babak
Discrete Optimization, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Mougouie, B., & Bergmann, R. (2002). Similarity Assessment for Generalizied Cases by Optimization Methods. In S., Craw, & A., Preece (Eds.), Advances in Case-Based Reasoning (pp. 249-263). Berlin: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-30EA-6

要旨

Generalized cases are cases that cover a subspace rather than a point in the problem-solution space. Generalized cases can be represented by a set of constraints over the case attributes. For such representations, the similarity assessment between a point query and generalized cases is a difficult problem that is addressed in this paper. The task is to find the distance (or the related similarity) between the point query and the closest point of the area covered by the generalized cases, with respect to some given similarity measure. We formulate this problem as a mathematical optimization problem and we propose a new cutting plane method which enables us to rank generalized cases according to their distance to the query.