BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook 12.0 MIMEDIR//EN
VERSION:2.0
METHOD:PUBLISH
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VTIMEZONE
TZID:GMT Standard Time
BEGIN:STANDARD
DTSTART:16010101T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
RRULE:FREQ=YEARLY;INTERVAL=1;BYDAY=-1SU;BYMONTH=10
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:16010101T010000
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;INTERVAL=1;BYDAY=-1SU;BYMONTH=3
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
CLASS:PUBLIC
CREATED:20091109T101015Z
DESCRIPTION:Speaker: Daniele Zambon, Daniele Grattarola University of Exeter\n\nTopic: Change detection on sequences of graphs\n<p class="p1"> Many fields, like physics, neuroscience, chemistry, and sociology, investigate phenomena that can be effectively described as a sequence of multivariate measurements, where the pairwise relations between different elements of a system can be represented as a sequence of attributed graphs that change over time. Here, the identification of a possible change in the behaviour of the data stream - a situation associated with anomalies or events in the observed system- stands out as a major research challenge. Due to the variety of real-world applications, graphs come in different forms, with variable attributes, topology, and ordering, making it difficult to perform a mathematical analysis in the graph space.</p><p class="p1"> In order to tackle this challenge, we propose a two-step methodology based on embedding graphs into a vector space, where conventional multivariate statistical hypothesis testing can be applied. The first contribution associated with the methodology consists in theoretical results showing how the confidence level of an event occurring in the graph domain can be associated with the confidence level of the actual test applied on the embedding space; this enables the identification of events in the graph domain through the embedding space.</p><p class="p1"> The second contribution delves deeper in the selection of the embedding strategy and, motivated by the fact that metric graph distances are not practical even for moderately-large-scale applications, introduces a deep learning technique based on generative adversarial networks, which allows us to embed graphs without having to perform all computations in the graph domain. Finally, we show how to extend both techniques to account for the intrinsic non-Euclidean nature of graphs, by considering constant-curvature Riemannian manifolds as embedding spaces, obtaining significant performance improvements in change detection. We discuss the effectiveness of our results on several problems, including a real-world scenario of epileptic seizure prediction on brain networks.</p><p> <style type="text/css">p.p1 {margin: 0.0px 0.0px 0.0px 0.0px; font: 12.0px Helvetica} </style></p><style type="text/css">p.p1 {margin: 0.0px 0.0px 0.0px 0.0px; font: 12.0px Helvetica}</style>
DTSTART;TZID=GMT Standard Time:20181011T14:30:00
DTEND;TZID=GMT Standard Time:20181011T15:30:00
TZID=GMT Standard Time
DTSTAMP:20100109T093305Z
LAST-MODIFIED:20091109T101015Z
LOCATION:Harrison 170
PRIORITY:5
SEQUENCE:0
SUMMARY;LANGUAGE=en-gb: Change detection on sequences of graphs
TRANSP:OPAQUE
UID:040000008200E00074C5B7101A82E008000000008062306C6261CA01000000000000000
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MS-OLK-ALLOWEXTERNCHECK:TRUE
X-MS-OLK-AUTOFILLLOCATION:FALSE
X-MS-OLK-CONFTYPE:0
BEGIN:VALARM
TRIGGER:-PT1440M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR