Optimal monotone relabelling of partially non-monotone ordinal data

References

• Barile , N. and Feelders , A. Nonparametric monotone classification with MOCA . Proceedings of the Eighth IEEE International Conference on Data Mining . Los Alamitos , CA , USA. Edited by: Giannotti , F. , Gunopulos , D. , Turini , F. , Zaniolo , C. , Ramakrishnan , N. and Wu , X. pp. 731 – 736 . IEEE Computer Society .
   Google Scholar
• Bawa , V. 1975 . Optimal rules for ordering uncertain prospects . J. Finance , 31 : 1169 – 1183 .
   Google Scholar
• Beliakov , G. 2003 . How to build aggregation operators from data? . Int. J. Intell. Syst. , 18 : 903 – 923 .
   Web of Science ®Google Scholar
• Beliakov , G. 2005 . Monotonicity preserving approximation of multivariate scattered data . BIT Numer. Math. , 45 : 653 – 677 .
   Web of Science ®Google Scholar
• Beliakov , G. , Mesiar , R. and Valaskova , L. 2004 . Fitting generated aggregation operators to empirical data . Int. J. Uncertain. , 12 : 219 – 236 . Fuzziness Knowledge-Based Systems
   Google Scholar
• Ben-David , A. 1992 . Automatic generation of symbolic multiattribute ordinal knowledge-based DSSs: Methodology and applications . Decis. Sci. , 23 : 1357 – 1372 .
   Web of Science ®Google Scholar
• J. Bioch and V. Popova, Monotone decision trees and noisy data, Tech. Rep. ERS-2002-53-LIS, Department of Computer Science, Erasmus University Rotterdam, 2002
   Google Scholar
• Bodlaender , H. L. , Thilikos , D. T. and Yamazaki , K. 1997 . It is hard to know when greedy is good for finding independent sets . Inform. Process. Lett. , 61 : 101 – 106 .
   Google Scholar
• Bomze , I. M. , Budinich , M. , Pardalos , P. M. and Pelillo , M. 1999 . The maximum clique problem, in Handbook of Combinatorial Optimization , Edited by: Du , D.-Z. and Pardalos , P. M. 1 – 74 . Kluwer : Dordrecht . Chapter 1
   Google Scholar
• Boros , E. , Golumbic , M. C. and Levit , V. E. 2002 . On the number of vertices belonging to all maximum stable sets of a graph . Discrete Appl. Math. , 124 : 17 – 25 .
   Google Scholar
• Bouyssou , D. 1990 . Building criteria: A prerequisite for MCDA, in Readings in Multiple Criteria Decision Aid , Edited by: Bana e Costa , C. 58 – 80 . Berlin : Springer Verlag .
   Google Scholar
• Brodley , C. E. and Friedl , M. A. Identifying and eliminating mislabeled training instances . Proceedings of the Thirteenth National Conference on Artificial Intelligence AAAI/IAAI . Vol. 1 , pp. 799 – 805 . Menlo Park , CA : The AAAI Press .
   Google Scholar
• Cao-Van , K. 2003 . Supervised ranking: From semantics to algorithms , Ghent University . Ph.D. thesis
   Google Scholar
• Cao-Van , K. and De Baets , B. 2002 . On the definition and representation of a ranking . Lect. Notes Comput. Sci. , 2561 : 291 – 299 .
   Google Scholar
• Cao-Van , K. and De Baets , B. 2003 . Growing decision trees in an ordinal setting . Int. J. Intell. Syst. , 18 : 733 – 750 .
   Google Scholar
• Cherkassky , B. and Goldberg , A. 1997 . On implementing push-relabel method for the maximum flow problem . Algorithmica , 19 : 390 – 410 .
   Web of Science ®Google Scholar
• Daniels , H. and Velikova , M. 2006 . Derivation of monotone decision models from noisy data . IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. , 36 : 705 – 710 .
   Google Scholar
• B. De Baets, H. De Meyer, and R. Mesiar, Piecewise linear aggregation functions based on triangulation, Inform. Sci., accepted for publication
   Google Scholar
• A. Feelders, M. Velikova, and H. Daniels, Two polynomial algorithms for relabeling non-monotone data, Tech. Rep. UU-CS-2006-046, 2006
   Google Scholar
• Ford , L. and Fulkerson , D. 1962 . Flows in Networks , Princeton , NJ : Princeton University Press .
   Google Scholar
• Hadar , J. and Russell , W. R. 1969 . Rules for ordering uncertain prospects . Am. Econ. Rev. , 59 : 25 – 34 .
   Web of Science ®Google Scholar
• Levy , H. 1998 . Decision Making Under Uncertainty: Stochastic Dominance , Boston/Dordrecht/London : Springer .
   Google Scholar
• S. Lievens and B. De Baets, Supervised ranking in the WEKA environment, Inform. Sci., in press. doi:10.1016/j.ins.2010.06.014
   Google Scholar
• Lievens , S. , De Baets , B. and Cao-Van , K. 2008 . A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting . Ann. Oper. Res. , 163 : 115 – 142 .
   Google Scholar
• Marichal , J.-L. , Meyer , P. and Roubens , M. 2005 . Sorting multi-attribute alternatives: The TOMASO method . Comput. Oper. Res. , 32 : 861 – 877 .
   Google Scholar
• Möhring , R. 1985 . “ Algorithmic aspects of comparability graphs and interval graphs ” . In Proceedings of the NATO Advanced Study Institute on Graphs and Order , Edited by: Rival , I. 41 – 101 . Banff, Dordrecht , BC, Canada : D. Reidel .
   Google Scholar
• Potharst , R. and Bioch , J. C. 2000 . Decision trees for ordinal classification . Intell. Data Anal. , 4 (2) : 97 – 111 .
   Google Scholar
• Rademaker , M. , De Baets , B. and De Meyer , G. Data sets for supervised ranking: To clean or not to clean . Proceedings of the Fifteenth Annual Machine Learning Conference of Belgium and The Netherlands, BENELEARN 2006 . Ghent , Belgium. pp. 139 – 146 .
   Google Scholar
• Rademaker , M. , De Baets , B. and De Meyer , H. 2006 . “ On the role of maximal independent sets in cleaning data sets for supervised ranking ” . In Proceedings of the 2006 IEEE International Conference on Fuzzy Systems 7810 – 7815 . Vancouver , BC, Canada
   Google Scholar
• Rademaker , M. , De Baets , B. and De Meyer , H. 2009 . Loss optimal monotone relabeling of noisy multi-criteria data sets . Inform. Sci. , 179 : 4089 – 4096 .
   Google Scholar
• Schrijver , A. 2003 . Combinatorial Optimization: Polyhedra and Efficiency , Berlin : Springer-Verlag .
   Google Scholar
• Velikova , M. V. 2006 . Monotone models for prediction in data mining , Tilburg University . Ph.D. thesis
   Google Scholar