Discretization of Continuous Attributes in Rough Set Theory and Its Application

15Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Existing discretization methods cannot process continuous intervalvalued attributes in rough set theory. This paper extended the existing definition of discretization based on cut-splitting and gave the definition of generalized discretization using class-separability criterion function firstly. Then, a new approach was proposed to discretize continuous interval-valued attributes. The introduced approach emphasized on the class-separability in the process of discretization of continuous attributes, so the approach helped to simplify the classifier design and to enhance accurate recognition rate in pattern recognition and machine learning. In the simulation experiment, the decision table was composed of 8 features and 10 radar emitter signals, and the results obtained from discretization of continuous interval-valued attributes, reduction of attributes and automatic recognition of 10 radar emitter signals show that the reduced attribute set achieves higher accurate recognition rate than the original attribute set, which verifies that the introduced approach is valid and feasible. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Zhang, G., Hu, L., & Jin, W. (2004). Discretization of Continuous Attributes in Rough Set Theory and Its Application. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3314, 1020–1026. https://doi.org/10.1007/978-3-540-30497-5_157

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free