Privacy Preserving Unsupervised Clustering over Vertically Partitioned Data
From MaRDI portal
Publication:3603087
DOI10.1007/11751649_70zbMATH Open1202.68176OpenAlexW2111422419MaRDI QIDQ3603087FDOQ3603087
Authors: Dimitris K. Tasoulis, E. C. Laskari, G. C. Meletiou, Michael N. Vrahatis
Publication date: 12 February 2009
Published in: Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11751649_70
Recommendations
- Privacy-preserving data publishing: a constraint-based clustering approach
- Data and Applications Security XIX
- Privacy preserving association rules mining based on secure two-party computation
- Incorporating Privacy Concerns in Data Mining on Distributed Data
- Efficient systematic clustering method for \(k\)-anonymization
Cited In (8)
- Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
- Privacy-preserving data publishing: a constraint-based clustering approach
- A novel vertical fragmentation method for privacy protection based on entropy minimization in a relational database
- Density-based clustering with differential privacy
- Privacy-aware data sharing in a tree-based categorical clustering algorithm
- Decomposable algorithms for nearest neighbor computing
- Efficient privacy preservation of big data for accurate data mining
- Privacy-preserving data splitting: a combinatorial approach
This page was built for publication: Privacy Preserving Unsupervised Clustering over Vertically Partitioned Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603087)