Graph k-Anonymity through k-Means and as Modular Decomposition.
Klara StokesPublished in: NordSec (2013)
Keyphrases
- k means
- structural learning
- information loss
- clustering algorithm
- privacy preserving
- graph mining
- graph structure
- graph theory
- privacy preservation
- random walk
- tree decomposition
- connected components
- original data
- spectral clustering
- weighted graph
- privacy protection
- attribute values
- graph model
- directed graph
- normalized cut
- graph theoretic
- graph representation
- private information
- self organizing maps
- cluster analysis
- data sets
- hierarchical clustering
- graph partitioning
- clustering method
- bipartite graph
- strongly connected components