Abstract

http://ssrn.com/abstract=370989
 
 

References (15)



 


 



Classification Trees for Problems with Monotonicity Constraints


Rob Potharst


Erasmus University Rotterdam - Department of Computer Science; Erasmus Research Institute of Management (ERIM)

A. J. Feelders


University of Utrecht

23 2002 4,

ERIM Report Series Reference No. ERS-2002-45-LIS

Abstract:     
For classification problems with ordinal attributes very often theclass attribute should increase with each or some of theexplaining attributes. These are called classification problemswith monotonicity constraints. Classical decision tree algorithmssuch as CART or C4.5 generally do not produce monotone trees, evenif the dataset is completely monotone. This paper surveys themethods that have so far been proposed for generating decisiontrees that satisfy monotonicity constraints. A distinction is madebetween methods that work only for monotone datasets and methodsthat work for monotone and non-monotone datasets alike.

Number of Pages in PDF File: 39

Keywords: monotone, monotonicity constraint, classification tree, decision tree, ordinal data

JEL Classification: M, M11, R4, C6

working papers series


Download This Paper

Date posted: February 18, 2003  

Suggested Citation

Potharst, Rob and Feelders, A. J., Classification Trees for Problems with Monotonicity Constraints (23 2002 4,). ERIM Report Series Reference No. ERS-2002-45-LIS. Available at SSRN: http://ssrn.com/abstract=370989

Contact Information

Rob Potharst (Contact Author)
Erasmus University Rotterdam - Department of Computer Science ( email )
P.O. Box 1738
Room T08-21
3000 DR Rotterdam, 3000 DR
Netherlands
+31 10 4081343 (Phone)
+31 10 4089167 (Fax)
Erasmus Research Institute of Management (ERIM)
P.O. Box 1738
3000 DR Rotterdam
Netherlands
A. J. Feelders
University of Utrecht ( email )
P.O. Box 80089
NL-3508 TC Utrecht
Netherlands
Feedback to SSRN


Paper statistics
Abstract Views: 737
Downloads: 68
Download Rank: 192,230
References:  15

© 2014 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright   Contact Us
This page was processed by apollo8 in 0.281 seconds