Invariant continuous aggregation functions
- 1 February 2010
- journal article
- research article
- Published by Taylor & Francis in International Journal of General Systems
- Vol. 39 (2) , 177-188
Abstract
Continuous aggregation functions, being invariant under any monotone bijective transformation, are discussed and characterised. As a basic tool for this characterisation, self-dual -valued capacities or their counterparts, self-dual monotone Boolean functions, are exploited. A generating role of is discussed. The relevant role of simple medians in describing monotone threshold Boolean functions is made apparent.Keywords
This publication has 16 references indexed in Scilit:
- Counting and enumerating aggregate classifiersDiscrete Applied Mathematics, 2008
- Composition of Post classes and normal forms of Boolean functionsDiscrete Mathematics, 2006
- Characterization of invariant aggregation operatorsFuzzy Sets and Systems, 2004
- Aggregation of Interacting Criteria by Means of the Discrete Choquet Integral2002
- Integral Representation of Invariant FunctionalsJournal of Mathematical Analysis and Applications, 2000
- Triangular norm-based iterative compensatory operatorsFuzzy Sets and Systems, 1999
- Decompositions of positive self-dual boolean functionsDiscrete Mathematics, 1995
- Generating and approximating nondominated coteriesIEEE Transactions on Parallel and Distributed Systems, 1995
- On the possible merging functionsMathematical Social Sciences, 1989
- On scientific laws without dimensional constantsJournal of Mathematical Analysis and Applications, 1986