simplify_mcrois

m_crois

<p>Simplifier la matrice de croisement revient &lt;U+00E0&gt; supprimer deux types de colones
(et donc supprimer des zones du zonage z2).
1 - on supprime les colonnes vides, c'est-&lt;U+00E0&gt;-dire ne contenant que des 0.
2 - on supprime les colonnes ne contenant qu'un seul &lt;U+00E9&gt;l&lt;U+00E9&gt;ment diff&lt;U+00E9&gt;rent de 0.</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

simplify_mcrois function

Simplifier la matrice de croisement — simplify_mcrois

Simplifier la matrice de croisement

simplify_mcrois: Simplifier la matrice de croisement

Description

Usage

Arguments

Value