Optimal monotone relabelling of partially non-monotone ordinal data

Optimization Methods and Software

Volumn 27, Issue 1, 2012, Pages 17-31

  Rademaker, M ^a   De Baets, B ^a   De Meyer, H ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

flow network; maximum cut; maximum independent set; monotone relabelling; monotonicity; ordinal data

Indexed keywords

FLOW NETWORK; MAXIMUM CUT; MAXIMUM INDEPENDENT SETS; MONOTONICITY; ORDINAL DATA; RELABELLING;

ALGORITHMS; OPTIMIZATION;

CLASSIFICATION (OF INFORMATION);

EID: 77957672308     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556788.2010.507272     Document Type: Article

References (32)

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