Research on Discretization Algorithms in Rough Sets
Zhao Min-yuan
Abstract
Zhao Min-yuan
Abstract
Based on classification and discussion of current discretization algorithms,the theoretical basis and accomplishment steps of discretization algorithm using information entropy were analyzed in details,and applications of the algorithm in different sample sets of the same attribute were presented.The experimental results show that the algorithm has sensitivity to some attributes and can affect the decision ability of the system when chosen these attributes.
A significance statement is not available in the OpenAlex record.
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.
Based on classification and discussion of current discretization algorithms,the theoretical basis and accomplishment steps of discretization algorithm using information entropy were analyzed in details,and applications of the algorithm in different sample sets of the same attribute were presented.The experimental results show that the algorithm has sensitivity to some attributes and can affect the decision ability of the system when chosen these attributes.
Key concepts: Discretization, Rough set, Algorithm, Discretization of continuous features, Discretization error, Entropy (arrow of time), Computer science, Basis (linear algebra)