Publication: Expansible Computable Aggregation Rules
Loading...
Full text at PDC
Publication Date
2016
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Citations
Exportar
Abstract
The aggregation operator have been considered from a computable point of view. The important condition that the computation is friendly when portions of data are inserted o deleted to the list of values to aggregate is considered.
Description
UCM subjects
Unesco subjects
Keywords
Citation
G. Barnett and L. Del Tonga, Data Structures and Algorithms. DotNetSlackers, 2008
G. Beliakov, A. Pradera and T. Calvo, Aggregations Functions: A guide for Practitioners, 2007, Springer
V. Cutello and J. Montero, "Recursive connective rules", International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, no. 14, pp. 3-20, 1999
A. del Amo, J. Montero and E. Molina, "Representation of consistent recursive rules", European Journal of Operational Research, vol. 130, no. 1, pp. 29-53, 2001
D. Gómez and J. Montero, "A discussion on aggregations operators", Kybernetika, vol. 40, pp. 107-120, 2004
A. Kolesárová, R. Mesiar and J. Montero, "Sequential aggregation of bags", Information Sciences, vol. 294, pp. 305-314, 2015
V. López, J. Montero and J.T. Rodríguez, "Formal specification and implementation of computational aggregation functions", International FLINS Conference on Decision Making and Soft Computing
J.T. Rodríguez, V. López, D. Gómez, B. Vitoriano and J. Montero, "A computational definition of aggregation rules", FUZZ-IEEE 2010, IEEE International Conference on Fuzzy Systems, pp. 1-5 Abstract | Full Text: PDF (90KB) | Full Text: HTML
R.R. Yager, "Families of owa operators, fuzzy sets and systems", Fuzzy Sets and Systems, no. 59, pp. 125-148, 1993