aggregationslib 0.1.7__tar.gz → 0.2.0__tar.gz

{aggregationslib-0.1.7 → aggregationslib-0.2.0}/.gitignore

@@ -127,3 +127,6 @@ dmypy.json
 
 # Pyre type checker
 .pyre/
+
+# Local scratch files and generated temporary data
+/tmp/

{aggregationslib-0.1.7/aggregationslib.egg-info → aggregationslib-0.2.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: aggregationslib
-Version: 0.1.7
+Version: 0.2.0
 Summary: Python implementation of Arithmetic, quasi arithmetic and other aggregating functions
 Author: wgalka
 Project-URL: Homepage, https://github.com/wgalka/Means
@@ -23,17 +23,19 @@ Dynamic: license-file
 Means
 =====
 
-Means, Aggregation functions…
+Means, Aggregation functions...
 
 Documentation:
 
 - English: https://wgalka.github.io/Means/en/
 - Polski: https://wgalka.github.io/Means/pl/
 
-Aggregations functions are: - Conjuctive - the final aggregated value
-will always be influenced by the smallest value among the inputs. -
-Disjnuctive - the aggregated value will always be influenced by the
-largest value among the inputs.
+Aggregations functions are:
+
+- Conjuctive - the final aggregated value will always be influenced by
+  the smallest value among the inputs.
+- Disjnuctive - the aggregated value will always be influenced by the
+  largest value among the inputs.
 
 Example 1:
 ^^^^^^^^^^
@@ -56,7 +58,7 @@ Example2:
 ^^^^^^^^^
 
 To get information about aggregation function you can use ``__str__()``
-or ‘**repr**\ ()’ methods.
+or '**repr**\ ()' methods.
 
 .. code:: pycon
 
@@ -75,19 +77,67 @@ or ‘**repr**\ ()’ methods.
 Aggregation functions
 ---------------------
 
-Aggregation function [1] is a mapping :math:`A:[0,1]^n\to[0,1]`,
-:math:`n \in \mathbb{N}`, :math:`n\ge 2` which is is increasing and
-fulfills two boundary conditions, namely :math:`A(0,\dots,0) = 0`,
-:math:`A(1,\dots,1) = 1`.
+An aggregation function on the unit interval [1] is an increasing
+mapping :math:`A:[0,1]^n\to[0,1]`, :math:`n \in \mathbb{N}`,
+:math:`n\ge 2`, satisfying :math:`A(0,\dots,0) = 0` and
+:math:`A(1,\dots,1) = 1`. For inputs on another interval
+:math:`[a,b]\subset\mathbb{R}`, an :math:`[a,b]`-aggregation is an
+increasing mapping :math:`A:[a,b]^n\to[a,b]` satisfying
+:math:`A(a,\dots,a)=a` and :math:`A(b,\dots,b)=b`.
+
+The following aggregation functions are implemented in this library.
+Tags describe properties of each formula. ``averaging`` means the result
+lies between the minimum and maximum inputs; ``conjunctive`` means it
+does not exceed the minimum; ``symmetric`` means permuting the inputs
+does not change the result. ``aggregation interval`` states the
+intervals on which the formula is an aggregation function: an increasing
+map :math:`A:[a,b]^n\to[a,b]` satisfying :math:`A(a,\dots,a)=a` and
+:math:`A(b,\dots,b)=b`. ``any [a,b] ⊂ ℝ`` includes intervals with
+negative values; ``any [a,b] ⊆ [0,∞)`` is restricted to nonnegative
+intervals. ``[0,1]`` means only the unit interval. These are
+mathematical properties; most callable objects do not validate input
+bounds at runtime. Some tags depend on parameters or the fuzzy measure.
+
+:math:`\mathbf{A_{ch}^{(\mu)}}` **- Choquet integral [1]**
+
+Tags: ``averaging`` ``aggregation interval: [0,1]``
+``symmetric if μ is symmetric``
+
+For an input vector :math:`(x_1,\dots,x_n)\in[0,1]^n`, let
+:math:`\sigma` sort its indices so that
+:math:`x_{\sigma(1)} \leq \dots \leq x_{\sigma(n)}`. Define
+:math:`A_i=\{\sigma(i),\dots,\sigma(n)\}` and :math:`x_{\sigma(0)}=0`:
+
+.. math:: A_{ch}^{(\mu)}(x_1,\dots,x_n)=\sum_{i=1}^{n}(x_{\sigma(i)}-x_{\sigma(i-1)})\,\mu(A_i)
+
+With the default cardinality measure :math:`\mu(A)=|A|/n`, this is the
+arithmetic mean,
+:math:`A_{ch}^{(\mu)}(x_1,\dots,x_n)=\frac{1}{n}\sum_{i=1}^{n}x_i`.
+
+:math:`\mathbf{A_{sg}^{(\mu)}}` **- Sugeno integral [1]**
 
-The floowoing aggregation functions are implemented in this library:
+Tags: ``averaging`` ``aggregation interval: [0,1]``
+``symmetric if μ is symmetric``
+
+For an input vector :math:`(x_1,\dots,x_n)\in[0,1]^n`, let
+:math:`\sigma` sort its indices so that
+:math:`x_{\sigma(1)} \leq \dots \leq x_{\sigma(n)}`, and define
+:math:`A_i=\{\sigma(i),\dots,\sigma(n)\}`:
+
+.. math:: A_{sg}^{(\mu)}(x_1,\dots,x_n)=\max_{1\leq i\leq n}\min(x_{\sigma(i)},\mu(A_i))
 
 :math:`\mathbf{A_{ar}}` **- Arithmetic mean**
 
+Tags: ``averaging`` ``symmetric``
+``aggregation interval: any [a,b] ⊂ ℝ``
+
 .. math:: A_{ar}(x_1,...,x_n)=\frac{1}{n}\sum \limits_{k=1}^{n} x_k
 
 :math:`\mathbf{A_{qd}}` **- Quadratic mean**
 
+Tags: ``averaging`` ``symmetric``
+``aggregation interval: any [a,b] ⊆ [0,∞)``
+
 .. math::
 
    A_{qd}(x_1,...,x_n)=\sqrt{\frac{1}{n}\sum
@@ -95,10 +145,15 @@ The floowoing aggregation functions are implemented in this library:
 
 :math:`\mathbf{A_{pr}}` **- Product aggregation**
 
+Tags: ``conjunctive`` ``symmetric`` ``aggregation interval: [0,1]``
+
 .. math:: A_{pr}(x_1, x_2, \dots, x_n) = \prod_{k=1}^n x_k
 
 :math:`\mathbf{A_{gm}}` **- Geometric mean**
 
+Tags: ``averaging`` ``symmetric``
+``aggregation interval: any [a,b] ⊆ [0,∞)``
+
 .. math::
 
    A_{gm}(x_1,...,x_n)=\sqrt[n]{\prod
@@ -106,6 +161,9 @@ The floowoing aggregation functions are implemented in this library:
 
 :math:`\mathbf{A_{hm}}` **- Harmonic mean**
 
+Tags: ``averaging`` ``symmetric``
+``aggregation interval: any [a,b] ⊆ [0,∞)``
+
 .. math::
 
 
@@ -117,6 +175,9 @@ The floowoing aggregation functions are implemented in this library:
 
 :math:`\mathbf{A_{pw}^{(r)}}` **- Power mean**
 
+Tags: ``averaging`` ``symmetric``
+``aggregation interval: any [a,b] ⊆ [0,∞)`` ``r ≠ 0``
+
 .. math::
 
 
@@ -126,29 +187,40 @@ The floowoing aggregation functions are implemented in this library:
    \Big(\frac{1}{n} \sum\limits_{k=1}^{n} x_k^r \Big)^{\frac{1}{r}}, & \text{otherwise}
    \end{cases}
 
-special cases of power means :math:`A_{\text{pw}}^r` [1] are: -
-Arithmetic Mean where r=1; - Quadratic Mean where r=2; - Harmonic Mean
-where r=-1; - Geometric Mean obtained as the limit
-:math:`\lim_{r \to 0} A_{\text{pw}}^r`.
+special cases of power means :math:`A_{\text{pw}}^r` [1] are:
+
+- Arithmetic Mean where r=1;
+- Quadratic Mean where r=2;
+- Harmonic Mean where r=-1;
+- Geometric Mean obtained as the limit
+  :math:`\lim_{r \to 0} A_{\text{pw}}^r`.
 
 --------------
 
 :math:`\mathbf{A_{ex}^{(r)}}` **- Exponential mean**
 
+Tags: ``averaging`` ``symmetric``
+``aggregation interval: any [a,b] ⊂ ℝ`` ``r ≠ 0``
+
 .. math::
 
    A_{ex}^{(r)}(x_1,...,x_n)= \frac{1}{r}\ln
    \Big(\frac{1}{n} \sum \limits_{k=1}^{n} e^{rx_k}\Big), \text{where
    } r \in \mathbb{R}, r \neq 0
 
-For computer implementations, to avoid numerical instability (overflow when :math:`r x_k > 709.78` or underflow when all :math:`r x_k < -709.78`), we use a numerically stable Log-Sum-Exp formulation by shifting the exponents by :math:`a_{max} = \max_{j} (r x_j)`:
+For computer implementations, to avoid numerical instability (overflow
+when :math:`r x_k > 709.78` or underflow when all
+:math:`r x_k < -709.78`), we use a numerically stable Log-Sum-Exp
+formulation by shifting the exponents by
+:math:`a_{max} = \max_{j} (r x_j)`:
 
-.. math::
-
-   A_{ex}^{(r)}(x_1,...,x_n) = \frac{1}{r} \left[ a_{max} + \ln \left( \sum_{i=1}^n e^{r x_i - a_{max}} \right) - \ln(n) \right]
+.. math:: A_{ex}^{(r)}(x_1,...,x_n) = \frac{1}{r} \left[ a_{max} + \ln \left( \sum_{i=1}^n e^{r x_i - a_{max}} \right) - \ln(n) \right]
 
 :math:`\mathbf{A_{lm}}` **- Lehmer mean**
 
+Tags: ``averaging`` ``symmetric``
+``aggregation interval: any [a,b] ⊆ [0,∞) if 0 ≤ r ≤ 1``
+
 .. math::
 
    A_{lm}(x_1,...,x_n)= \begin{cases}
@@ -158,6 +230,9 @@ For computer implementations, to avoid numerical instability (overflow when :mat
 
 :math:`\mathbf{A_{amn}^{(p)}}` **- Arithmetic minimum mean**
 
+Tags: ``averaging`` ``symmetric`` ``conjunctive if p = 0``
+``aggregation interval: any [a,b] ⊂ ℝ`` ``p ∈ [0,1]``
+
 .. math::
 
    A_{amn}^{(p)}(x_1,...,x_n)=\frac{p}{n}\sum \limits_{k=1}^{n} x_k+
@@ -165,6 +240,9 @@ For computer implementations, to avoid numerical instability (overflow when :mat
 
 :math:`\mathbf{A_{amx}^{(p)}}` **- Arithmetic maximum mean**
 
+Tags: ``averaging`` ``symmetric`` ``disjunctive if p = 0``
+``aggregation interval: any [a,b] ⊂ ℝ`` ``p ∈ [0,1]``
+
 .. math::
 
    A_{amx}^{(p)}(x_1,...,x_n)=\frac{p}{n}\sum \limits_{k=1}^{n} x_k+
@@ -179,6 +257,9 @@ case of calculating the arithmetic mean of the given values.
 
 :math:`\mathbf{A_{md}}` **- Median - ordered weighted aggregation**
 
+Tags: ``averaging`` ``symmetric``
+``aggregation interval: any [a,b] ⊂ ℝ``
+
 .. math::
 
    A_{md}(x_1,\dots,x_n) =
@@ -189,10 +270,16 @@ case of calculating the arithmetic mean of the given values.
 
 :math:`\mathbf{A_{ol}}` **- Olimpic aggregation**
 
+Tags: ``averaging`` ``symmetric``
+``aggregation interval: any [a,b] ⊂ ℝ``
+
 .. math::  A_{ol}(x_1,\dots,x_n) = \frac{1}{n-2} \sum \limits_{k=2}^{n-1}  y_k, \quad \text{where } \{y_1, \dots, y_n\} = \{x_1, \dots, x_n\},\ y_1 \leq y_2 \leq \dots \leq y_n.
 
 :math:`\mathbf{A_{oln}^{(p)}}` **- Olimpic aggregation**
 
+Tags: ``averaging`` ``symmetric``
+``aggregation interval: any [a,b] ⊂ ℝ`` ``p ∈ ℕ, p ≥ 1``
+
 We can specify how many greatest and smallest records remove
 
 .. math::  A_{oln}^{(p)}(x_1,\dots,x_n) = \frac{1}{n-2p} \sum \limits_{k=p+1}^{n-p}  y_k, \quad \text{where } \{y_1, \dots, y_n\} = \{x_1, \dots, x_n\},\ y_1 \leq y_2 \leq \dots \leq y_n, p \in \mathbb{N}, p\geq 1
@@ -201,14 +288,24 @@ We can specify how many greatest and smallest records remove
 
 :math:`\mathbf{A_{ln}}` **- Logaritmic aggregation [2]**
 
+Tags: ``averaging (continuous formula)`` ``symmetric``
+``aggregation interval (after continuous extension): any [a,b] ⊂ (0,∞)``
+
 .. math::
 
 
    A_{ln}\left(x_1, x_2, \ldots, x_n\right)=(n-1) ! \sum_{i=1}^n \frac{x_i}{\prod_{\substack{j=1 \\ j \neq i}}^n \log \left(x_i / x_j\right)}
 
+The formula has a continuous averaging extension when input values
+coincide, but the current implementation does not handle ties: a zero
+denominator makes it return ``0``.
+
 :math:`\mathbf{A^{(p)}_{A_1,A_2}}` - Convex combinations of aggregation functions
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 
+Tags: ``aggregation interval: common interval of A₁ and A₂``
+``averaging if both inputs are averaging`` ``p ∈ [0,1]``
+
 We can construct covex combination of aggregation functions as
 :math:`A^{(p)}_{A_1,A_2}=pA_1+(1-p)A_2`, where :math:`A_1, A_2` are
 aggregation functions and :math:`p \in [0,1]`.
@@ -216,7 +313,7 @@ aggregation functions and :math:`p \in [0,1]`.
 References
 ----------
 
-1. Beliakov, G., Bustince, H., and Calvo, T.: A practical Guide to
-   Averaging Functions. Berlin: Springer Vol. 329, 2016.
+1. Beliakov, G., Bustince, H., and Calvo, T.: *A Practical Guide to
+   Averaging Functions*. Berlin: Springer, vol. 329, 2016.
 2. `Mustonen, Seppo. (2010). Logarithmic mean for several
    arguments. <https://www.researchgate.net/publication/228886844_Logarithmic_mean_for_several_arguments>`__

{aggregationslib-0.1.7 → aggregationslib-0.2.0}/README.md

@@ -1,14 +1,14 @@
-# Means
-Means, Aggregation functions...
-
-Documentation:
-
-- English: https://wgalka.github.io/Means/en/
-- Polski: https://wgalka.github.io/Means/pl/
-
-Aggregations functions are:
-- Conjuctive - the final aggregated value will always be influenced by the smallest value among the inputs.
-- Disjnuctive - the aggregated value will always be influenced by the largest value among the inputs.
+# Means
+Means, Aggregation functions...
+
+Documentation:
+
+- English: https://wgalka.github.io/Means/en/
+- Polski: https://wgalka.github.io/Means/pl/
+
+Aggregations functions are:
+- Conjuctive - the final aggregated value will always be influenced by the smallest value among the inputs.
+- Disjnuctive - the aggregated value will always be influenced by the largest value among the inputs.
 
 #### Example 1:
 
@@ -47,32 +47,77 @@ print(func3.__repr__()) # function parameters are printed in order: func1, func2
 
 ## Aggregation functions
 
-Aggregation function [1] is a mapping
-$A:[0,1]^n\to[0,1]$, $n \in \mathbb{N}$, $n\ge 2$ which is is increasing and
-fulfills two boundary conditions, namely $A(0,\dots,0) = 0$, $A(1,\dots,1) = 1$.
+An aggregation function on the unit interval [1] is an increasing mapping
+$A:[0,1]^n\to[0,1]$, $n \in \mathbb{N}$, $n\ge 2$, satisfying
+$A(0,\dots,0) = 0$ and $A(1,\dots,1) = 1$. For inputs on another interval
+$[a,b]\subset\mathbb{R}$, an $[a,b]$-aggregation is an increasing mapping
+$A:[a,b]^n\to[a,b]$ satisfying $A(a,\dots,a)=a$ and $A(b,\dots,b)=b$.
+
+The following aggregation functions are implemented in this library. Tags
+describe properties of each formula. `averaging` means the result lies between
+the minimum and maximum inputs; `conjunctive` means it does not exceed the
+minimum; `symmetric` means permuting the inputs does not change the result.
+`aggregation interval` states the intervals on which the formula is an
+aggregation function: an increasing map $A:[a,b]^n\to[a,b]$ satisfying
+$A(a,\dots,a)=a$ and $A(b,\dots,b)=b$. `any [a,b] ⊂ ℝ` includes intervals
+with negative values; `any [a,b] ⊆ [0,∞)` is restricted to nonnegative
+intervals. `[0,1]` means only the unit interval. These are mathematical
+properties; most callable objects do not validate input bounds at runtime.
+Some tags depend on parameters or the fuzzy measure.
+
+$\mathbf{A_{ch}^{(\mu)}}$ **- Choquet integral [1]**
+
+Tags: `averaging` `aggregation interval: [0,1]` `symmetric if μ is symmetric`
+
+For an input vector $(x_1,\dots,x_n)\in[0,1]^n$, let $\sigma$
+sort its indices so that $x_{\sigma(1)} \leq \dots \leq x_{\sigma(n)}$.
+Define $A_i=\{\sigma(i),\dots,\sigma(n)\}$ and $x_{\sigma(0)}=0$:
+
+$$A_{ch}^{(\mu)}(x_1,\dots,x_n)=\sum_{i=1}^{n}(x_{\sigma(i)}-x_{\sigma(i-1)})\,\mu(A_i)$$
 
-The floowoing aggregation functions are implemented in this library:
+With the default cardinality measure $\mu(A)=|A|/n$, this is the arithmetic
+mean, $A_{ch}^{(\mu)}(x_1,\dots,x_n)=\frac{1}{n}\sum_{i=1}^{n}x_i$.
+
+$\mathbf{A_{sg}^{(\mu)}}$ **- Sugeno integral [1]**
+
+Tags: `averaging` `aggregation interval: [0,1]` `symmetric if μ is symmetric`
+
+For an input vector $(x_1,\dots,x_n)\in[0,1]^n$, let $\sigma$ sort its indices
+so that $x_{\sigma(1)} \leq \dots \leq x_{\sigma(n)}$, and define
+$A_i=\{\sigma(i),\dots,\sigma(n)\}$:
+
+$$A_{sg}^{(\mu)}(x_1,\dots,x_n)=\max_{1\leq i\leq n}\min(x_{\sigma(i)},\mu(A_i))$$
 
 $\mathbf{A_{ar}}$ **- Arithmetic mean**
 
+Tags: `averaging` `symmetric` `aggregation interval: any [a,b] ⊂ ℝ`
+
 $$A_{ar}(x_1,...,x_n)=\frac{1}{n}\sum \limits_{k=1}^{n} x_k$$
 
 $\mathbf{A_{qd}}$ **- Quadratic mean**
 
+Tags: `averaging` `symmetric` `aggregation interval: any [a,b] ⊆ [0,∞)`
+
 $$A_{qd}(x_1,...,x_n)=\sqrt{\frac{1}{n}\sum
 \limits_{k=1}^{n} x_k^2}$$
 
 $\mathbf{A_{pr}}$ **- Product aggregation**
 
+Tags: `conjunctive` `symmetric` `aggregation interval: [0,1]`
+
 $$A_{pr}(x_1, x_2, \dots, x_n) = \prod_{k=1}^n x_k$$
 
 $\mathbf{A_{gm}}$ **- Geometric mean**
 
+Tags: `averaging` `symmetric` `aggregation interval: any [a,b] ⊆ [0,∞)`
+
 $$A_{gm}(x_1,...,x_n)=\sqrt[n]{\prod
 \limits_{k=1}^{n} x_k}$$
 
 $\mathbf{A_{hm}}$ **- Harmonic mean**
 
+Tags: `averaging` `symmetric` `aggregation interval: any [a,b] ⊆ [0,∞)`
+
 $$
 A_{hm}(x_1,...,x_n) =
 \begin{cases}
@@ -84,6 +129,8 @@ $$
 
 $\mathbf{A_{pw}^{(r)}}$ **- Power mean**
 
+Tags: `averaging` `symmetric` `aggregation interval: any [a,b] ⊆ [0,∞)` `r ≠ 0`
+
 $$
 A_{pw}^{(r)}(x_1,...,x_n) =
 \begin{cases}
@@ -104,6 +151,8 @@ special cases of power means $A_{\text{pw}}^r$ [1] are:
 
 $\mathbf{A_{ex}^{(r)}}$ **- Exponential mean**
 
+Tags: `averaging` `symmetric` `aggregation interval: any [a,b] ⊂ ℝ` `r ≠ 0`
+
 $$A_{ex}^{(r)}(x_1,...,x_n)= \frac{1}{r}\ln
 \Big(\frac{1}{n} \sum \limits_{k=1}^{n} e^{rx_k}\Big), \text{where
 } r \in \mathbb{R}, r \neq 0$$
@@ -114,6 +163,8 @@ $$A_{ex}^{(r)}(x_1,...,x_n) = \frac{1}{r} \left[ a_{max} + \ln \left( \sum_{i=1}
 
 $\mathbf{A_{lm}}$ **- Lehmer mean**
 
+Tags: `averaging` `symmetric` `aggregation interval: any [a,b] ⊆ [0,∞) if 0 ≤ r ≤ 1`
+
 $$A_{lm}(x_1,...,x_n)= \begin{cases}
 0, & r\leq 1, \exists_{1 \leq k \leq n} x^{k} = 0 \\
 \frac{\sum \limits_{k=1}^{n}x_k^r}{\sum \limits_{k=1}^{n}x_k^{r-1}}, & \text{otherwise}
@@ -121,11 +172,15 @@ $$A_{lm}(x_1,...,x_n)= \begin{cases}
 
 $\mathbf{A_{amn}^{(p)}}$ **- Arithmetic minimum mean**
 
+Tags: `averaging` `symmetric` `conjunctive if p = 0` `aggregation interval: any [a,b] ⊂ ℝ` `p ∈ [0,1]`
+
 $$A_{amn}^{(p)}(x_1,...,x_n)=\frac{p}{n}\sum \limits_{k=1}^{n} x_k+
 (1-p) \min \limits_{1 \leq k \leq n}x_k, p \in [0, 1]$$
 
 $\mathbf{A_{amx}^{(p)}}$ **- Arithmetic maximum mean**
 
+Tags: `averaging` `symmetric` `disjunctive if p = 0` `aggregation interval: any [a,b] ⊂ ℝ` `p ∈ [0,1]`
+
 $$A_{amx}^{(p)}(x_1,...,x_n)=\frac{p}{n}\sum \limits_{k=1}^{n} x_k+
 (1-p) \max \limits_{1\leq k \leq n}x_k, p \in [0, 1]$$
 
@@ -138,6 +193,8 @@ arithmetic mean of the given values.
 
 $\mathbf{A_{md}}$ **- Median - ordered weighted aggregation**
 
+Tags: `averaging` `symmetric` `aggregation interval: any [a,b] ⊂ ℝ`
+
 $$A_{md}(x_1,\dots,x_n) =
 \begin{cases}
 y_{(n+1)/2},&\text{if $n$ is odd}\\
@@ -146,10 +203,14 @@ y_{(n+1)/2},&\text{if $n$ is odd}\\
 
 $\mathbf{A_{ol}}$ **- Olimpic aggregation**
 
+Tags: `averaging` `symmetric` `aggregation interval: any [a,b] ⊂ ℝ`
+
 $$ A_{ol}(x_1,\dots,x_n) = \frac{1}{n-2} \sum \limits_{k=2}^{n-1}  y_k, \quad \text{where } \{y_1, \dots, y_n\} = \{x_1, \dots, x_n\},\ y_1 \leq y_2 \leq \dots \leq y_n.$$
 
 $\mathbf{A_{oln}^{(p)}}$ **- Olimpic aggregation**
 
+Tags: `averaging` `symmetric` `aggregation interval: any [a,b] ⊂ ℝ` `p ∈ ℕ, p ≥ 1`
+
 We can specify how many greatest and smallest records remove
 
 $$ A_{oln}^{(p)}(x_1,\dots,x_n) = \frac{1}{n-2p} \sum \limits_{k=p+1}^{n-p}  y_k, \quad \text{where } \{y_1, \dots, y_n\} = \{x_1, \dots, x_n\},\ y_1 \leq y_2 \leq \dots \leq y_n, p \in \mathbb{N}, p\geq 1$$
@@ -157,18 +218,26 @@ $$ A_{oln}^{(p)}(x_1,\dots,x_n) = \frac{1}{n-2p} \sum \limits_{k=p+1}^{n-p}  y_k
 --------------------
 
 $\mathbf{A_{ln}}$ **- Logaritmic aggregation [2]**
+
+Tags: `averaging (continuous formula)` `symmetric` `aggregation interval (after continuous extension): any [a,b] ⊂ (0,∞)`
+
 $$
 A_{ln}\left(x_1, x_2, \ldots, x_n\right)=(n-1) ! \sum_{i=1}^n \frac{x_i}{\prod_{\substack{j=1 \\ j \neq i}}^n \log \left(x_i / x_j\right)}
 $$
 
+The formula has a continuous averaging extension when input values coincide,
+but the current implementation does not handle ties: a zero denominator makes
+it return `0`.
+
 ### $\mathbf{A^{(p)}_{A_1,A_2}}$ - Convex combinations of aggregation functions
 
+Tags: `aggregation interval: common interval of A₁ and A₂` `averaging if both inputs are averaging` `p ∈ [0,1]`
+
 We can construct covex combination of aggregation functions as $A^{(p)}_{A_1,A_2}=pA_1+(1-p)A_2$, where $A_1, A_2$ are aggregation functions and $p \in [0,1]$.
 
 
 
 ## References
 
-1. Beliakov, G., Bustince, H., and Calvo, T.: A practical Guide to Averaging Functions.
-   Berlin: Springer Vol. 329, 2016.
+1. Beliakov, G., Bustince, H., and Calvo, T.: *A Practical Guide to Averaging Functions*. Berlin: Springer, vol. 329, 2016.
 2. [Mustonen, Seppo. (2010). Logarithmic mean for several arguments. ](https://www.researchgate.net/publication/228886844_Logarithmic_mean_for_several_arguments)

{aggregationslib-0.1.7 → aggregationslib-0.2.0}/README.pl.md

@@ -36,7 +36,7 @@ python -m pip install aggregationslib
 ## Szybki przykład
 
 ```python
-from aggregationslib.aggregations import A_amn, A_ar, Combine2Aggregations
+from aggregationslib import A_amn, A_ar, Combine2Aggregations
 
 data = [0.2, 0.6, 0.7]
 
@@ -49,6 +49,29 @@ print(func2(data))
 
 Informacje o funkcji agregacji można uzyskać za pomocą metod `__str__()` lub `__repr__()`.
 
+## Całki rozmyte Choqueta i Sugeno
+
+Funkcje `choquet_integral` i `sugeno_integral` oraz obiekty wywoływalne `A_ch`
+i `A_sg` agregują jednowymiarowy wektor wartości z `[0, 1]` do jednej liczby.
+Domyślnie korzystają z miary kardynalności; można też podać własną miarę
+symetryczną albo pełną miarę rozmytą.
+
+Dla wektora wejściowego $(x_1,\dots,x_n)\in[0,1]^n$ niech $\sigma$
+porządkuje indeksy tak, aby $x_{\sigma(1)}\leq\dots\leq x_{\sigma(n)}$.
+Definiujemy $A_i=\{\sigma(i),\dots,\sigma(n)\}$ oraz
+$x_{\sigma(0)}=0$. Wtedy:
+
+- **Całka Choqueta [1]**:
+  $C_\mu(x_1,\dots,x_n)=\sum_{i=1}^n(x_{\sigma(i)}-x_{\sigma(i-1)})\,\mu(A_i)$;
+- **Całka Sugeno [1]**:
+  $S_\mu(x_1,\dots,x_n)=\max_{1\leq i\leq n}\min(x_{\sigma(i)},\mu(A_i))$.
+
+Przy domyślnej mierze `mu(A) = |A| / n` całka Choqueta jest równa średniej
+arytmetycznej: $C_\mu(x_1,\dots,x_n)=(1/n)\sum_{i=1}^n x_i$. Wersje `float` mogą różnić
+się od średniej na ostatnich bitach wskutek zaokrągleń.
+
+Szczegóły i przykłady: [całki rozmyte](docs/fuzzy-integrals.md).
+
 ## Zbiory klasyczne i rozmyte
 
 Zbiór klasyczny (*crisp set*) opisuje funkcja przynależności:
@@ -706,8 +729,7 @@ A_arpw(r=3)
 
 ## Referencje
 
-1. Beliakov, G., Bustince, H. i Calvo, T.: *A Practical Guide to Averaging Functions*.
-   Berlin: Springer, vol. 329, 2016.
+1. Beliakov, G., Bustince, H. i Calvo, T.: *A Practical Guide to Averaging Functions*. Berlin: Springer, vol. 329, 2016.
 2. Mustonen, Seppo (2010):
    [Logarithmic mean for several arguments](https://www.researchgate.net/publication/228886844_Logarithmic_mean_for_several_arguments).
 3. [Aggregation functions](https://arxiv.org/pdf/2208.01644).