P2P case retrieval with an unspecified ontology

Shlomo Berkovsky, Tsvi Kuflik, Francesco Ricci

Research output: Contribution to journalConference articlepeer-review


Traditional CBR approaches imply centralized storage of the case base and, most of them, the retrieval of similar cases by an exhaustive comparison of the case to be solved with the whole set of cases. In this work we propose a novel approach for storage of the case base in a decentralized Peer-to-Peer environment using the notion of Unspecified Ontology. In our approach the cases are stored in a number of network nodes that is comparable with the number of cases. We also develop an approximated algorithm for efficient retrieval of most-similar cases. The experiments show that the approximated algorithm successfully retrieves the most-similar cases while reducing the number of cases to be compared.

Original languageEnglish
Pages (from-to)91-105
Number of pages15
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
StatePublished - 2005
Event6th International Conference on Case-Based Reasoning, ICCBR 2005 - Chicago, IL, United States
Duration: 23 Aug 200526 Aug 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'P2P case retrieval with an unspecified ontology'. Together they form a unique fingerprint.

Cite this