matrix_graphe

m_crois

<p>Bool&lt;U+00E9&gt;en indiquant s'il faut consid&lt;U+00E9&gt;rer les zones de z2
recouvrant trois zones ou plus de z1.</p>

multi

<p>Fonction permettant &lt;U+00E0&gt; partir de la matrice de croisement
de d&lt;U+00E9&gt;terminer la matrice d'adjacence du graphe. Cette matrice
de graphe est pond&lt;U+00E9&gt;r&lt;U+00E9&gt;e et non symm&lt;U+00E9&gt;trique (ce qui correspond
&lt;U+00E0&gt; un graphe orient&lt;U+00E9&gt;).</p>

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>.

matrix_graphe: Constuire la matrice d'adjacence du graphe

Description

Usage

Arguments

Value

Details