On finding optimal discretizations for two attributes

Bogdan S. Chlebus, Sinh Hoa Nguyen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

42 Scopus citations

Abstract

We show that finding optimal discretization of instances of decision tables with two attributes with real values and binary decisions is computationally hard. This is done by abstracting the problem in such a way that it regards partitioning points in the plane into regions, subject to certain minimality restrictions, and proving them to be NP-hard. We also propose a new method to find optimal discretizations.

Original languageEnglish (US)
Title of host publicationRough Sets and Current Trends in Computing - 1st International Conference, RSCTC 1998, Proceedings
EditorsLech Polkowski, Andrzej Skowron
PublisherSpringer Verlag
Pages537-544
Number of pages8
ISBN (Print)3540646558, 9783540646556
DOIs
StatePublished - 1998
Externally publishedYes
Event1st International Conference on Rough Sets and Current Trends in Computing, RSCTC 1998 - Warsaw, Poland
Duration: Jun 22 1998Jun 26 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1424
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st International Conference on Rough Sets and Current Trends in Computing, RSCTC 1998
Country/TerritoryPoland
CityWarsaw
Period6/22/986/26/98

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On finding optimal discretizations for two attributes'. Together they form a unique fingerprint.

Cite this