A translation approach to portable ontology specifications
Knowledge Acquisition - Special issue: Current issues in knowledge modeling
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Applying case-based reasoning: techniques for enterprise systems
Applying case-based reasoning: techniques for enterprise systems
An algorithmic framework for performing collaborative filtering
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Introduction to Multiagent Systems
Introduction to Multiagent Systems
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Cooperative Case-Based Reasoning
ECAI '96 Selected papers from the Workshop on Distributed Artificial Intelligence Meets Machine Learning, Learning in Multi-Agent Environments
Using k-d Trees to Improve the Retrieval Step in Case-Based Reasoning
EWCBR '93 Selected papers from the First European Workshop on Topics in Case-Based Reasoning
The Utility Problem Analysed: A Case-Based Reasoning Perspective
EWCBR '96 Proceedings of the Third European Workshop on Advances in Case-Based Reasoning
A Distributed Case-Based Reasoning Application for Engineering Sales Support
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A Scalable and Ontology-Based P2P Infrastructure for Semantic Web Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
LSH forest: self-tuning indexes for similarity search
WWW '05 Proceedings of the 14th international conference on World Wide Web
An efficient nearest neighbor algorithm for P2P settings
dg.o '05 Proceedings of the 2005 national conference on Digital government research
Answering similarity queries in peer-to-peer networks
Information Systems
Retrieval, reuse, revision and retention in case-based reasoning
The Knowledge Engineering Review
Distributed case-based reasoning
The Knowledge Engineering Review
A hierarchical semantic overlay approach to P2P similarity search
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
Improved heterogeneous distance functions
Journal of Artificial Intelligence Research
Stratified case-based reasoning: reusing hierarchical problem solving episodes
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
Traditional approaches for similarity-based retrieval of structured data, such as Case-Based Reasoning (CBR), have been largely implemented using centralized storage systems. In such systems, when the cases contain both numeric and free-text attributes, similarity-based retrieval cannot exploit standard speedup techniques based on multi-dimensional indexing, and the retrieval is implemented by an exhaustive comparison of the case to be solved with the whole set of stored cases. In this work, we review current research on Peer-to-Peer (P2P) and distributed CBR techniques and propose a novel approach for storage of the case-base in a decentralized Peer-to-Peer environment using the notion of Unspecified Ontology to improve the performance of the case retrieval stage and build CBR systems that can scale up to large case-bases. We develop an algorithm for efficient retrieval of approximated most-similar cases, which exploits inherent characteristics of the unspecified ontology in order to improve the performance of the case retrieval stage in the CBR problem solving cycle. The experiments show that the algorithm successfully retrieves cases close to the most-similar cases, while reducing the number of cases to be compared. Hence, it improves the performance of the retrieval stage. Moreover, the distributed nature of our approach eliminates the computational bottleneck and single point of failure of the centralized storage systems.