On the random generation of monotone data sets
From MaRDI portal
Publication:963446
DOI10.1016/j.ipl.2008.03.007zbMath1186.68568OpenAlexW1973530392WikidataQ60257919 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
Markov chain Monte Carlo methodsapproximation algorithmsmonotone classificationmonotone data setsordered sortingweak order extensions
Related Items (4)
Representations of votes facilitating monotonicity-based ranking rules: from votrix to votex ⋮ Random generation of \(k\)-interactive capacities ⋮ Random generation of capacities and its application in comprehensive decision aiding ⋮ On random generation of fuzzy measures
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the random generation of monotone data sets
