New Incremental Inductive Learning Algorithm in the Framework of Rough Set Theory

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 373
  • Download : 0
In this paper we will discuss a type of inductive learning called learning from examples, whose task is to induce general descriptions of concepts from specific instances of these concepts. In many real life situations, however, new instances can be added to the set of instances. It is first proposed within the framework of rough set theory, for such cases, an algorithm to find minimal set of rules for decision tables without recalculation for overall set of instances. The method of learning presented here is based on a rough set concept proposed by Pawlak[2][11]. It is shown an algorithm to find minimal set of rules using reduct change theorems giving criteria for minimum recalculation with an illustrative example. Finally, the proposed learning algorithm is applied to fuzzy system to learn sampled I/O data.
Publisher
Taiwan Fuzzy Systems Assoc
Issue Date
1999-09
Language
English
Citation

INTERNATIONAL JOURNAL OF FUZZY SYSTEMS, v.1, no.1, pp.25 - 36

ISSN
1562-2479
URI
http://hdl.handle.net/10203/78235
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0