Incremental inductive learning algorithm and its performance evaluation: Rough set approach

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 257
  • Download : 0
Classical methods to find a minimal set of rules based on the rough set theory are known to be ineffective in dealing with new instances added to them universe. This paper introduces an inductive teaming algorithm for incrementally retrieving a minimal set of rules from a given decision table. Then, the algorithm is validated via simulations with two sets of data, in comparison with a classical non-incremental algorithm. The simulation results show that the proposed algorithm is effective in dealing with new instances, especially in practical use.
Publisher
AUTOSOFT PRESS
Issue Date
2002
Language
English
Article Type
Article
Citation

INTELLIGENT AUTOMATION AND SOFT COMPUTING, v.8, no.1, pp.15 - 29

ISSN
1079-8587
URI
http://hdl.handle.net/10203/86056
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