On finding optimal discretizations for two attributes
- ,
- Sinh Hoa Nguyen
- University of Warsaw
Scholary Output:
Chapter in Book/Report/Conference proceeding
Conference contribution
Related Event
Title
1st International Conference on Rough Sets and Current Trends in Computing, RSCTC 1998
Event type
ConferenceDate
06/22/1998 - 06/26/1998Location
WarsawPoland
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.
Publication Information
Output type
Scholary Output:
Chapter in Book/Report/Conference proceeding
Conference contribution
Original language
English (US)Pages from-to (Number of pages)
Pages 537-544 (8 pages)Publication milestones
- Published - 1998
Publication status
Published - 1998
Publisher
Springer VerlagPublication series
- Publication series name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
Volume: 1424
ISBN (Print)
3540646558, 9783540646556Publication IDs
- Scopus: 84947751115
Host publication title
Rough Sets and Current Trends in Computing - 1st International Conference, RSCTC 1998, ProceedingsHost publication editors
- Lech Polkowski
- Andrzej Skowron
Publication metrics
Metrics
Fractional count
1
Fractional count
0.50
Fractional count
1
Fractional count
0.50
Fractional count
1
Fractional count
1
SciVal
Author count
2
SciVal
citations
36
SciVal
Paper percentile
81
PlumX, opens in new tab
Citation count
47
Captures
19