test_fus_m1

Entiers indiquant deux lignes diff&lt;U+00E9&gt;rentes de <code>m_crois</code>.

i, j

m_crois

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

threshold

Fonction permettant de tester si les sommets i et j peuvent
&lt;U+00EA&gt;tre fusionn&lt;U+00E9&gt;s. La m&lt;U+00E9&gt;thode 1 consiste &lt;U+00E0&gt; regarder les liens
entre les deux sommets et voir si ces deux liens ont une valeur
plus grande que le threshold de confidentialit&lt;U+00E9&gt;. Si c'est le cas, on
peut fusionner les deux sommets.

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_m1: Tester, selon la m<U+00E9>thode 1, si on peut fusionner deux sommets

Description

Usage

Arguments

Value

Details