2003•Unpublished venueRequires access

New Algorithms for Discretization of continuous-value Attributes

Shen Dong-sheng

Abstract

Discretization of continuous-value Attributes is one of important problems in Mechine Learning, Data Mining and the other research area. In this paper, we discuss the method for data discretization, and a new algorithm for discretizaton of continuous- value attributes based on Rough Set Theory and Conditional Information entropy is given.

About this research paper

What this paper is about

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

Key concepts: Discretization, Discretization of continuous features, Rough set, Entropy (arrow of time), Conditional entropy, Algorithm, Computer science, Value (mathematics)