An Incremental Rough Set Based Rule Induction

碩士 === 國立暨南國際大學 === 資訊管理學系 === 95 === The incremental technique is a way to solve the issue of new added-in data without re-implementing the DM algorithm in a dynamic database. There are numerous studies of incremental rough set based approach. However, these approaches are applied to traditional ro...

Full description

Bibliographic Details
Main Authors: Fan, Yu-Neng, 范有寧
Other Authors: Huang, Chun-Che
Format: Others
Language:en_US
Published: 2007
Online Access:http://ndltd.ncl.edu.tw/handle/47309707196271191469
Description
Summary:碩士 === 國立暨南國際大學 === 資訊管理學系 === 95 === The incremental technique is a way to solve the issue of new added-in data without re-implementing the DM algorithm in a dynamic database. There are numerous studies of incremental rough set based approach. However, these approaches are applied to traditional rough set based rule induction, which often generate too many rules without focus and can not guarantee that the classification of a decision table is credible. Moreover, these previous literature of incremental approaches are not capable to deal with the problems of large database. In this paper, an incremental rule-extraction algorithm based on the REA of Professor Tseng is proposed to solve the aforementioned problem. Using this algorithm, when a new object is added up to information system, it is unnecessary to re-compute rule sets from the very beginning. The proposed approach updates rule sets by partly modifying original rule sets, hence a lot of time are saved, and it is especially useful when extracting rules from large databases.