Sciweavers

569 search results - page 1 / 114
» An efficient clustering method for k-anonymization
Sort
View
DAWAK
2006
Springer
15 years 4 months ago
Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
Jiuyong Li, Raymond Chi-Wing Wong, Ada Wai-Chee Fu...
97
Voted
FSKD
2008
Springer
136views Fuzzy Logic» more  FSKD 2008»
15 years 2 months ago
k-Anonymity via Clustering Domain Knowledge for Privacy Preservation
Preservation of privacy in micro-data release is a challenging task in data mining. The k-anonymity method has attracted much attention of researchers. Quasiidentifier is a key co...
Taiyong Li, Changjie Tang, Jiang Wu, Qian Luo, She...
222
Voted
ICDE
2008
IEEE
219views Database» more  ICDE 2008»
16 years 2 months ago
Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases
Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the k-anonymity principle, each release of data must be such th...
Osman Abul, Francesco Bonchi, Mirco Nanni
106
Voted
DMIN
2008
152views Data Mining» more  DMIN 2008»
15 years 2 months ago
PCS: An Efficient Clustering Method for High-Dimensional Data
Clustering algorithms play an important role in data analysis and information retrieval. How to obtain a clustering for a large set of highdimensional data suitable for database ap...
Wei Li 0011, Cindy Chen, Jie Wang
143
Voted
CGF
2010
171views more  CGF 2010»
14 years 10 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu