2003•Journal of Hangzhou Institute of Applied EngineeringRequires access

An algorithm of discretization of continuous attributes in rough sets based on cluster

Xiang Xin-jian

Abstract

Rough set theory is a new mathematical tool to deal with imprecise, incomplete and inconsistent data. The rough set theory can only deal with the discrete attributes. It can not deal with the continuous attributes. In order to overcome the limitation, by using the character of in size order for continuous attributes and error theory of statistics, this paper proposes an algorithm of discretization based on cluster. The result of comparison between this algorithm and some existing methods of discretization is encouraging.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

Key concepts: Discretization, Rough set, Discretization of continuous features, Discretization error, Set (abstract data type), Algorithm, Cluster (spacecraft), Character (mathematics)