CBM-Gen+: An Algorithm for Reducing Case Base Inconsistencies in Hierarchical and Incomplete Domains

نویسندگان

  • Ke Xu
  • Hector Muñoz-Avila
چکیده

We propose an algorithm, CBM-Gen+, to refine case bases for hierarchical and incomplete domains. In these domains, the case bases are the main source of domain information because of the absence of a complete domain theory. CBM-Gen+ revises the existing cases when a new solution is captured. The main purpose of this revision is to reduce inconsistencies in the cases. We will prove that CBM-Gen+ is sound relative to the captured solutions. We also perform experiments showing that CBM-Gen+ is on average at least as efficient as a previous approach for constructing case bases for hierarchical domains.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complete / Incomplete Hierarchical Hub Center Single Assignment Network Problem

In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs.  The second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete net...

متن کامل

A Fuzzy C-means Algorithm for Clustering Fuzzy Data and Its Application in Clustering Incomplete Data

The fuzzy c-means clustering algorithm is a useful tool for clustering; but it is convenient only for crisp complete data. In this article, an enhancement of the algorithm is proposed which is suitable for clustering trapezoidal fuzzy data. A linear ranking function is used to define a distance for trapezoidal fuzzy data. Then, as an application, a method based on the proposed algorithm is pres...

متن کامل

A Multi-Objective Evolutionary Algorithm Fitness Function for Case-Base Maintenance

Case-Base Maintenance (CBM) has two important goals. On the one hand, it aims to reduce the size of the case-base. On the other hand, it has to improve the accuracy of the CBR system. CBM can be represented as a multi-objective optimization problem to achieve both goals. Multi-Objective Evolutionary Algorithms (MOEAs) have been recognised as appropriate techniques for multi-objective optimisati...

متن کامل

ناحیه جواب جدید برای حل مدل برنامه ریزی خطی بازه ای

We consider interval linear programming (ILP) problems in the current paper. Best-worst case (BWC) is one of the methods for solving ILP models. BWC determines the values ​​of the target function, but some of the solutions obtained through BWC may result in an infeasible space. To guarantee that solution is completely feasible (i.e. avoid constraints violation), improved two-step method (ITSM) ...

متن کامل

Automatic Problem Generation in Constraint-Based Tutors

Constraint-Based Modelling (CBM) is a student modelling technique that is rapidly maturing. We have implemented several tutors using CBM and demonstrated its suitability to open-ended domains in particular. A problem with open-ended and complex domain models is their large size, necessitating a comprehensive problem set in order to provide sufficient exercises for extended learning sessions. We...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003