Optimal techniques for class-dependent attribute discretization

DOI10.1057/PALGRAVE.JORS.2601174MaRDI QIDQ4658503zbMATH OpenOpenAlexFDO

Authors N. A. Bryson, A. Joseph

Publication date 16 March 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601174

zbMATH Keywords

attribute discretizationdata miningdecision treesentropymachine learningparametric linear programming

Mathematics Subject Classification ID

Theory of data (68P99) Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 1303636
• scientific article; zbMATH DE number 1927200
• scientific article; zbMATH DE number 1735622
• A heuristic discretization technique based on the class-attribute interdependence
• Global discretization of continuous attributes as preprocessing for machine learning

Cited in

(8)

• Global discretization of continuous attributes as preprocessing for machine learning
• Learning data discretization via convex optimization
• Rough sets approach to symbolic value partition
• A dynamic-programming algorithm for hierarchical discretization of continuous attributes
• A heuristic discretization technique based on the class-attribute interdependence
• A novel discretizer for knowledge discovery based on multiknowledge approaches
• scientific article; zbMATH DE number 1735622 (Why is no real title available?)
• scientific article; zbMATH DE number 2013256 (Why is no real title available?)

This page was built for publication: Optimal techniques for class-dependent attribute discretization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4658503)