Monotone relabeling in ordinal classification

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2010, Pages 803-808

  Feelders, Ad ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BUILDING BLOCKES; CLASSIFICATION TREES; DATA SETS; K-NEAREST NEIGHBOURS; LOSS FUNCTIONS; ORDINAL CLASSIFICATION; PREDICTION ERRORS; PREDICTIVE PERFORMANCE; RELABELING; SMALL TRAINING; TRAINING DATA; TRAINING SAMPLE;

ALGORITHMS; CLASSIFICATION (OF INFORMATION); NATURAL LANGUAGE PROCESSING SYSTEMS; OPTIMIZATION; SAMPLING; TREES (MATHEMATICS);

DATA MINING;

EID: 79951749535     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2010.92     Document Type: Conference Paper

References (18)

1. A. Asuncion and D.J. Newman. UCI machine learning repository, 2007.
2. R. Chandrasekaran, Y.R. Ruy, V.S. Jacob, and S. Hong. Isotonic separation. INFORMS Journal On Computing, 17(4):462-474, 2005. (Pubitemid 41673347)
3. H. Daniels and M. Velikova. Derivation of monotone decision models from noisy data. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 36(5):705-710, 2006. (Pubitemid 46405293)
4. Janez Demłsar. Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7:1-30, 2006. (Pubitemid 43022939)
5. W. Duivesteijn and A. Feelders. Nearest neighbour classification with monotonicity constraints. In W. Daelemans, editor, Proceedings of ECML/PKDD 2008, volume 5211 of LNAI, pages 301-316. Springer, 2008.
6. R. Dykstra, J. Hewett, and T. Robertson. Nonparametric, isotonic discriminant procedures. Biometrika, 86(2):429-438, 1999. (Pubitemid 129767161)
7. J. Fürnkranz and E. Hüllermeier. Pairwise preference learning and ranking. In N. Lavrač, D. Gamberger, H. Blockeel, and L. Todorovski, editors, Proceedings of the 14th European Conference on Machine Learning, pages 145-156, 2003. (Pubitemid 37230973)
8. D.S. Hochbaum and M. Queyranne. Minimizing a convex cost closure set. SIAM Journal Of Discrete Mathematics, 16(2):192-207, 2003.
9. R. van de Kamp, A. Feelders, and N. Barile. Isotonic classification trees. In N. Adams, editor, Proceedings of IDA 2009, volume 5772 of LNCS, pages 405-416. Springer, 2009.
10. W. Kotlowski, K. Dembczynski, S. Greco, and R. Slowinski. Stochastic dominance-based rough set model for ordinal classification. Information Sciences, 178:4019-4037, 2008.
11. W. Kotlowski and R. Slowinski. Statistical approach to ordinal classification with monotonicity constraints. In E. Hüllermeier and J. Fürnkranz, editors, ECML PKDD 2008 Workshop on Preference Learning, 2008.
12. W. Kotlowski and R. Slowinski. Rule learning with monotonicity constraints. In L. Bottou and M. Littman, editors, Proceedings of the 26th Annual International Conference on Machine Learning, pages 537-544, 2009.
13. R.H. Möhring. Algorithmic aspects of comparability graphs and interval graphs. In I. Rival, editor, Graphs and Order, pages 41-101. Reidel, 1985.
14. J.-C. Picard. Maximal closure of a graph and applications to combinatorial problems. Management Science, 22(11):1268-1272, 1976.
15. R. Potharst and J.C. Bioch. Decision trees for ordinal classification. Intelligent Data Analysis, 4(2):97-112, 2000.
16. M. Rademaker, B. De Baets, and H. De Meyer. On the role of maximal independent sets in cleaning data for supervised ranking. In 2006 IEEE International Conference on Fuzzy Systems, pages 1619-1624. 2006. (Pubitemid 46948967)
17. M. Rademaker, B. De Baets, and H. De Meyer. Loss optimal monotone relabeling of noisy multi-criteria data sets. Information Sciences, 179:4089-4096, 2009.
18. J. Spouge, H. Wan, and W.J. Wilbur. Least squares isotonic regression in two dimensions. Journal Of Optimization Theory And Applications, 117(3):585-605, 2003.