Analysing monotonicity in non-deterministic computable aggregations: the probabilistic case

DOI10.1016/j.ins.2021.11.015OpenAlexW3217575800MaRDI QIDQ6188179

Luis Garmendia, Daniel Gómez, Luis Magdalena, Javier Montero

Publication date: 1 February 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.11.015

zbMATH Keywords

aggregationmonotonicitycomputable aggregationnon-deterministic aggregationorders of lists

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computability and recursion theory (03D99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Directional monotonicity of fusion functions
• Aggregation and fusion of imperfect information
• Generalized ordinal sums of aggregation operators on bounded lattices
• Weak and directional monotonicity of functions on Riesz spaces to fuse uncertain data
• Computable aggregations
• Strictly stable families of aggregation operators
• Fuzzy sets and their extensions: representation, aggregation and models. Intelligent systems from decision making to data mining, web intelligence and computer vision
• Exponential operational laws and new aggregation operators for intuitionistic multiplicative set in multiple-attribute group decision making process
• HIERARCHICAL AGGREGATION OF OWA OPERATORS: BASIC MEASURES AND RELATED COMPUTATIONAL PROBLEMS
• Representation of consistent recursive rules.

This page was built for publication: Analysing monotonicity in non-deterministic computable aggregations: the probabilistic case