Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
From MaRDI portal
Publication:2499141
DOI10.1016/j.cor.2005.01.022zbMath1113.90093OpenAlexW2118716686MaRDI QIDQ2499141
Davy Janssens, Geert Wets, Tom Brijs, Koen Vanhoof
Publication date: 14 August 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/1511
Related Items (3)
Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior ⋮ Synergies of operations research and data mining ⋮ A novel univariate marginal distribution algorithm based discretization algorithm
Uses Software
Cites Work
- On the handling of continuous-valued attributes in decision tree generation
- General and efficient multisplitting of numerical attributes
- Very simple classification rules perform well on most commonly used datasets
- A NEW MEASURE OF RANK CORRELATION
- A simple generalisation of the area under the ROC curve for multiple class classification problems
- Multivariate discretization for set mining
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Evaluating the performance of cost-based discretization versus entropy- and error-based discretization