Characterizing quasi-metric aggregation functions

ABSTRACT In this paper, we study those functions that allows us to combine a family of quasi-metrics, defined all of them on the same set, into a single one, which will be called quasi-metric aggregation functions. In particular, we characterize the quasi-metric aggregation functions and, in addition, we discuss a few of their properties. Moreover, a few methods to discard those functions that are useless as quasi-metric aggregation functions are introduced. Throughout the paper, different examples justify and illustrate the results presented. Finally, two possible fields where the developed theory can be useful are exposed.

[1]  Radko Mesiar,et al.  Quo vadis aggregation? , 2018, Int. J. Gen. Syst..

[2]  Óscar Valero,et al.  New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces , 2012, Int. J. Comput. Math..

[3]  Pascal Hitzler,et al.  Mathematical Aspects of Logic Programming Semantics , 2010, Chapman and Hall / CRC studies in informatics series.

[4]  Óscar Valero,et al.  An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words , 2009, LATA.

[5]  Óscar Valero,et al.  Aggregation of asymmetric distances in Computer Science , 2010, Inf. Sci..

[6]  Enric Trillas,et al.  On the aggregation of some classes of fuzzy relations , 2002 .

[7]  Dileep R. Sule,et al.  Logistics of Facility Location and Allocation , 2001 .

[8]  Michel P. Schellekens,et al.  The Smyth completion: a common foundation for denotational semantics and complexity analysis , 1995, MFPS.

[9]  Salvador Romaguera,et al.  Sequence spaces and asymmetric norms in the theory of computational complexity , 2002 .

[10]  Salvador Romaguera,et al.  A Common Mathematical Framework for Asymptotic Complexity Analysis and Denotational Semantics for Recursive Programs Based on Complexity Spaces , 2012 .

[11]  Frank Plastria,et al.  Asymmetric distances, semidirected networks and majority in Fermat–Weber problems , 2009, Ann. Oper. Res..

[12]  Óscar Valero,et al.  The complexity space of partial functions: a connection between complexity analysis and denotational semantics , 2011, Int. J. Comput. Math..

[13]  Oscar Valero,et al.  Metric aggregation functions revisited , 2019, Eur. J. Comb..

[14]  Salvador Romaguera,et al.  The supremum asymmetric norm on sequence algebras: a general framework to measure complexity distances , 2002, Electron. Notes Theor. Comput. Sci..

[15]  Justo Puerto,et al.  Location Theory - A Unified Approach , 2005 .

[16]  Salvador Romaguera,et al.  On the structure of the space of complexity partial functions , 2008, Int. J. Comput. Math..

[17]  Zvi Drezner,et al.  The Asymmetric Distance Location Problem , 1989, Transp. Sci..

[18]  Arie Tamir.  Technical Note - On the Complexity of Some Classes of Location Problems , 1992, Transp. Sci..

[19]  Jordi Recasens.  Indistinguishability Operators - Modelling Fuzzy Equalities and Fuzzy Equivalence Relations , 2011, Studies in Fuzziness and Soft Computing.

[20]  SOME REMARKS ON METRIC PRESERVING FUNCTIONS , 1993 .

[21]  Klotilda Lazaj.  Metric Preserving Functions , 2009 .

[22]  Jozef Doboš,et al.  On a product of metric spaces , 1981 .

[23]  Salvador Romaguera,et al.  Quasi-metric properties of complexity spaces , 1999 .

[24]  ANA PRADERAa,et al.  A note on pseudometrics aggregation , 2002 .

[25]  Frank Plastria,et al.  On destination optimality in asymmetric distance Fermat-Weber problems , 1993, Ann. Oper. Res..