SIGN IN
SIGN UP
An efficient clustering method for k-anonymization
Full Text:
PDF
Buy this Article
Authors:
Jun-Lin Lin
Yuan Ze University, Chung-Li, Taiwan
Meng-Cheng Wei
Yuan Ze University, Chung-Li, Taiwan
Published in:
· Proceeding
PAIS '08 Proceedings of the 2008 international workshop on Privacy and anonymity in information society
Pages 46-50
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-59593-965-4
doi>
10.1145/1379287.1379297
2008 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 43
· Downloads (cumulative): 246
· Citation Count: 8
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
anonymity
clustering
database applications
experimentation
greedy algorithm
performance
privacy
theory
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