Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Feature minimization within decision trees

From MaRDI portal
Publication:1384090
Jump to:navigation, search

zbMath0896.90174MaRDI QIDQ1384090

Erin J. Bredensteiner, Kristin P. Bennett

Publication date: 1 October 1998

Published in: Computational Optimization and Applications (Search for Journal in Brave)


zbMATH Keywords

classificationbilinear programmingdata miningdecision treesmachine learningfeature minimization


Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Learning and adaptive systems in artificial intelligence (68T05)


Related Items (4)

On detecting nonlinear patterns in discriminant problems ⋮ Tabu search approaches for solving the two-group classification problem ⋮ A data mining-constraint satisfaction optimization problem for cost effective classification ⋮ Polyhedral separability through successive LP


Uses Software

  • C4.5



This page was built for publication: Feature minimization within decision trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1384090&oldid=13534677"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki