@INPROCEEDINGS { Rsds3513,
author = {Nguyen, Sinh Hoa and Nguyen, Hung Son}, 
title = {From Optimal Hyperplanes to Optimal Decision Trees: Rough Set and Boolean Reasoning Approach}, 
booktitle = {Proceedings of the Fourth International Workshop on Rough Sets, Fuzzy Sets, and Machine Discovery}, 
conference = {International Workshop on Rough Sets, Fuzzy Sets, and Machine Discovery}, 
pages = {82--88}, 
publisher = {Japanese Research Group on Rough Sets}, 
address = {Tokyo, Japan}, 
month = {November}, 
year = 1996, 
editor = {Tsumoto, Shusaku and Kobayashi, Satoshi and Yokomori, Takashi and Tanaka, Hiroshi and Nakamura, Akira}, 
isbn = {4-947717-01-7}, 
abstract = {In previous paper we have presented several methods of searching for semi-optimal real value attributes discretization. The problem of searching for optimal discretization of the given decision table is NP-hard [15]. We have proposed also some efficient heuristic searching for the semi-optimal set of cuts in two cases, namely cuts defined by hyperplanes parallel to axes [10] and cuts defined by hyperplanes not necessarily parallel to axes [9]. In the paper we present some properties of the set of cuts determined by our methods and an approach to a semi-optimal decision tree construction.}, 
keywords = {rough set theory (RST), boolean reasoning, discretization, oblique hyperplanes, decision tree, }, 
}