Graph anonymization via metric embed-dings: Using classical anonymization for graphs.
Arnau PadrolVictor Muntés-MuleroPublished in: Intell. Data Anal. (2014)
Keyphrases
- privacy preserving
- graph representation
- maximum common subgraph
- information loss
- graph theory
- directed graph
- graph structure
- weighted graph
- privacy protection
- graph model
- graph matching
- privacy preservation
- graph databases
- graph construction
- series parallel
- graph clustering
- graph theoretic
- graph mining
- data publishing
- graph classification
- graph theoretical
- random graphs
- adjacency matrix
- data privacy
- graph search
- labeled graphs
- graph properties
- graph structures
- random walk
- graph partitioning
- spanning tree
- bipartite graph
- structural pattern recognition
- connected dominating set
- structured data
- connected components
- graph kernels
- graph transformation
- edge weights
- evolving graphs
- subgraph isomorphism
- graph isomorphism
- differential privacy
- adjacency graph
- real world graphs
- maximum clique
- social network data
- minimum spanning tree
- planar graphs
- reachability queries
- directed acyclic
- disclosure control
- maximum cardinality
- community discovery
- finding the shortest path
- inexact graph matching
- graph data