About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICDM 2001
Conference paper
Efficient splitting rules based on the probabilities of pre-assigned intervals
Abstract
This paper describes new methods for classfication in order to find an optimal tree. Unlike the current splitting rules that are provided by searching all threshold values, this paper proposes the splitting rules that are based on the probabilities of pre-assigned intervals. © 2001 IEEE.