BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Information Systems Group - ECPv6.4.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://isg.ics.uci.edu
X-WR-CALDESC:Events for Information Systems Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20231103T130000
DTEND;TZID=America/Los_Angeles:20231103T140000
DTSTAMP:20260528T104713
CREATED:20231031T202318Z
LAST-MODIFIED:20231031T202333Z
UID:1649-1699016400-1699020000@isg.ics.uci.edu
SUMMARY:Nada Lahjouji: ProBE: Proportioning Privacy Budget for Complex Exploratory Decision Support
DESCRIPTION:ProBE: Proportioning Privacy Budget for Complex Exploratory Decision Support\nNada Lahjouji \n\nPhD Student\, UC\, Irvine\n\n\n\nAbstract\nDecision support (DS) applications play a crucial role in analyzing large volumes of data to produce valuable insights that facilitate informed decision-making. Such data can\, however\, contain sensitive information about individuals that requires privacy-preserving mechanisms to prevent data leaks\, but this is done at the expense of data utility. In this talk\, we explore the trade-off between privacy and utility in the context of DS and define its utility requirements. Specifically\, we observe that DS classifications tasks are characterized by asymmetric utility\, where the false negatives and false positives resulting from added noise hold different weights depending on the application. Previous work in decision support models this asymmetric utility\, but only addresses simple DS queries with a single aggregate condition. We consider complex queries consisting of the conjunction and disjunction of multiple conditions on different aggregate statistics which encompass the full scope of exploratory data analysis for DS. We formally define such queries and their utility requirements\, and provide algorithms that apportion the preset budget to optimally minimize privacy loss while supporting a mathematical bound on the utility. Our experimental results on multiple real-life datasets show that our algorithms successfully maintain utility guarantees for complex decision support queries\, while also minimizing privacy loss.\n\nBio\nNada Lahjouji is a fourth-year Ph.D. student in the Computer Science Department at UC Irvine. Her research interests include differential privacy\, IoT\, and database systems.
URL:https://isg.ics.uci.edu/event/nada-lahjouji-probe-proportioning-privacy-budget-for-complex-exploratory-decision-support/
LOCATION:DBH 4011
END:VEVENT
END:VCALENDAR