Open AccessProgressive re-sampling for better rule set discovery
Author(s) -
Hyontai Sug
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1334/1/012017
Subject(s) - rough set , data mining , knowledge extraction , dependency (uml) , computer science , property (philosophy) , key (lock) , set (abstract data type) , class (philosophy) , data set , artificial intelligence , machine learning , mathematics , philosophy , computer security , epistemology , programming language
Rough set theory-based knowledge discovery systems have the good property of discovering rule sets solely based on data so that objectivity in the discovered rule sets is very good. But, sometimes this property may hinder to find better knowledge models, depending on the composition of target data sets, especially when the data sets have key-like attributes, or data sets have some attributes having poor dependency to class attributes. Key-like attributes have minutely detailed values and the correspondence between conditional attributes and class attributes is precise. This paper shows how we can surmount the problem thru experiment. Two data sets are adapted for the experiment. A data set that has attributes of key-like and poor dependency was selected. And the other data set that does not have such properties is used to present a counter case. The experiment showed very good results and we found precautions when we apply rough set-based knowledge discovery systems. In addition, the experiment confirmed the fact that adding more data for target data set may increase the accuracy of knowledge models using rough set.