Learning and classification of monotonic ordinal concepts
Computational Intelligence
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
Faster random generation of linear extensions
Discrete Mathematics - Special issue on partial ordered sets
On the Definition and Representation of a Ranking
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Monotone approximation of aggregation operators using least squares splines
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Sorting multi-attribute alternatives: the TOMASO method
Computers and Operations Research
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Exploiting the Lattice of Ideals Representation of a Poset
Fundamenta Informaticae
Genetic learning of fuzzy integrals accumulating human-reported environmental stress
Applied Soft Computing
Derivation of monotone decision models from noisy data
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Two algorithms for generating structured and unstructured monotone ordinal data sets
Engineering Applications of Artificial Intelligence
Loss optimal monotone relabeling of noisy multi-criteria data sets
Information Sciences: an International Journal
On random generation of fuzzy measures
Fuzzy Sets and Systems
Hi-index | 0.89 |
Many of the state-of-the-art classification algorithms for data with linearly ordered attribute domains and a linearly ordered label set insist on the monotonicity of the induced classification rule. Training and evaluation of such algorithms requires the availability of sufficiently general monotone data sets. In this short contribution we introduce an algorithm that allows for the (almost) uniform random generation of monotone data sets based on the Markov Chain Monte Carlo method.