Skip to main content
padlock icon - secure page this page is secure

TOWARD COHERENT MATCHING IN CASE-BASED CLASSIFICATION

Buy Article:

$60.00 + tax (Refund Policy)

Building suitable similarity models presents a key issue in developing case-based classification systems. A good similarity model should reflect the real usefulness of a previous case for solving a new problem. This article proposes a new approach to learning of similarity assessments by optimizing local compatibility functions. The goal is to achieve a set of matching functions that are coherent in the sense of most supportive evidences whereas least inconsistence when applied to the case library. The effectiveness of the presented method has been demonstrated by the evaluation results on a set of data sets in the University of California-Irvine (UCI) Machine Learning Repository.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: case-based classification; compatibility function; genetic algorithm; similarity

Document Type: Research Article

Affiliations: School of Innovation, Design and Engineering, Malardalen University, VasterĂ¥s, Sweden

Publication date: March 1, 2011

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more