A Family of Delphi Components for Case-Based Reasoning

Authors:
Henrik Bergström
Affiliations:
-
Venue:
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Year:
1999

Citing 6
Cited 0

Software metrics (2nd ed.): a rigorous and practical approach

Software metrics (2nd ed.): a rigorous and practical approach
A Review and Empirical Evaluation of Feature Weighting Methods for aClass of Lazy Learning Algorithms

Artificial Intelligence Review - Special issue on lazy learning
Estimating Software Project Effort Using Analogies

IEEE Transactions on Software Engineering
We're all going on a summer holiday: an exercise in non-cardinal case base retrieval

SCAI '97 Proceedings of the sixth Scandinavian conference on Artificial intelligence
A Case Base Similarity Framework

EWCBR '96 Proceedings of the Third European Workshop on Advances in Case-Based Reasoning
Bridging the Gap between Research and Practice in Software Engineering Management: Reflections on the Staffing Factors Paradox

Proceedings of the International Workshop on Experimental Software Engineering Issues: Critical Assessment and Future Directions

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nearest Neighbor (NN) algorithms are one of the more popular approaches to implementing Case-Based Reasoning systems. In this paper a family of Delphi components are presented that implements an NN approach based on the Weighted Euclidean Distance (WED). To make the approach more general the distance measure of WED is implemented by so called Comparators which are specialized components for comparing attribute values.