On the random generation of monotone data sets

DOI10.1016/j.ipl.2008.03.007zbMath1186.68568WikidataQ60257919 ScholiaQ60257919MaRDI QIDQ963446

Bernard De Baets, H. E. De Meyer, K. De Loof

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.03.007

zbMATH Keywords

Markov chain Monte Carlo methods; approximation algorithms; monotone classification; monotone data sets; ordered sorting; weak order extensions

Mathematics Subject Classification ID

68W25: Approximation algorithms

Related Items

Representations of votes facilitating monotonicity-based ranking rules: from votrix to votex, On random generation of fuzzy measures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the cycle-transitivity of the mutual rank probability relation of a poset
• Sorting multi-attribute alternatives: the TOMASO method
• Generating a random linear extension of a partial order
• On the random generation and counting of weak order extensions of a poset with given class cardinalities
• Extreme copulas and the comparison of ordered lists
• Faster random generation of linear extensions
• On the cycle-transitivity of the dice model
• A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting
• Cyclic evaluation of transitivity of reciprocal relations
• Mathematical classification and clustering
• Optimal monotone relabelling of partially non-monotone ordinal data
• A random polynomial-time algorithm for approximating the volume of convex bodies
• MONOTONE APPROXIMATION OF AGGREGATION OPERATORS USING LEAST SQUARES SPLINES