Complexity reduction and approximation of multidomain systems of partially ordered data

DOI10.1016/j.csda.2022.107520OpenAlexW4225137382WikidataQ114191820 ScholiaQ114191820MaRDI QIDQ2143036

Marco Fattore, Alessandro Avellone, Alberto Arcagni

Publication date: 30 May 2022

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2022.107520

zbMATH Keywords

rankingpartially ordered setcomplexity reductionbucket ordermulti-indicator systemmultidimensional ordinal data

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Loopless generation of linear extensions of a poset
• A randomized approximation algorithm for computing bucket orders
• Ordinal principal component analysis. Theory and an application.
• Metrics on partially ordered sets - a survey
• Faster random generation of linear extensions
• Model-based co-clustering for ordinal data
• Median constrained bucket order rank aggregation
• Conjunctive Bayesian networks
• MINING POSETS FROM LINEAR ORDERS
• Partial Order Concepts in Applied Sciences
• Divergence measures based on the Shannon entropy
• On distances and metrics in discrete ordered sets

This page was built for publication: Complexity reduction and approximation of multidomain systems of partially ordered data