-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy patholdnews.php
560 lines (560 loc) · 33 KB
/
oldnews.php
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
<?php include("header.html"); ?>
<!-- vim: set ts=2 sw=2 tw=79: -->
<div id="news">
<h2>Old News</h2>
<p>A list of old news, moved here from the home page, mostly for my
personal records.</p>
<ul>
<li><strong>PRE:</strong> A new <a
href="papers/PretiEtAl-ImpossibilityResultButterflies-PRE.pdf">impossiblity
result about sampling from bipartite graph ensembles</a> will appear in
<a href="https://journals.aps.org/pre/">Physical Review E</a>. It's joint
work with <a href="https://giuliapreti.wixsite.com/gpreti">Giulia</a> and
<a href="https://gdfm.me">Gianmarco</a>, and my first time publishing in
a non-strictly-CS venue! Also, the result is pretty cool!</li>
<li><strong>DSI:</strong> I was appointed the inaugural director of the
<a
href="https://www.amherst.edu/about/science_at_amherst/data-science-initiative">Data
Science Initiative</a> at Amherst College. I'm excited about, and looking
forward to, the (large amount of) work ahead.</li>
<li><strong>Dagstuhl:</strong> With <a
href="https://cs.brown.edu/~eli">Eli</a> and <a
href="https://www.kth.se/profile/argioni">Aris</a>, I'm organizing a
5-day workshop on <a href="https://www.dagstuhl.de/24391">Statistical and
Probabilistic Methods in Algorithmic Data Analysis</a> in <a
href="https://www.dagstuhl.de">Dagstuhl</a>. So glad to go back to the
beautiful Schlöss!</li>
<li><strong>KDD'24:</strong> Happy to help out the organization as a
Co-chair of the PhD Consortium.</li>
<li><strong>CogMI:</strong> I am giving an invited talk on <a
href="papers/Riondato-StatisticallySoundKDD-CogMI23.pdf">Statistically-sound
KDD</a> at this interesting conference bringing together researchers from
different areas.</li>
<li><strong>KAIS:</strong> the journal version of <a
href="papers/PretiEtAl-ALICE-KAIS.pdf"><span
style="font-variant:small-caps">Alice</span></a> was accepted to
the <a href="https://www.springer.com/journal/10115">KAIS</a>
special issue for the best papers of IEEE ICDM'22.</li>
<li><strong>Tenure+Promotion:</strong> Since July 1, I am a tenured
associate professor of computer science! I'm over the moon about
this!</li>
<li><strong>NSF CAREER:</strong> I received a $600k <a
href="https://new.nsf.gov/funding/opportunities/faculty-early-career-development-program-career">NSF
CAREER</a> award to work on <a
href="https://www.nsf.gov/awardsearch/showAward?AWD_ID=2238693&HistoricalAwards=false">Statistically-sound
Knowledge Discovery from Data</a> (my <a
href="papers/Riondato-StatisticallySoundKDD-SDM23.pdf">SDM'23
blue-sky-idea paper</a> has more details about what I plan to do). I am
extremely thankful for the trust from the community and NSF, and excited
for 5 years of work ahead!</li>
<li><strong>DMKD/DAMI (ECML PKDD'23):</strong> the <a
href="https://acdmammoths.github.io">Data* Mammoths</a> published
another paper: Maryam and
<a href="https://alexanderwlee.com">Alex</a> introduce <a
href="papers/AbuissaEtAl-ROhAN-DMKD23.pdf">ROhAN</a>, a new set of null
models for Statistically-sound KDD.</li>
<li><strong>SDM'23:</strong> my idea on <a
href="papers/Riondato-StatisticallySoundKDD-SDM23.pdf">Statistically-sound
Knowledge Discovery from Data</a> is accepted for the new <em>Blue
Sky</em> track at <a
href="https://www.siam.org/conferences/cm/conference/sdm23">SIAM
SDM'23</a>. See you in Minneapolis!</li>
<li><strong>ACM TIST:</strong> with <a
href="https://giuliapreti.wixsite.com/gpreti">Giulia</a> and <a
href="https://gdfm.me">Gianmarco</a> from <a
href="https://centai.eu">CentAI</a>, we published the <a
href="papers/PretiEtAl-MaNIACS-TIST.pdf">journal version</a> of our
KDD'21 paper on approximately counting subgraphs.</li>
<li><strong>ECML PKDD'23:</strong> I'm the <a
href="https://2023.ecmlpkdd.org/submissions/phd-forum/">PhD Forum</a>
Chair, together with Illka Velaj. If you are a PhD student, please
consider submitting a poster (when submission open in May).</li>
<li><strong>ACM TKDD:</strong> The <a
href="papers/CousinsEtAl-Bavarian-TKDD23.pdf">journal version of
Bavarian</a>, our algorithm for betweennes centrality approximation with
variance-aware Rademacher averages will appear in <a
href="https://tkdd.acm.org">ACM TKDD</a>. We show a novel analysis of the
variance of the estimators, a discussion about using matrix
multiplication, and much more.</li>
<li><strong>DMKD/DAMI:</strong> The <a
href="papers/HaddadanEtAl-RePBubLik-DMKD.pdf">journal version</a> of our
WSDM'21 paper on adding edges to reduce polarization in graphs will be
included in the <a
href="https://www.springer.com/journal/10618">DMKD/DAMI</a> <a
href="https://link.springer.com/journal/10618/topicalCollection/AC_a1fcffade3e6523787edc3a6f15017ae/page/1">special
issue on Bias and Fairness</a>. In this version, we show a new algorithm
that <em>modifies edge weights</em>, thus being less intrusive.</li>
<li><strong>ICDM'22:</strong> Another collaboration with <a
href="https://giuliapreti.wixsite.com/gpreti">Giulia</a> and <a
href="https://gdfm.me">Gianmarco</a> from <a
href="https://centai.eu">CentAI</a> has been accepted. We present <a
href="papers/PretiEtAl-ALICE-ICDM.pdf">a more representative null model
for testing the significance of data mining results</a> from
transactional datasets, and <span
style="font-variant:small-caps">Alice</span>, an algorithm to sample from
this null model. See you in Orlando for <a
href="https://icdm22.cse.usf.edu/">ICDM'22</a>!</li>
<li><strong>DMKD/DAMI (ECML PKDD'22):</strong> Another work by the <a
href="https://acdmammoths.github.io">Data* Mammoths</a> has been
accepted: Steedman and Stefan developed <a
href="papers/JenkinsEtAl-SPEck-DMKD22.pdf">SPEck</a>, a set of Monte-Carlo
procedures for efficiently mining statistically-significant sequential
patterns according to different null models, using <em>exact</em>
sampling, rather than approximate sampling. It appears in the
<a href="https://www.springer.com/journal/10618">DMKD/DAMI</a>
special issue for <a href="https://2022.ecmlpkdd.org">ECML
PKDD'22</a>.</li>
<li><strong>MDS'22:</strong> My talk on <em>Scalable Algorithms for
Hypothesis Testing</em> has been accepted for presentation at the
"new" (as the 2020 edition was canceled) <a
href="https://www.siam.org/conferences/cm/conference/mds22">SIAM
Conference on Mathematics of Data Science</a>, which has a super
strong <a
href="https://meetings.siam.org/program.cfm?CONFCODE=MDS22">program</a>.</li>
<li><strong>TKDD:</strong> the extended version of <a
href="papers/PellegrinaEtAl-MCRapper-TKDD.pdf">MCRapper</a> was accepted
to <a href="https://tkdd.acm.org">ACM TKDD</a>. An elegant algorithm to
compute Rademacher averages for families of function with a natural poset
structure, which are omnipresent in pattern mining. Nice collab with <a
href="http://dei.unipd.it/~pellegri">Leonardo</a>, <a
href="https://cs.brown.edu/~ccousins/">Cyrus</a>, and <a
href="https://dei.unipd.it/~vandinfa/">Fabio</a>.</li>
<li><strong>AAAI'22:</strong> the <a
href="https://acdmammoths.github.io">Data* Mammoths</a>' work on <a
href="papers/LeeEtAl-AScalableParallelAlgorithmForBalancedSampling-AAAI.pdf">parallel
algorithms for cube sampling</a> was accepted for publication as a
<a
href="https://aaai.org/Conferences/AAAI-22/student-abstract-and-poster-program/">student
abstract/poster to AAAI'22</a>. Fun work by brilliant undergraduate
researchers: it started with Shukry's honors thesis, and Alex and Stefan
brought it to completion.</li>
<li><strong>SDM'22:</strong> I'm excited and honored to be PC-chair
of <a href="https://www.siam.org/conferences/cm/conference/sdm22">SIAM
SDM'22</a>, together with the great <a
href="http://www.cs.ucr.edu/~epapalex/">Vagelis Papalexakis</a>, and a
wonderful OC. Looking forward to receiving interesting submissions on
data mining, knowledge discovery, and its statistical aspects.</li>
<li><strong>KDD'21:</strong> Two papers accepted in the research track:
<a href="papers/CousinsEtAl-Bavarian-KDDext.pdf">Bavarian</a>, on
betweenness centrality approximation, and <a
href="papers/PretiEtAl-MaNIACS-KDD.pdf">MaNIACS</a>, on approximating the
frequent subgraphs in a large graph through sampling.</li>
<li><strong>WSDM'21:</strong> <a
href="papers/HaddadanEtAl-RePBubLik-WSDM.pdf">RePBubLik</a> wins a <a
href="https://www.wsdm-conference.org/2021/">Best Paper Award Honorable
Mention</a>! Yay!</li>
<li><strong>KTH talk (2/18):</strong> Giving a talk about <a
href="papers/HaddadanEtAl-RePBubLik-WSDM.pdf">RePBubLik</a> at KTH. Thank
you <a href="https://www.kth.se/profile/argioni">Aris</a> and <a
href="https://www.kth.se/profile/neum?l=en">Stefan</a> for inviting
me!</li>
<li><strong>TKDD:</strong> <a
href="papers/NasirEtAl-TipTap-TKDD.pdf">TipTap</a>, our work on
maintaining frequent subgraphs in fully-dynamic edge graph streams has
been accepted to <a href="http://tkdd.acm.org">ACM TKDD</a>. Nice work
using reservoir sampling and random pairing, with <a
href="https://gdfm.me">Gianmarco</a>, <a
href="https://pure.au.dk/portal/en/persons/cigdem-aslay(921b00ac-c233-4813-be49-89852a83f6bc).html">Cigdem</a>,
and Anis.</li>
<li><strong>Fidelity (10/28):</strong> giving a talk on <a
href="papers/PellegrinaEtAl-MCRapper-TKDD.pdf">MCRapper</a> at
Fidelity, thank you <a
href="https://sites.google.com/site/serdrk/">Serdar</a> for inviting
me.</li>
<li><strong>WSDM'21:</strong> <a
href="papers/HaddadanEtAl-RePBubLik-WSDM.pdf">RePBubLik: Reducing the
Polarized Bubble Radius with Link Insertions</a> was accepted to <a
href="http://www.wsdm-conference.org/2021/">WSDM'21</a>, a venue
dear to me. Joint work with the Brown crew: <a
href="https://sites.google.com/view/shahrzadhaddadan">Shahrzad
Haddadan</a>, <a
href="https://sites.google.com/diag.uniroma1.it/cristinamenghini-patk">Cristina
Menghini</a>, and <a href="https://cs.brown.edu/people/eupfal">Eli
Upfal</a>.</li>
<li><strong>UMass talk (10/6):</strong> I'll be giving a talk on
<a href="papers/PellegrinaEtAl-MCRapper-TKDD.pdf">MCRapper</a> at
the <a href="https://groups.cs.umass.edu/theory/theory-seminar/">Theory
seminar</a>. Thanks <a
href="https://people.cs.umass.edu/~cmusco/">Cameron</a> for
inviting me!</li>
<li><strong>NeurIPS'20:</strong> our paper (w/
soon-to-be-PhD-extraordinaire <a
href="http://cs.brown.edu/~ccousins">Cyrus Cousins</a>) <a
href="papers/CousinsRiondato-UniformConvergenceEmpiricalCentralization-NeurIPS.pdf">"Sharp
uniform convergence bounds through empirical centralization"</a>
was accepted. This work is theoretical and fun!</li>
<li><strong>NSF Grant:</strong> My project on <a
href="https://www.nsf.gov/awardsearch/showAward?AWD_ID=2006765">Scalable
and Iterative Statistical Testing of Multiple Hypotheses on Massive
Datasets</a> has been funded! Thanks NSF! I really look forward to the
work ahead.</li>
<li><strong>SDM'21:</strong> I will be the Tutorial Chair and a member of
the Senior PC for <a
href="https://www.siam.org/conferences/cm/conference/sdm21">SIAM
SDM'21</a>. Always glad to be of service to the knowledge discovery, data
mining, and statistics communities.</li>
<li><strong>KDD'20:</strong> <a
href="papers/PellegrinaEtAl-MCRapper-TKDD.pdf">MCRapper</a>, our work
on computing the Monte Carlo Empirical Rademacher Average on poset
families for approximate pattern mining has been accepted as a full paper
in the research track. Join work with the statistics-datamining gang: <a
href="http://www.dei.unipd.it/~pellegri/">Leonardo Pellegrina</a>,
<a href="http://cs.brown.edu/~ccousins">Cyrus Cousins</a>, and <a
href="http://dei.unipd.it/~vandinfa">Fabio Vandin</a>.</li>
<li><strong>TKDD:</strong> The extended version of <a
href="papers/RiondatoVandin-MiSoSouP-TKDD.pdf">MiSoSouP</a>, our
algorithm for mining interesting subgroups through sampling with
pseudodimension has been accepted to the <a
href="http://tkdd.acm.org">TKDD</a> special issue for the best papers of
KDD'18. Joint work with great colleague <a
href="http://dei.unipd.it/~vandinfa">Fabio Vandin</a>.</li>
<li><strong>DMKD:</strong> Very honored to become a member of the
editorial board of <a href="https://link.springer.com/journal/10618">Data
Mining and Knowledge Discovery</a> journal, one of the top venues in my
area of research.</li>
<li><strong>MDS'20:</strong> My talk on <em>Algorithms for Scalable
Hypothesis Testing</em> has been accepted for presentation at the new <a
href="https://www.siam.org/conferences/cm/conference/mds20">SIAM
Conference on Mathematics of Data Science</a>, which has a super strong
<a
href="https://meetings.siam.org/program.cfm?CONFCODE=MD20">program</a>.</li>
<li><strong>SDM'20:</strong> We'll present our <a
href="statdmtut/">tutorial on Statistical Hypothesis Testing and Pattern
Mining</a> at <a
href="https://www.siam.org/conferences/cm/conference/sdm20">SIAM
SDM'20</a>, a great event bringing together computer scientists and
statisticians.</li>
<li><strong>NetSciI@NEU (11/8):</strong> I'll be giving a talk at the
Network Science Institute at Northeastern University. Thank you <a
href="http://www.eliassi.org">Tina</a> for inviting me: the place and
people there are wonderful and do super cool work.</li>
<li><strong>MassMutual Research Bytes(11/5):</strong> I'll be giving a
talk on making better use of data through hypothesis testing and
statistical learning theory. Thank you <a
href="https://www.amherst.edu/people/facstaff/nhorton?shib_redir=108028591">Nick</a>
for inviting me.</li>
<li><strong>BU (10/25):</strong> I'll be giving a talk at Boston
University. Thank you <a
href="https://www.cs.bu.edu/~evimaria/">Evimaria</a> for inviting
me.</li>
<li><strong>MHC (10/16):</strong> I'll be giving a talk at Mount
Holyoke College. Thanks to <a
href="https://www.mtholyoke.edu/~vbarr/">Valerie</a> for inviting
me.</a></li>
<li><strong>CaStleD'19:</strong> I'm giving a talk on <a
href="papers/CousinsRiondato-CaDET-MachLearn.pdf">CaDET</a> at <a
href="https://www.dei.unipd.it/~vandinfa/castled19/">CaStleD'19</a> in <a
href="http://www.bici.eu">Bertinoro</a>. Thank you <a
href="http://www.dei.unipd.it/~vandinfa">Fabio</a> for inviting me.</li>
<li><strong>ECML PKDD:</strong> <a
href="papers/CousinsRiondato-CaDET-MachLearn.pdf">CaDET</a>, our
algorithm for interpretable conditional density estimation using decision
trees has been accepted to the special issue of <a
href="https://www.springer.com/computer/ai/journal/10994">Machine
Learning</a> for <a href="http://ecmlpkdd2019.org/">ECML PKDD'19</a>.
Joint work with thinker-extraordinaire PhD student <a
href="http://cs.brown.edu/~ccousins">Cyrus Cousins</a>.</li>
<li><strong>GPG key:</strong> I updated <a
href="files/riondapgp.asc">my GPG key</a>, which had expired. The keys did not
change, only the expiration date.</li>
<li><strong>ACM KDD:</strong> <a
href="papers/PellegrinaEtAl-SPuManTE-KDD.pdf">SPuManTE</a>, our work on
unconditional multiple hypothesis testing for combinatorial patterns has been
accepted to KDD'19. Joint work with thought leader <a
href="http://www.dei.unipd.it/~vandinfa">Fabio Vandin</a> and amazing Ph.D.
student
<a href="http://www.dei.unipd.it/~pellegri/">Leonardo Pellegrina</a>.</li>
<li><strong>ACM KDD:</strong> Our <a href="/statdmtut">tutorial</a>
on multiple hypothesis testing and statistically-sound pattern mining (<a
href="papers/PellegrinaEtAl-HypTestSigPattTut-KDD19.pdf">2-pager</a>) has been
accepted to <a href="http://www.kdd.org/kdd2019">ACM KDD'19</a>. See you in
Anchorage, AK!</li>
<li><strong>KAIS:</strong> an extended version of <a
href="papers/ServanSchreiberEtAl-ProSecCo-KAIS.pdf">ProSecCo: Progressive
Sequence Mining with Convergence Guarantees</a> was invited to the special
issue of <a href="https://link.springer.com/journal/10115">KAIS</a> for the
best papers of <a href="http://www.icdm18.org">IEEE ICDM'18</a>.</li>
<li><strong>ACM TKDD:</strong> an extended version of <a
href="papers/RiondatoVandin-MiSoSouPExtended-KDD.pdf">MiSoSouP</a> was invited
to the special issue of <a href="https://tkdd.acm.org">ACM TKDD</a> for the
best papers of <a href="https://www.kdd.org/kdd2018/">KDD'18</a>.</li>
<li><strong>ICERM:</strong> Happy to give a talk about pseudodimension
for data analysis at the <a
href="https://icerm.brown.edu/tripods/tri19-2-dslds/">Data Science in
Low-dimensional Spaces</a> workshop taking place at <a
href="https://icerm.brown.edu">ICERM</a>. Even more excited to hear about
exciting research from others.</li>
<li><strong>Teaching:</strong> in my first semester at Amherst College,
I'm teaching <a href="courses/cosc-254-s19/">Data Mining</a> and <a
href="courses/cosc-111-s19/">Intro to CS 1</a>. Thrilled to be working
closely with brilliant students again.</li>
<li><strong>PCs and editorial board:</strong> glad to serve on the
PC for <a href="https://icml.cc/Conferences/2019">ICML'19</a>, <a
href="https://www.kdd.org/kdd2019/">ACM KDD'19</a>, <a
href="http://vermontcomplexsystems.org/events/netsci/">NetSci'19</a>,
and <a href="https://www.ijcai19.org/">IJCAI'19</a>, and on the guest
editorial board of the Data Mining and Knowledge Discovery journal for <a
href="https://ecmlpkdd2019.org/">ECML PKDD'19</a>.</li>
<li><strong>SDM'19:</strong> I'm serving as co-chair of the Doctoral
Forum for <a href="https://www.siam.org/meetings/sdm19/">SIAM SDM'19</a>.
Very excited to help with the organization, as I won the best student
poster award at this event in 2014.</li>
<li><strong>ICDM'18:</strong> <a
href="papers/ServanSchreiberEtAl-ProSecCo-KAIS.pdf">ProSecCo:
Progressive Sequence Mining with Convergence Guarantees</a> was
recognized as the <a
href="http://www.cs.uvm.edu/~icdm/Awards/BestPapers.shtml">best student
paper award runner-up</a> of <a
href="http://www.icdm18.org">IEEE ICDM'18</a>. Congrats to superstar
undergrad <a href="http://sachaservanschreiber.com/index.html">Sacha
Servan-Schreiber</a> and postdoc <a
href="http://emanuelzgraggen.com">Emanuel Zgraggen</a>!</li>
<li><strong>New job:</strong> In January 2019 I will be joining the
<a
href="https://www.amherst.edu/academiclife/departments/computer_science">computer
science department</a> at <a href="http://www.amherst.edu">Amherst
College</a> as an assistant professor.</li>
<li><strong>Invited talks:</strong> on 11/26 I am giving a guest lecture
at Harvard, for the COMPSCI-134 Networks talk, invited by <a
href="http://www.eecs.harvard.edu/~michaelm/">Michael Mitzenmacher</a>
and <a href="https://people.seas.harvard.edu/~yaron/">Yaron Singer</a>. I
will also be speaking at Google Research NY on 4/12, on <a
href="papers/RiondatoVandin-MiSoSouPExtended-KDD.pdf">MiSoSouP</a>,
thanks to <a href="http://www.epasto.org">Alessandro Epasto</a> for the
invite.</li>
<li><strong>ICDM'18:</strong> Our work "<a
href="papers/ServanSchreiberEtAl-ProSecCo-KAIS.pdf">ProSecCo: Progressive
Sequence Mining with Convergence Guarantees</a>" has been accepted as
full paper at <a href="http://icdm2018.org">IEEE ICDM'18</a>. This result
is joint work with amazing Brown CS undergrad<a
href="http://sachaservanschreiber.com/index.html">Sacha
Servan-Schreiber</a> and star MIT postdoc <a
href="http://emanuelzgraggen.com/">Emanuel Zgraggen</a>.</li>
<li><strong>Dagstuhl:</strong> Very happy to attend the <a
href="https://www.dagstuhl.de/18401">Automating Data Science</a> workshop
in the very-conducive-to-collaboration environment of Dagstuhl at the
beginning of October.</li>
<li><strong>AAAI'19:</strong> Happy to join the PC of <a
href="https://aaai.org/Conferences/AAAI-19/">AAAI'19</a>, one of the
longest running conferences in computer science and a leading conference
for AI.</li>
<li><strong>HLF'18:</strong> I have been selected as a Young Researcher
for the <a href="http://www.heidelberg-laureate-forum.org/">Heidelberg
Laureate Forum</a>! Really excited to go meet brilliant minds of all
ages in September.</li>
<li><strong>FouLarD'18:</strong> I'm co-organizing <a
href="foulard18/">FouLarD'18</a>, a workshop on the foundations of
learning from data, together with <a
href="http://cs.nyu.edu/~mohri">Mehryar Mohri</a>, <a
href="https://sites.google.com/a/di.uniroma1.it/panco/">Alessandro
Panconesi</a>, and <a href="https://cs.brown.edu/~eli">Eli Upfal</a>.
It will take place in Bertinoro, Italy, in September 2018.</li>
<li><strong>Sharpe ratio TR:</strong> my <a
href="papers/Riondato-SharpeRatioEstimationConfidenceIntervalsHypothesisTesting-TSTR.pdf">technical
report on the Sharpe ratio</a> is now available. The Sharpe ratio is a
fundamental metric to evaluate investment strategies. This literature
survey is part of the <a href="http://research.twosigma.com">Two Sigma
Technical Report series</a>.</li>
<li><strong>KDD'18:</strong> <a
href="papers/RiondatoVandin-MiSoSouPExtended-KDD.pdf">MiSoSouP</a>, our
algorithm for subgroup discovery using random sampling and
pseudodimension has been accepted for long presentation at <a
href="http://www.kdd.org/kdd2018/">KDD'18</a>. Joint work with superstar
co-author <a href="http://dei.unipd.it/~vandinfa">Fabio Vandin</a>. Very
happy that all the work we put in this paper paid off.</li>
<li><strong>ACM TKDD:</strong> <a
href="papers/RiondatoUpfal-BetweennessRademacherAverages-TKDD.pdf">ABRA</a>,
our work (with <a href="https://cs.brown.edu/people/eli">Eli</a>) on
approximating betweenness centrality with Rademacher averages was
accepted for publication in <a href="https://tkdd.acm.org">ACM
TKDD</a>.</li>
<li><strong>IEEE ICDM'18:</strong> I'm serving on the PC of <a
href="http://icdm2018.org/">IEEE ICDM'18</a>, which will be in Singapore
in November.</li>
<li><strong>ECML PKDD'18:</strong> Happy to serve on the PC of <a
href="http://www.ecmlpkdd2018.org/">ECML PKDD'18</a>, my "home"
conference in many ways, and a great venue for algorithmic data
science.</li>
<li><strong>Talk at Harvard</strong>: On 5/7 I talk about <a
href="https://www.seas.harvard.edu/calendar/event/111551">Sampling-based
Approximation Algorithms for Data Analysis using Rademacher
Averages</a> at the <a
href="https://toc.seas.harvard.edu/toc-seminar">Theory of Computation
Seminar</a> at Harvard. Thanks to <a
href="http://www.eecs.harvard.edu/~michaelm/">Mike Mitzenmacher</a>
for inviting me.</li>
<li><strong>Grace Hopper'18:</strong> I'm proud to be serving on the
program commitee for the Data Science track of the <a
href="https://ghc.anitab.org/">Grace Hopper Celebration</a>, the premier
event for women technologists.</li>
<li><strong>ACM CIKM'18</strong>: I'm on the PC of <a
href="http://www.cikm2018.units.it/">ACM CIKM'18</a>, which takes place
in Turin in October.</li>
<li><strong>ACM KDD'18</strong>: I'll be serving on the PC of <a
href="http://www.kdd.org/kdd2018/">ACM KDD'18</a>, the major conference
on data mining.</li>
<li><strong>Teaching at Brown CS</strong>: I'm teaching <a
href="http://cs.brown.edu/courses/cs1951g/">CSCI 1951-G <em>Optimization
Methods in Finance</em></a> again in Spring'18. So rewarding to be in
class with brilliant students again!</li>
<li><strong>SIAM SDM'18</strong>: I'll be the sponsorship co-chair for <a
href="http://www.siam.org/meetings/sdm18/">SIAM SDM'18</a>. I'm excited
to contribute to the organization of this great conference stressing the
importance of theory in data mining.</li>
<li><strong>Visiting NII:</strong> From 11/12 to 11/22 I'll be visiting
<a href="http://research.nii.ac.jp/~yyoshida/">Yuichi Yoshida</a> at the
National Institute of Informatics in Tokyo, Japan, where I will also give
a talk. I'm thrilled to spend a wiki with Yuichi, who is an incredibly
smart, world-class researcher combining theory and data mining.</li>
<li><strong>PC memberships</strong>: I joined the PCs of ACM CIKM'17 and
IEEE ICDE'18. Looking forward to reviewing more works at the intersection
of data management and data analytics.</li>
<li><strong>New GPG/PGP key:</strong> I <a
href="http://pgp.mit.edu/pks/lookup?op=vindex&search=0xD8CA78A51EC56BEC">revoked
my old GPG key</a> and <a
href="http://pgp.mit.edu/pks/lookup?op=vindex&search=0x1B02FD4954255501">created
a new one</a> (<a href="files/riondapgp.asc">ASCII-armored
file</a>).</li>
<li><strong>WWW'18</strong>: I'll be in the PC for the next <a
href="https://www2018.thewebconf.org">(World Wide) Web
Conference</a>.</li>
<li><strong>NYU</strong>: On May 17 I'm giving a talk on <a
href="papers/RiondatoUpfal-BetweennessRademacherAverages-TKDD.pdf">ABRA</a>
at the <a
href="http://cds.nyu.edu/data-science-lunch-seminar-series/">NYU
Center for Data Science</a>.</li>
<li><strong>Dagstuhl</strong>: I am giving a talk on Rademacher Averages
and <a
href="papers/RiondatoUpfal-BetweennessRademacherAverages-TKDD.pdf">ABRA</a>
at the <a
href="http://www.dagstuhl.de/en/program/calendar/semhp/?semnr=17141">Probabilistic
Methods in the Design and Analysis of Algorithms</a> at Schloss
Dagstuhl.</li>
<li><strong>Grace Hopper'17:</strong> I am a member of the Scholarship
review committee for <a
href="https://ghc.anitaborg.org/">this wonderful event</a>.</li>
<li><strong>ACM TKDD:</strong> the extended version of <a
href="papers/DeStefaniEtAl-TRIEST-TKDD.pdf">TRIÈST</a> has
been accepted for publication.</li>
<li><strong>ECML PKDD'17</strong>: I joined the PC. This year <a
href="http://ecmlpkdd2017.ijs.si/">the conference</a> takes place in
Skopje, Macedonia.</li>
<li><strong>KDD'17:</strong> I am a member of the Senior Program
Committee. Looking forward to reviewing many good submissions!</li>
<li><strong>ICDM'16:</strong> I'm attending IEEE ICDM'16 in Barcelona
from 12/12 to 12/15. Drop me a line if you would like to meet.</li>
<li><strong>Boston University (11/18):</strong> I'm talking about <a
href="papers/RiondatoUpfal-BetweennessRademacherAverages-TKDD.pdf">ABRA</a>,
hosted by <a href="http://www.cs.bu.edu/~evimaria/">Evimaria Terzi</a>.</li>
<li><strong>IEEE MIT URTC (11/05):</strong> I'm a keynote speaker at
the <a href="http://ieee.scripts.mit.edu/conference/index.php">IEEE
MIT Undegraduate Technology Conference</a>. My talk will be about
algorithmic data science as a way of combining theory and practice.
I'm excited and honored to share my point of view with brilliant
young minds.</li>
<li><strong>IEEE ICDE'17:</strong> I'm on the PC for next year <a
href="http://icde2017.sdsc.edu/">ICDE</a>.</li>
<li><strong>WWW'17:</strong> I'm on the PC for next year's <a
href="http://www.www2017.com.au/">WWW</a>.</li>
<li><strong>Carnegie Mellon University (10/24):</strong> Giving a
<a
href="http://www.cs.cmu.edu/calendar/mon-2016-10-24-1645/database-seminar">talk</a>
on <a href="papers/DeStefaniEtAl-TRIEST-TKDD.pdf">TRIÈST</a> at
the <a href="http://db.cs.cmu.edu/">database group</a> meeting, hosted by
<a href="http://cs.cmu.edu/~pavlo">Andy Pavlo</a>.</li>
<li><strong>Network Science Institute @ Northeastern University
(10/17):</strong> I'm <a
href="http://www.networkscienceinstitute.org/events/matteo-riondato">talking</a>
about <a
href="papers/RiondatoUpfal-BetweennessRademacherAverages-TKDD.pdf">ABRA</a>,
hosted by <a href="http://www.eliassi.org">Tina Eliassi-Rad</a>.</li>
<li><strong>University of Padua (9/26):</strong> I'm giving a talk on
<a href="papers/RiondatoEtAl-GraphSummarization-DMKD.pdf">graph
summarization</a> at DEI (Department of Information Engineering). Excited
to speak at my alma mater.</li>
<li><strong>ACM KDD'16:</strong> <a
href="papers/DeStefaniEtAl-TRIEST-TKDD.pdf">TRIÈST</a> wins the
<a
href="http://www.kdd.org/awards/view/2016-sigkdd-best-paper-award-winners">best
student paper award (Research track)</a>. I feel very honored, and
thankful to the PC and to my coauthors (Lorenzo De Stefani (the
student), <a href="http://www.epasto.org">Alessandro Epasto</a>, and
<a href="http://cs.brown.edu/people/eli/">Eli Upfal</a>).</li>
<li><strong>arXiv:</strong> a much longer version of <a
href="papers/DeStefaniEtAl-TRIEST-TKDD.pdf">TRIÈST</a> is now
available.</li>
<li><strong>ACM WSDM'17:</strong> I joined the Program Committee of
<a href="http://www.wsdm-conference.org/2017/">WSDM'17</a>, a conference
I always enjoy so much.</li>
<li><strong>IEEE ICDM'16:</strong> I joined the Program Committee of
<a href="http://icdm16.eurecat.org">ICDM'16</a>, which takes place in
the most awesome city of Barcelona.</li>
<li><strong>ACM KDD'16:</strong> Two papers of mine (<a
href="papers/RiondatoUpfal-BetweennessRademacherAverages-TKDD.pdf">ABRA</a>
and <a href="papers/DeStefaniEtAl-TRIEST-TKDD.pdf">TRIÈST</a>)
were accepted as full presentations. See you in SF in August!</li>
<li><strong>ACM CIKM'16:</strong> I joined the Program Committee of
<a href="http://cikm2016.cs.iupui.edu/">ACM CIKM'16</a>. Nice event
that brings together different communities.</li>
<li><strong>ECML PKDD'16:</strong> I am a member of the Program
Committee. This year the conference will be in beautiful Riva del
Garda, on Lake Garda, Italy, very close to my hometown Padua!</li>
<li><strong>SINS'16:</strong> I'm giving a talk on <a
href="/papers/RiondatoUpfal-BetweennessRademacherAverages-TKDD.pdf">ABRA</a>
at <a href="http://www.dsi.unive.it/~sins2016/">SINS'16</a>, a workshop
on Social Impact through Network Science. It takes place in Venice, in
June. Looking forward to meeting many people there!</li>
<li><strong>GHC'16:</strong> I'm so very excited to be part of the PC
for the <a
href="http://ghc.anitaborg.org/2014-call-for-participation/technology-zone/#data-science">Data
Science track at Grace Hopper 2016</a>, the celebration of women in
computing.</li>
<li><strong>arXiv:</strong> Two new works on the arXiv, one on <a
href="http://arxiv.org/abs/1602.07424">approximate counting
triangles from streams</a> (joint work with <a
href="http://www.epasto.org">Alessandro Epasto</a>, Lorenzo De Stefani,
and <a href="http://www.cs.brown.edu/people/eli/">Eli Upfal</a>), and
one on <a href="http://arxiv.org/abs/1602.05866">fully-dynamic
betweenness centrality approximation</a> (joint work with <a
href="http://www.cs.brown.edu/people/eli/">Eli Upfal</a>). Sampling
rules everything around me, and these two papers show it.</li>
<li><strong>DAMI/DMKD:</strong> Our paper <a
href="papers/RiondatoEtAl-GraphSummarization-DMKD.pdf"><em>Graph
Summarization with Quality Guarantees</em></a> (joint work with David
García-Soriano and Francesco Bonchi) was accepted for
publication. Geometric clustering and extremal graph theory get
together, and the chemistry is great!</li>
<li><strong>WWW'16:</strong> We are giving our tutorial <a
href="centrtutorial/"><em>Centrality Measures on
Big Graphs: Exact, Approximated, and Distributed
Algorithms</em></a> (joint work with <a
href="http://www.francescobonchi.com">Francesco Bonchi</a> and <a
href="http://www.gdfm.me">Gianmarco De Francisci Morales</a>). I
am also a member of the PC and will chair the <a
href="https://www2016.ca/program/program-by-track/research-track.html#track-1-r-520be-social-networks-graph-analysis-1">Social
Networks and Graph Analysis 1</a> session. See you in Montreal!</li>
<li><strong>ACM KDD'16:</strong> I'm a PC member for the Research
track. After WSDM'16, another trip to San Francisco to hear about
exciting research.</li>
<li><strong>ACM WSDM'16:</strong> Our paper <em>Wiggins: Detecting
Valuable Information in Dynamic Networks with Limited Resources</em>
(joint work with Eli Upfal and Ahmad Mahmoody) was accepted.</li>
<li><strong>Brown University:</strong> In Spring 2016, I am teaching <a
href="http://cs.brown.edu/courses/csci1951-g.html">Optimization
Methods in Finance</a>, in the <a
href="http://cs.brown.edu/">Department of Computer
Science</a>. A wonderful area of computer science, with relevant
applications. As usual, I will be balancing theory and
practice.</li>
<li><strong>Stevens Institute of Technology:</strong> on Thursday 12/10 I
will give a guest lecture on Data Mining, hosted by <a
href="http://cgi.di.uoa.gr/~gvalk/">George Valkanas</a>.</li>
<li><strong>Monash University:</strong> On Wednesday 10/28 I'm giving
a talk: <em>Travel pictures from another world: Statistical Learning
Theory meets Data Mining</em>.</li>
<li><strong>CIKM'15:</strong> On Friday 10/23, I'm presenting a <a
href="http://bigdata.cs.brown.edu/vctutorial">tutorial on VC-Dimension
and Rademacher Averages for sampling algorithms</a>.</li>
</ul>
</div>
<?php include("footer.html"); ?>