test_fus

Entiers indiquant les zones de z1.

i, j

m_crois

threshold de confidentialit&lt;U+00E9&gt;.

threshold

M&lt;U+00E9&gt;thode &lt;U+00E0&gt; choisir parmi "m1", "m2" et "both".

methode

On teste selon la m&lt;U+00E9&gt;thode 1, 2 ou les deux &lt;U+00E0&gt; la fois, si
deux zones i et j de z1 peuvent &lt;U+00EA&gt;tre fusionn&lt;U+00E9&gt;es ou non

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

test_fus: Tester si on peut fusionner deux zones de z1

Description

Usage

Arguments

Value