Design problem solving: a task analysis
AI Magazine
On the specificity of a possibility distribution
Fuzzy Sets and Systems
Case-based reasoning: business applications
Communications of the ACM
Adaptation-guided retrieval: questioning the similarity assumption in reasoning
Artificial Intelligence
Knowledge intensive exception spaces
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Soft computing in case based reasoning
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Adaptation Cost as a Criterion for Solution Evaluation
EWCBR '96 Proceedings of the Third European Workshop on Advances in Case-Based Reasoning
Dynamically Creating Indices for Two Million Cases: A Real World Problem
EWCBR '96 Proceedings of the Third European Workshop on Advances in Case-Based Reasoning
Efficient Similarity Determination and Case Construction Techniques for Case-Based Reasoning
ECCBR '02 Proceedings of the 6th European Conference on Advances in Case-Based Reasoning
A Connectionist Indexing Approach for CBR Systems
ICCBR '95 Proceedings of the First International Conference on Case-Based Reasoning Research and Development
Evolutionary Case Based Design
Proceedings of the First United Kingdom Workshop on Progress in Case-Based Reasoning
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Representation in case-based reasoning
The Knowledge Engineering Review
Case-based reasoning foundations
The Knowledge Engineering Review
Intelligent index selection for case-based reasoning
Knowledge-Based Systems
Genetic algorithms for approximate similarity queries
Data & Knowledge Engineering
Accelerating k-medoid-based algorithms through metric access methods
Journal of Systems and Software
Optimizing similarity assessment in case-based reasoning
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Using introspective reasoning to refine indexing
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Using evolution programs to learn local similarity measures
ICCBR'03 Proceedings of the 5th international conference on Case-based reasoning: Research and Development
Expert Systems with Applications: An International Journal
An intelligent route management system for electric vehicle charging
Integrated Computer-Aided Engineering
Hi-index | 0.00 |
In this paper we try to improve the retrieval step for case based reasoning for preliminary design. This improvement deals with three major parts of our CBR system. First, in the preliminary design step, some uncertainties like imprecise or unknown values remain in the description of the problem, because they need a deeper analysis to be withdrawn. To deal with this issue, the faced problem description is soften with the fuzzy sets theory. Features are described with a central value, a percentage of imprecision and a relation with respect to the central value. These additional data allow us to build a domain of possible values for each attributes. With this representation, the calculation of the similarity function is impacted, thus the characteristic function is used to calculate the local similarity between two features. Second, we focus our attention on the main goal of the retrieve step in CBR to find relevant cases for adaptation. In this second part, we discuss the assumption of similarity to find the more appropriated case. We put in highlight that in some situations this classical similarity must be improved with further knowledge to facilitate case adaptation. To avoid failure during the adaptation step, we implement a method that couples similarity measurement with adaptability one, in order to approximate the cases utility more accurately. The latter gives deeper information for the reusing of cases. In a last part, we present a generic indexing technique for the base, and a new algorithm for the research of relevant cases in the memory. The sphere indexing algorithm is a domain independent index that has performances equivalent to the decision tree ones. But its main strength is that it puts the current problem in the center of the research area avoiding boundaries issues. All these points are discussed and exemplified through the preliminary design of a chemical engineering unit operation.