The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Discretization of Rational Data
Abstract
Frequently, one wants to extend the use of a classification method that, in principle, requires records with True/False values, so that records with rational numbers can be processed. In such cases, the rational numbers must first be replaced by True/False values before the method may be applied. In other cases, a classification method in principle can process records with rational numbers directly, but replacement by True/False values improves the performance of the method. The replacement process is usually called discretization or binarization. This chapter describes a recursive discretization process called Cutpoint. The key step of Cutpoint detects points where classification patterns change abruptly. The chapter includes computational results, where Cutpoint is compared with entropy-based methods that, to date, have been found to be the best discretization schemes. The results indicate that Cutpoint is preferred by certain classification schemes, while entropy-based methods are better for other classification methods. Thus, one may view Cutpoint to be an additional discretization tool that one may want to consider.
Related Content
|
Murray Eugene Jennex.
© 2020.
29 pages.
|
|
Ronald John Lofaro.
© 2020.
18 pages.
|
|
Mark E. Nissen.
© 2020.
23 pages.
|
|
Ronel Davel, Adeline S. A. Du Toit, Martie Mearns.
© 2020.
32 pages.
|
|
Murray Eugene Jennex.
© 2020.
23 pages.
|
|
Michael J. Zhang.
© 2020.
21 pages.
|
|
Toshali Dey, Susmita Mukhopadhyay.
© 2020.
23 pages.
|
|
|