PhD Seminar • Data Systems — Predictable and Consistent Information ExtractionExport this event to calendar

Wednesday, May 29, 2019 — 12:15 PM EDT

Besat Kassaie, PhD candidate
David R. Cheriton School of Computer Science

Information extraction programs are applied to documents to isolate structured versions of some content, that is, to create corresponding records in a relational table. In this work we introduce a new research problem related to information extraction process. We consider an extracted table as a generated view from input documents. More specifically, given an extraction algorithm and a document, the extraction algorithm produces a table T as if T was a view of the input document. In line with this perspective, we are interested in updating the input document to produce a modified table T'.

We were motivated to answer this question by the problem of applying privacy transformations to documents. Consider the problem of maintaining privacy for personal information contained in a collection of medical documents when publishing research results derived from those records. It has been shown that simply avoiding the publication of identifiers does not protect the privacy of individuals. The solution to this problem has been to apply differential privacy.

Our approach is to apply differential privacy to the table(s) obtained from a document collection through information extraction. The result is that the modified extracted tables can be published and analyzed by untrusted parties without fearing the loss of privacy for individuals. We wish to present to those researchers a set of documents that would have produced the modified table using the same information extraction procedure been applied to them. 

We characterize extractors for which we are able to maintain consistency between input documents, the extractor, and modified tables. To this end, we introduce three properties for extractors. If a given extractor satisfies the proposed properties, we can guarantee that the consistency will be maintained. We propose a property verification process that uses static analysis for a substantial subset of JAPE, a well-established rule-based extraction language, and illustrate it through several examples.

Location 
DC - William G. Davis Computer Research Centre
1304
200 University Avenue West
Waterloo, ON N2L 3G1
Canada

S M T W T F S
28
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
  1. 2019 (123)
    1. June (4)
    2. May (22)
    3. April (32)
    4. March (25)
    5. February (16)
    6. January (24)
  2. 2018 (221)
    1. December (16)
    2. November (19)
    3. October (26)
    4. September (23)
    5. August (17)
    6. July (20)
    7. June (13)
    8. May (25)
    9. April (34)
    10. March (24)
    11. February (3)
    12. January (1)
  3. 2017 (36)
  4. 2016 (21)
  5. 2015 (36)
  6. 2014 (33)
  7. 2013 (23)
  8. 2012 (4)
  9. 2011 (1)
  10. 2010 (1)
  11. 2009 (1)
  12. 2008 (1)