English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. Item Summary / 
  2. View item

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Diversity-conscious Retrieval from Generalized Cases: A Branch and Bound Algorithm

Mougouie, B., Richter, M. M., & Bergmann, R. (2003). Diversity-conscious Retrieval from Generalized Cases: A Branch and Bound Algorithm. In Case-based reasoning research and development (pp. 319-331). Berlin: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2CBD-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0026-A3DB-C
Genre: Conference Paper

Files

show Files
hide Files
:
mougouie.ps (Publisher version), 625KB
 
File Permalink:
-
Name:
mougouie.ps
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/postscript
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Mougouie, Babak1, Author           
Richter, Michael M.2, Author
Bergmann, Ralph2, Author
Ashley, Kevin D.2, Editor
Bridge, Derek G.2, Editor
Affiliations:
1Discrete Optimization, MPI for Informatics, Max Planck Society, ou_1116548              
2External Organizations, ou_persistent22              

Content

show
hide
Free keywords: -
 Abstract: Recommendation systems offer the most similar point cases to a target query. Among those cases similar to the query, some may be similar and others dissimilar to each other. Offering only the most similar cases wrt. the query leads to the well known problem that the customers may have only a few number of choices. To address the problem of offering a diverse set of cases, several approaches have been proposed. In a different line of CBR research, the concept of generalized cases has been systematically studied, which can be applied to represent parameterizable products. First approaches to retrieving the most similar point cases from a case base of generalized cases have been proposed. However, until now no algorithm is known to retrieve a diverse set of point cases from a case base of generalized cases. This is the topic of this paper. We present a new branch and bound method to build a retrieval set of point cases such that its diversity is sufficient and each case in the retrieval set is a representative for a set of similar point cases.

Details

show
hide
Language(s): eng - English
 Dates: 2004-07-012003
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 202015
Other: Local-ID: C1256BDD00205AD6-1560C3DD46D03A30C1256D17002F85ED-Mougouie2003
DOI: 10.1007/3-540-45006-8_26
 Degree: -

Event

show
hide
Title: 5th International Conference on Case-Based Reasoning
Place of Event: Trondheim, Norway
Start-/End Date: 2003-06-23 - 2003-06-26

Legal Case

show

Project information

show

Source 1

show
hide
Title: Case-based reasoning research and development
  Abbreviation : ICCBR 2003
  Subtitle : 5th International Conference on Case-Based Reasoning, ICCBR 2003 Trondheim, Norway, June 23–26, 2003 Proceedings
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 319 - 331 Identifier: ISBN: 3-540-40433-3

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2689 Sequence Number: - Start / End Page: - Identifier: -