Skip to main content
Conference Proceedings

Aggregation functions with stronger types of monotonicity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6178 LNAI 418-424
DOI: 10.1007/978-3-642-14049-5_43
2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Following the ideas of stronger forms of monotonicity for unary real functions and for capacities, k-monotone and strongly k-monotone aggregation functions are introduced and discussed. In the special case k∈=∈2 also some applications are given. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Klement, E. P., Manzi, M., & Mesiar, R. (2010). Aggregation functions with stronger types of monotonicity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6178 LNAI, pp. 418–424). https://doi.org/10.1007/978-3-642-14049-5_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free