Novel algorithm for discretization of continuous attributes based on rough sets theory
Hui Li, Deqin Yan, Li Han
Abstract
Hui Li, Deqin Yan, Li Han
Abstract
The rough set required that discretization should be maintained indiscernibility of the original decision-making system,however,many algorithms before permitted approximate quality descended controlled certain scope.This paper proposed a novel method of splitting interval.The novel algorithm was more reasonable and effective to discretization of continual attribute,and assured not to change decision-making attributes.By using C4.5 and SVM,performed the experiments respectively with the results of discreted data.The experiment results show that the presented algorithm is effective.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The rough set required that discretization should be maintained indiscernibility of the original decision-making system,however,many algorithms before permitted approximate quality descended controlled certain scope.This paper proposed a novel method of splitting interval.The novel algorithm was more reasonable and effective to discretization of continual attribute,and assured not to change decision-making attributes.By using C4.5 and SVM,performed the experiments respectively with the results of discreted data.The experiment results show that the presented algorithm is effective.
Key concepts: Discretization, Rough set, Computer science, Scope (computer science), Discretization of continuous features, Interval (graph theory), Algorithm, Quality (philosophy)