Privacy-preserving data publishing: a constraint-based clustering approach
From MaRDI portal
Recommendations
Cited in
(15)- Privacy-aware data sharing in a tree-based categorical clustering algorithm
- Privacy-preserving data splitting: a combinatorial approach
- A weighted K-member clustering algorithm for K-anonymization
- Efficient secure data publishing algorithms for supporting information sharing
- Effective privacy preserving data publishing by vectorization
- Differential privacy preserving clustering using Daubechies-2 wavelet transform
- Privacy Preserving Unsupervised Clustering over Vertically Partitioned Data
- Semantic-based aggregation for statistical disclosure control
- A privacy-preserving clustering model based on density
- Privacy-preserving data publishing: An overview.
- Privacy preserving clustering with constraints
- Constrained obfuscation of relational databases
- \(T\)-closeness slicing: a new privacy-preserving approach for transactional data publishing
- A neighborhood topological potential entropy data perturbation method for clustering analysis
- K-anonymization approaches for supporting multiple constraints
This page was built for publication: Privacy-preserving data publishing: a constraint-based clustering approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526678)
