Two greedy algorithms for the synthesis and approximation of multidomain systems of partially ordered data are proposed. Given k input partially ordered sets (posets) on the same elements, the algorithms search for the optimally approximating partial orders, minimizing the dissimilarity between the generated and input posets, based on their matrices of mutual ranking probabilities. A general approximation algorithm is developed, together with a specific procedure for approximation over bucket orders, which are the natural choice when the goal is to “condense” the inputs into rankings, possibly with ties. Different loss functions are also employed, and their outputs are compared. A real example pertaining to regional well-being in Italy motivates the algorithms and shows them in action.

Arcagni, A., Avellone, A., Fattore, M. (2022). Complexity reduction and approximation of multidomain systems of partially ordered data. COMPUTATIONAL STATISTICS & DATA ANALYSIS, 173(September 2022) [10.1016/j.csda.2022.107520].

Complexity reduction and approximation of multidomain systems of partially ordered data

Avellone, A
;
Fattore, M
2022

Abstract

Two greedy algorithms for the synthesis and approximation of multidomain systems of partially ordered data are proposed. Given k input partially ordered sets (posets) on the same elements, the algorithms search for the optimally approximating partial orders, minimizing the dissimilarity between the generated and input posets, based on their matrices of mutual ranking probabilities. A general approximation algorithm is developed, together with a specific procedure for approximation over bucket orders, which are the natural choice when the goal is to “condense” the inputs into rankings, possibly with ties. Different loss functions are also employed, and their outputs are compared. A real example pertaining to regional well-being in Italy motivates the algorithms and shows them in action.
Articolo in rivista - Articolo scientifico
Bucket order; Complexity reduction; Multi-indicator system; Multidimensional ordinal data; Partially ordered set; Ranking;
English
Arcagni, A., Avellone, A., Fattore, M. (2022). Complexity reduction and approximation of multidomain systems of partially ordered data. COMPUTATIONAL STATISTICS & DATA ANALYSIS, 173(September 2022) [10.1016/j.csda.2022.107520].
Arcagni, A; Avellone, A; Fattore, M
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/372981
Citazioni
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
Social impact