SIGN IN
SIGN UP
Achieving anonymity via clustering
Full Text:
Pdf
Buy this Article
Authors:
Gagan Aggarwal
Google Inc., Mountain View, CA
Tomás Feder
Stanford University, Stanford, CA
Krishnaram Kenthapadi
Stanford University, Stanford, CA
Samir Khuller
University of Maryland, College Park, MD
Rina Panigrahy
Stanford University, Stanford, CA
Dilys Thomas
Stanford University, Stanford, CA
An Zhu
Google Inc., Mountain View, CA
2006 Article
Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 70
· Downloads (cumulative): 1,001
· Citation Count: 64
Published in:
· Proceeding
PODS '06
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pages 153 - 162
ACM
New York, NY
, USA
©2006
table of contents
ISBN:1-59593-318-2
doi>
10.1145/1142351.1142374
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
anonymity
approximation algorithms
clustering
clustering
data mining
privacy
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder