Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
From MaRDI portal
Publication:2499141
Recommendations
- Relative entropy based error estimates for discontinuous Galerkin schemes
- Discretization Precision and Assessment Error
- A discretization algorithm based on effective information ratio
- On the error evaluation of approximate solutions of discrete equations
- Analysis of Costate Discretizations in Parameter Estimation for Linear Evolution Equations
Cites work
- A NEW MEASURE OF RANK CORRELATION
- A simple generalisation of the area under the ROC curve for multiple class classification problems
- General and efficient multisplitting of numerical attributes
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 45100 (Why is no real title available?)
- scientific article; zbMATH DE number 1149421 (Why is no real title available?)
- scientific article; zbMATH DE number 3249566 (Why is no real title available?)
- Multivariate discretization for set mining
- On the handling of continuous-valued attributes in decision tree generation
- Very simple classification rules perform well on most commonly used datasets
Cited in
(3)
This page was built for publication: Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2499141)