On changing continuous attributes into ordered discrete attributes
EWSL-91 Proceedings of the European working session on learning on Machine learning
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Discretization Problem for Rough Sets Methods
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Improved Algorithms for Univariate Discretization of Continuous Features
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
Practical approximation of optimal multivariate discretization
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Approximation algorithms for minimizing empirical error by axis-parallel hyperplanes
ECML'05 Proceedings of the 16th European conference on Machine Learning
On optimization of decision trees
Transactions on Rough Sets IV
Approximate boolean reasoning: foundations and applications in data mining
Transactions on Rough Sets V
Contributions to the Theory of Rough Sets
Fundamenta Informaticae
| Hi-index | 0.00 |
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.