There are rules refering to infrequent instances after the procession of attribute reductionand value reduction with traditional methods.A rough set RS based k-exception approach (RSKEA) torule reduction is presented....There are rules refering to infrequent instances after the procession of attribute reductionand value reduction with traditional methods.A rough set RS based k-exception approach (RSKEA) torule reduction is presented.Its main idea lies in a two-phase RS based rule reduction.An ordinarydecision table is attained through general method of RS knowledge reduction in the first phase.Then a k-exception candidate set is nominated according to the decision table.RS rule reduction is employed forthe reformed source data set,which remove all the instances included in the k-exception set.We apply theapproach to the automobile database.Results show that it can reduce the number and complexity of ruleswith adjustable conflict rate,which contributes to approximate rule reduction.展开更多
文摘There are rules refering to infrequent instances after the procession of attribute reductionand value reduction with traditional methods.A rough set RS based k-exception approach (RSKEA) torule reduction is presented.Its main idea lies in a two-phase RS based rule reduction.An ordinarydecision table is attained through general method of RS knowledge reduction in the first phase.Then a k-exception candidate set is nominated according to the decision table.RS rule reduction is employed forthe reformed source data set,which remove all the instances included in the k-exception set.We apply theapproach to the automobile database.Results show that it can reduce the number and complexity of ruleswith adjustable conflict rate,which contributes to approximate rule reduction.
