BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20161030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20170326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.7422.field_data.0@diag.uniroma1.it
DTSTAMP:20260404T211812Z
CREATED:20161108T082843Z
DESCRIPTION:Large networks are being generated by applications that keep tr
 ack of relationships between different data entities. Examples include onl
 ine social networks recording interactions between individuals\, sensor ne
 tworks logging information exchanges between sensors\, and more. There is 
 a large body of literature on mining large networks\, but most existing me
 thods assume either static networks\, or dynamic networks where the networ
 k topology is changing. On the other hand\, in many real-world application
 s a continuous stream of interactions takes place on top of a relatively s
 table network topology\, giving rise to different semantics than those of 
 dynamic networks. In this talk we discuss a few different problems that co
 nsider networks as a stream of interactions (edges) over time. In particul
 ar\, we consider the problems of (i) maintaining neighborhood profiles\, (
 ii) tracking important nodes\, and (iii) identifying the starting nodes an
 d most-likely flow of an epidemic. For the studied problems we present new
  algorithms\, and discuss our analytical results. We also present experime
 ntal evaluation on real-world datasets and case studies on different appli
 cation scenarios.Bio Aristides Gionis is an associate professor in the dep
 artment of Computer Science in Aalto University. Previously he has been a 
 senior research scientist in Yahoo! Research. He is currently serving as a
 n associate editor in the ACM Transactions on Knowledge Discovery from Dat
 a (TKDD) and as a managing editor in Internet Mathematics. He has contribu
 ted in several areas of data science\, such as graph mining\, social-media
  analysis\, web mining\, data clustering\, and privacy-preserving data min
 ing.
DTSTART;TZID=Europe/Paris:20161114T160000
DTEND;TZID=Europe/Paris:20161114T160000
LAST-MODIFIED:20190805T155749Z
LOCATION:Via Ariosto 25\, Room B2
SUMMARY:Aristides Gionis: Mining temporal networks - Aristides Gionis.  Aal
 to University\n    \n                  \n    Aristides GIONIS\n\nente prov
 enienza: \n\nAalto University\, Aalto\, Finland\n\nperiodo visita: \n\nOct
 ober\, 2016 to November\, 2016\n\ngruppo di ricerca: \n\nAlgorithms and Da
 ta Science\n\ninvitato da: \n\nleonardi@dis.uniroma1.it\n\nCognome visitin
 g: \n\nGIONIS\n\nNome visiting: \n\nAristides
URL;TYPE=URI:http://diag.uniroma1.it/node/7422
END:VEVENT
END:VCALENDAR