Classification Trees for Problems with Monotonicity Constraints
2002-04-23
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(erimrs20020423163429.pdf, 0.6MB) |
For classification problems with ordinal attributes very often the class attribute should increase with each or some of the explaining attributes. These are called classification problems with monotonicity constraints. Classical decision tree algorithms such as CART or C4.5 generally do not produce monotone trees, even if the dataset is completely monotone. This paper surveys the methods that have so far been proposed for generating decision trees that satisfy monotonicity constraints. A distinction is made between methods that work only for monotone datasets and methods that work for monotone and non-monotone datasets alike.
Keywords
Classifications using
Journal of Economic Literature (JEL) Classification System
- C6 : Mathematical Methods and Programming
- M : Business Administration and Business Economics; Marketing; Accounting
- R4 : Transportation Systems
- M11 : Production Management
Automatically Extracted Terms
- management
- classification
- research
- business
- report
- monotonicity constraints r
- constraint
- series
- monotonicity
- system
- problem
- monotonicity constraints
- method
- classification problems
- van der made-potuijt
- value sajda qureshi
- rotterdam
- roodbergen ers -2002-19-lis
- report series research
- programming business administration
