Material Detail

Approximation algorithms for k-anonymity and privacy preservation in query logs

This video was recorded at NATO Advanced Study Institute on Mining Massive Data Sets for Security. The talk (i) reviews a number of topics related to the concept of kanonymity, (ii) discusses two information-theoretic measures for capturing the amount of information that is lost during the anonymization process, (iii) presents approximation algorithms for the k-anonymization problem and (iv) discusses topics of privacy preservation on query logs.

Keywords:: videolectures, ocwc, oec

Disciplines:

Science and Technology / Computer Science / Programming & Programming Languages

Go to Material

Bookmark / Add to Course ePortfolio

Create a Learning Exercise

Add Accessibility Information

Rate

Add a Comment

Quality

User Rating
Comments
Learning Exercises
Bookmark Collections
Course ePortfolios
Accessibility Info

Report Broken Link
Report as Inappropriate

More about this material

Material Type:: Presentation
Date Added to MERLOT:: February 10, 2015
Date Modified in MERLOT:: February 10, 2015
Author:: Aris Gionis, Yahoo! Research Barcelona
Submitter:: The Open Education Consortium
Primary Audience:: College General Ed, College Lower Division, College Upper Division
Technical Format:: Video

Mobile Compatibility:: Not specified at this time
Language:: English
Cost Involved:: No
Source Code Available:: No
Accessibility Information Available:: Unknown
Creative Commons:: This work is licensed under a Attribution-NonCommercial-NoDerivs 3.0 United States