2010•Journal of Shanghai University of Engineering ScienceRequires access

Research on Discretization Algorithms in Rough Sets

Zhao Min-yuan

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Discretization, Rough set, Algorithm, Discretization of continuous features, Discretization error, Entropy (arrow of time), Computer science, Basis (linear algebra)

Related papers

Back to paper searchBrowse research topicsOriginal source
Research on Discretization Algorithms in Rough Sets — Research Paper | ScholarLens