A non-deterministic computable aggregation P is population monotone if and only if, when L 1 ≤ 1 to 1 L 2 then P ( L 1 ) ⩽ D P ( L 2 ) . Let us observe that previous definition generalizes the classical definition of monotonicity for deterministic computable aggregations.
Abstract: Computable aggregation operators can be seen as a generalization of aggregation operators where the mathematical function is replaced by a program ...
In this work, a new concept of monotonicity is proposed, from a probabilistic perspective, for non-deterministic computable aggregation operators. To be ...
Jul 11, 2021 · In this work, a new concept of monotonicity is proposed, from a probabilistic perspective, for non-deterministic computable aggregation ...
The purpose of this paper is to revisit and adapt the concept of monotony (as a central property of aggregation processes) for non-deterministic computable ...
aggregation process. Example 1. Let's consider a population Xof size n. (X={x1,...,xn}). Suppose that the objective of the. aggregation process is to estimate ...
Population Monotonicity of Non-deterministic Computable Aggregations · Abstract · Authors · BibTeX · References · Bibliographies · Reviews · Related ...
Analysing monotonicity in non-deterministic computable ...
dl.acm.org › doi › abs › j.ins.2021.11.015
Jan 1, 2022 · The present paper will explore this kind of non-deterministic aggregation processes, first from an empirical point of view and then in terms of ...
Aug 30, 2021 · In this new framework, the concept of monotonicity of an aggregation, linked to the monotonicity of the function defining the aggregation, ...
Missing: Population | Show results with:Population
May 15, 2020 · This new concept of aggregation introduces the scenario where the aggregation can even be non-deterministic. In this work, this new class of ...