We present a comparison of error-based and entropybased methods for discretization of continuous features. Our study includes both an extensive empirical comparison as well as an analysis of scenarios where error minimization may be an inappropriate discretization criterion. We present a discretization method based on the C4.5 decision tree algorithm and compare it to an existing entropy-based ...

in recent years, different damage indexes have been introduced in engineering literature. the most prominent one among other counterparts is the 1985 park and ang's damage index (dipa), which demonstrates well calibration against experimental results. hence, it has traditionally had broad application in the field of structural engineering. commonly, in dipa relevant parameters are assessed...

Biometric discretization extracts a binary string from a set of real-valued features per user. This representative string can be used as a cryptographic key in many security applications upon error correction. Discretization performance should not degrade from the actual continuous features-based classification performance significantly. However, numerous discretization approaches based on inef...

In AI and machine learning techniques such as decision trees and Bayesian networks, there is a growing need for converting continuous data into discrete form. Several approaches are available for discretization, however finding an appropriate and efficient discretization method is a challenging task. In this paper, we present an impurity based dynamic multi-interval discretization approach for ...