Aggregation of asymmetric distances in Computer Science

Information Sciences

Volumn 180, Issue 6, 2010, Pages 803-812

  Mayor, G ^a   Valero, O ^a  

^a UNIVERSITAT DE LES ILLES BALEARS   (Spain)

Author keywords

Aggregation function; Asymmetric distance; Complexity analysis of programs and algorithms; Distance; Monotone function; Subadditive function

Indexed keywords

AGGREGATION FUNCTIONS; ASYMMETRIC DISTANCE; COMPLEXITY ANALYSIS; MONOTONE FUNCTIONS; SUBADDITIVE FUNCTION;

COMPUTER SCIENCE;

FUNCTIONS;

EID: 73149102089     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.06.020     Document Type: Article

References (27)

1. Borsik J., and Doboš J. On a product of metricspaces. Math. Slovaca 31 (1981) 193-205
2. Bustince H., Montero J., and Mesiar R. Migrativity of aggregation functions. Fuzzy Sets Syst. 160 (2009) 766-777
3. Casasnovas J., and Roselló F. Averaging fuzzy biopolymers. Fuzzy Sets Syst. 152 (2005) 139-158
4. J. Casasnovas, F. Roselló, Midpoints as average representations of pairs of descriptions by means of fuzzy subsets, in: Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems International Conference, 2005, pp. 2157-2164.
5. J. Casasnovas, O. Valero, On midpoints for the weighted upper hamming distance between fuzzy sets, in: Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems International Conference, 2006, pp. 114-120.
6. Emerson A.E., and Jutla C.S. The complexity of tree automata and logic of programs. Siam J. Comput. 29 (1999) 132-158
7. Garci{dotless}́a-Raffi LM., Romaguera S., and Sánchez-Pérez E.A. Weak topologies on asymmetric normed linear spaces and non-asymptotic criteria in the theory of complexity analysis of algorithms. J. Anal. Appl. 3 (2004) 125-138
8. Garci{dotless}́a-Raffi L.M., Romaguera S., and Sánchez-Pérez E.A. The supremum asymmetric norm on sequence algebras: a general framework to measure complexity spaces. Electron. Notes Theor. Comput. Sci. 74 (2003) 12
9. Garci{dotless}́a-Raffi L.M., Romaguera S., and Sánchez-Pérez E.A. Sequence spaces and asymmetric norms in the theory of computational complexity. Math. Comput. Model. 36 (2002) 1-11
10. L.M. Garci{dotless}́a-Raffi, S. Romaguera, E.A. Sánchez-Pérez, O. Valero, Normed semialgebras: a mathematical model for the complexity analysis of programs and algorithms, in: Proceedings of the Seventh World Multiconference on Systemics, Cybernetics and Informatics, vol. II, 2003, pp. 55-58.
11. Hitzler P., and Seda A.K. Generalized distance functions in the theory of computation. Comput. J. (2008) 10.1093/comjnl/bxm108
12. Kelley J.L. General Topology (1955), Springer-Verlag
13. Künzi H.P.A. Nonsymmetric distances and their associated topologies: about the origins of basic ideas in the area of asymmetric topology. In: Aull C.E., and Lowen R. (Eds). Handbook of the History of General Topology vol. 3 (2001), Kluwer Acad. Publ. 853-968
14. G. Mayor, O.Valero, Aggregating asymmetric distances in computer sciences, in: Proceedings of the Eighth International FLINS Conference on Computational Intelligence in Decision and Control, 2008, pp. 477-482.
15. Mesiar R., Špirková J., and Vavríková L. Weighted aggregation operators based on minimization. Inform. Sci. 178 (2008) 1133-1140
16. Rodri{dotless}́guez-López J., Romaguera S., and Valero O. Denotational semantics for programming languages, balanced quasi-metrics and fixed points. Int. J. Comput. Math. 85 (2008) 623-630
17. Pradera A., and Trillas E. A note on pseudometrics aggregation. Int. J. Gen. Syst. 31 (2002) 41-51
18. Pradera A., Trillas E., and Castiñeira E. On the aggregation of some classes of fuzzy relations. In: Bouchon-Meunier B., Gutierrez J., Magdalena L., and Yager R. (Eds). Technologies for Constructing Intelligent Systems (2002), Springer-Verlag 125-147
19. A. Pradera, E. Trillas, E. Castiñeira, On distances aggregation, in: Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems International Conference, 2000, pp. 693-700.
20. Romaguera S., Sánchez-Pérez E.A., and Valero O. Computing complexity distances between algorithms. Kybernetika 39 (2003) 569-582
21. Romaguera S., and Schellekens M. Quasi-metric properties of complexity spaces. Topol. Appl. 98 (1999) 311-322
22. Seda A.K. Quasi-metrics and the semantics of logic programs. Fundam. Inform. 29 (1997) 97-117
23. A.K. Seda, Some issues concerning fixed points in computational logic: quasi-Metrics, multivalued mappings and the Knaster-Tarski theorem, in: Proceedings of the 14th Summer Conference on Topology and its Applications, Topology Proceedings, vol. 24, 1999, pp. 223-250.
24. Schellekens M. The Smyth completion: a common foundation for denonational semantics and complexity analysis. Proc. MFPS 11, Electro. Notes Theor. Comput. Sci. 1 (1995) 211-232
25. Stojmirović A. Quasi-metric spaces with measure. Topol. Proc. 28 (2004) 655-671
26. A. Stojmirović, Quasi-metrics, Similarities and Searches: Aspects of Geometry of Protein Datasets, Ph.D. Thesis, Victoria University of Wellington, Wellington, 2005.
27. Tirado P., and Valero O. The average running time of an algorithm as a midpoint between fuzzy sets. Math. Comput. Model. 49 (2009) 1852-1868