BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:362@lincs.fr
DTSTART;TZID=Europe/Paris:20180307T140000
DTEND;TZID=Europe/Paris:20180307T150000
DTSTAMP:20180308T075630Z
URL:https://www.lincs.fr/events/a-sliding-resolution-algorithm-for-hierarc
 hical-graph-clustering/
SUMMARY:A Sliding-Resolution Algorithm for Hierarchical Graph Clustering
DESCRIPTION:We propose a novel algorithm for the hierarchical clustering of
 graphs. The algorithm is a simple but key modification of the Louvain
 algorithm based on some sliding-resolution scheme. In particular\, the most
 relevant clusterings\, corresponding to different resolutions\, are
 identified. The algorithm is parameter-free\, fast and memory efficient.
 Numerical experiments on both synthetic and real datasets show the
 performance of the algorithm.\n\nJoint work with Thomas Bonald (Telecom
 ParisTech)\, Alexandre Hollocou (Inria)\, Alexis Galland (Inria)
CATEGORIES:Seminars,Youtube
LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\,
 France
GEO:48.828400;2.356897
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\,
 Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars
 room:geo:48.828400,2.356897
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20171029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR