@inproceedings{5183437694c140e0a64bd6459444f400,
title = "On finding optimal discretizations for two attributes",
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.",
author = "Chlebus, {Bogdan S.} and Nguyen, {Sinh Hoa}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 1st International Conference on Rough Sets and Current Trends in Computing, RSCTC 1998 ; Conference date: 22-06-1998 Through 26-06-1998",
year = "1998",
doi = "10.1007/3-540-69115-4_74",
language = "English (US)",
isbn = "3540646558",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "537--544",
editor = "Lech Polkowski and Andrzej Skowron",
booktitle = "Rough Sets and Current Trends in Computing - 1st International Conference, RSCTC 1998, Proceedings",
}