BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20181221T160731Z
LOCATION:C140/142
DTSTART;TZID=America/Chicago:20181115T110000
DTEND;TZID=America/Chicago:20181115T113000
UID:submissions.supercomputing.org_SC18_sess208_pap468@linklings.com
SUMMARY:Adaptive Anonymization of Data with b-Edge Covers
DESCRIPTION:Paper\nApplications, Graph Algorithms, Security, Tech Program 
 Reg Pass\n\nAdaptive Anonymization of Data with b-Edge Covers\n\nKhan, Cho
 romanski, Pothen, Ferdous, Halappanavar...\n\nWe explore the problem of sh
 aring data that pertains to individuals with anonymity guarantees, where e
 ach user requires a desired level of privacy.  We propose the first shared
 -memory as well as distributed memory parallel algorithms for the adaptive
  anonymity problem that achieves this goal, and produces high quality anon
 ymized datasets.  \n\nThe new algorithm is based on an optimization proced
 ure that iteratively computes weights on the edges of a dissimilarity matr
 ix, and at each iteration computes a minimum weighted b-Edge cover in the 
 graph. We are able to solve adaptive anonymity problems with hundreds of t
 housands of instances and hundreds of features on a leadership-class super
 computer in under five minutes. Our algorithm scales up to 4K cores on a d
 istributed memory supercomputer, while also providing good speedups on sha
 red memory multiprocessors. On smaller problems, where an algorithm based 
 on Belief Propagation is feasible, our algorithm is two orders of magnitud
 e faster.
URL:https://sc18.supercomputing.org/presentation/?id=pap468&sess=sess208
END:VEVENT
END:VCALENDAR