New Advances in the Aggregation of Asymmetric Distances. The Bounded Case

In 1981, J. Borsik and J. Dobos studied the problem of how to merge, by means of a function, a family of distances into a single one. To this end, they introduced the notion of distance aggregation function and gave a characterization of such functions. Later on, in 2010, the notion of distance aggregation function was extended to the framework of asymmetric distances by G. Mayor and O. Valero. Thus, asymmetric distance aggregation functions were introduced and a characterization of this new type of functions was also given. Concretely, the aforesaid characterization states that the functions which allow to merge a family of asymmetric distances into a single one are exactly those that are amenable, monotone and subadditive. In the present chapter we consider the problem of aggregating a family of bounded asymmetric distances. To this end, the notion of bounded asymmetric distance aggregation function is introduced and a full description of such functions is provided. The obtained results are illustrated by means of examples. Furthermore, the relationship between asymmetric aggregation functions and the bounded ones is discussed.

[1]  Radko Mesiar,et al.  Domination of Aggregation Operators and Preservation of Transitivity , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[2]  Óscar Valero,et al.  On quasi-metric aggregation functions and fixed point theorems , 2013, Fuzzy Sets Syst..

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

[4]  Hans-Peter A. Künzi,et al.  Nonsymmetric Distances and Their Associated Topologies: About the Origins of Basic Ideas in the Area of Asymmetric Topology , 2001 .

[5]  Gaspar Mayor,et al.  Aggregating asymmetric distances in Computer Science , 2008 .

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

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

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

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

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

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

[12]  Gleb Beliakov,et al.  Aggregation Functions: A Guide for Practitioners , 2007, Studies in Fuzziness and Soft Computing.

[13]  Humberto Bustince,et al.  A Practical Guide to Averaging Functions , 2015, Studies in Fuzziness and Soft Computing.

[14]  Vladimir Pestov,et al.  Indexing schemes for similarity search in datasets of short protein fragments , 2007, Inf. Syst..

[15]  Joseph N. Wilson,et al.  Discrete Choquet Integral as a Distance Metric , 2008, IEEE Transactions on Fuzzy Systems.

[16]  Óscar Valero,et al.  Computing complexity distances between algorithms , 2003, Kybernetika.

[17]  S. G. Matthews,et al.  Partial Metric Topology , 1994 .

[18]  L. M. García-Raffi,et al.  Applications of the complexity space to the General Probabilistic Divide and Conquer Algorithms , 2008 .

[19]  Efe A. Ok.  Real analysis with economic applications , 2007 .

[20]  Vladimir Pestov,et al.  Indexing Schemes for Similarity Search: an Illustrated Paradigm , 2002, Fundam. Informaticae.

[21]  Francesc Esteva,et al.  Review of Triangular norms by E. P. Klement, R. Mesiar and E. Pap. Kluwer Academic Publishers , 2003 .

[22]  E. Copson,et al.  Metric Spaces: Complete Metric Spaces , 1968 .

[23]  Francesc Rosselló,et al.  Averaging fuzzy biopolymers , 2005, Fuzzy Sets Syst..