Rough Set-based Incremental Inductive Learning Algorithm - Theory and Applications

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 384
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorBang, Won-Chulko
dc.contributor.authorBien, Zeung namko
dc.date.accessioned2013-03-06T05:35:22Z-
dc.date.available2013-03-06T05:35:22Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2001-12-
dc.identifier.citationINTERNATIONAL JOURNAL OF FUZZY LOGIC AND INTELLIGENT SYSTEMS, v.11, no.7, pp.666 - 674-
dc.identifier.issn1598-2645-
dc.identifier.urihttp://hdl.handle.net/10203/85973-
dc.description.abstractClassical 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 the universe. This paper introduces an inductive learning 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.-
dc.languageEnglish-
dc.publisher한국지능시스템학회-
dc.titleRough Set-based Incremental Inductive Learning Algorithm - Theory and Applications-
dc.typeArticle-
dc.type.rimsART-
dc.citation.volume11-
dc.citation.issue7-
dc.citation.beginningpage666-
dc.citation.endingpage674-
dc.citation.publicationnameINTERNATIONAL JOURNAL OF FUZZY LOGIC AND INTELLIGENT SYSTEMS-
dc.contributor.localauthorBien, Zeung nam-
dc.contributor.nonIdAuthorBang, Won-Chul-
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