valeurs_lien

Entiers indiquant les zones de z1.

i, j

m_crois

d'autres param&lt;U+00E8&gt;tres h&lt;U+00E9&gt;rit&lt;U+00E9&gt;s de <code>zones_front</code>.

i et j &lt;U+00E9&gt;tant deux zones de z1, cette fonction donne la valeur
de l'ar&lt;U+00EA&gt;te reliant i et j et de celle reliant j &lt;U+00E0&gt; i.

An algorithm based on graph theory tools to detect differentiation
problems. A differentiation problem occurs when aggregated
data are disseminated according to two different nomenclatures. By making the
difference for an additive variable X between an aggregate composed of categories
of the first nomenclature and an other aggregate, included in that first
aggregate, composed of categories of the second nomenclature,
it is sometimes possible to derive X on a small aggregate of records
which could then lead to a break of confidentiality.
The purpose of this package is to detect the set of aggregates composed of
categories of the first nomenclature which lead to a differentiation problem,
when given a confidentiality threshold. Reference: Vianney Costemalle (2019) <doi: 10.3233/SJI-190564>.

Vianney Costemalle

valeurs_lien: Valeurs des ar<U+00EA>tes reliant i et j

Description

Usage

Arguments

Value