BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69dba125b2fcb
DTSTART;TZID=America/Toronto:20190521T093000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190521T093000
URL:https://uwaterloo.ca/data-systems-group/events/mmath-thesis-presentatio
 n-entity-matching-and-disambiguation
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 2310 Waterloo ON N2L 3G1 Canada
SUMMARY:MMath Thesis Presentation • Entity Matching and Disambiguation\nA
 cross Multiple Knowledge Graphs
CLASS:PUBLIC
DESCRIPTION:MICHAEL FARAG\, MMATH CANDIDATE\nDavid R. Cheriton School of Co
 mputer Science\n\nKnowledge graphs are considered an important representat
 ion that lies\nbetween free text on one hand and fully-structured relation
 al data on\nthe other. Knowledge graphs are a backbone of many application
 s on the\nWeb. With the rise of many large-scale open-domain knowledge gra
 phs\nlike Freebase\, DBpedia\, and Yago\, various applications including\n
 document retrieval\, question answering\, and data integration have been\n
 relying on them.
DTSTAMP:20260412T134157Z
END:VEVENT
END:VCALENDAR