matrix_atomize

m_crois_connexe

Caracteres parmi "cassable" ou "incassable" indiquant
l'etat de la matrice de croisement connexe.

etat

Entier indiquant a partir de quelle taille de graphe
on decide de le decomposer (le "casser").

taille_max

Permet de decomposer un graphe, de fa&lt;U+00E7&gt;on iterative, jusqu'a
ce que tous les sous-graphes soient "incassables".

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_atomize: Completement decomposer un graphe.

Description

Usage

Arguments

Value