• No se han encontrado resultados

A survey of graph modification techniques for privacy preserving on networks

N/A
N/A
Protected

Academic year: 2020

Share "A survey of graph modification techniques for privacy preserving on networks"

Copied!
29
0
0

Texto completo

Loading

Figure

Fig. 1: Na¨ıve anonymization of a toy network, where G is the original graph, e G is the na¨ıve anonymous version and eG Dan is Dan’s 1-neighbourhood.
Fig. 2: Basic operations for edge modification.
Fig. 3: Random perturbation example, where G is the original graph, e G ra and Ge sw are perturbed versions of the network by Rand add/del and Rand switch, respectively.
Fig. 4: Constrained perturbation example, where G is the original graph, e G em and Ge va are 2-degree anonymous versions of the network by edge modifications and by vertex and edge addition, respectively.
+3

Referencias

Documento similar

The recent exponential growing of machine learning techniques (data-mining, deep-learning, manifold learning, linear and nonlinear regression techniques ... to cite but a few) makes

[3] or the graph neural networks (GNN) considered by Jiang and Luo [4]; these surveys are hence limited to a subset of the techniques available in the literature, whereas our goal is

Table 1 shows the training time and recognition rate comparison of the existing and the proposed techniques using the Yale face database.. The graph in Figure 8 shows the

Create graph widget and add data elements with element element operation.. Symbols are the

In our analysis we have focused on the impact of the additional states for leptonic charged currents: the modification of the Standard Model W ℓν vertex can lead to poten- tially

In particular, the possibility of combining meta- modelling with graph transformation, as well as the use of parallel graph transformations, are available for both regular and

In our approach, restoration is performed using linear filters in the spatial domain. Filter coefficients are determined by means of a learning process based on examples, to obtain

Since the rules are applied to the host graph using injective matches only, and the GTS with a valid source model satisfies the Layered Graph Grammar Defi- nition (Def. 1), the