matrix_liens

m_crois

<p>Cette fonction permet de cr&lt;U+00E9&gt;er une matrice carr&lt;U+00E9&gt; de bool&lt;U+00E9&gt;ens de taille
&lt;U+00E9&gt;gale au nombre de zones du zonage z1.</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>.

Vianney Costemalle

diffman

Detect Differentiation Problems

Arlindo Dos Santos

Francois Semecurbe

matrix_liens function

Cr&lt;U+00E9&gt;er la matrice de liens (ou matrice de contigu&lt;U+00EF&gt;t&lt;U+00E9&gt;) — matrix_liens

Cr&lt;U+00E9&gt;er la matrice de liens (ou matrice de contigu&lt;U+00EF&gt;t&lt;U+00E9&gt;)

matrix_liens: Cr<U+00E9>er la matrice de liens (ou matrice de contigu<U+00EF>t<U+00E9>)

Description

Usage

Arguments

Value

Details