-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.php
83 lines (83 loc) · 4.63 KB
/
index.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
<?php include("header.html"); ?>
<!-- vim: set ts=2 sw=2 tw=79: -->
<div style="clear:both;">
<img src="/files/matteo_riondato.jpg" alt="Head shot of Matteo
Riondato by Andrea Podestà" title="Matteo Riondato"
style="float:left;padding:0 0.5em 0.5em 0;" />
<p>I am an <strong>associate professor</strong> of <a
href="https://www.amherst.edu/academiclife/departments/computer_science">computer
science</a> at <a href="https://www.amherst.edu">Amherst
College</a>, where I lead the <a
href="https://acdmammoths.github.io">Data* Mammoths</a>, a
research&learning group of brilliant undergraduate students, and
I serve as the inaugural director of the <a
href="https://www.amherst.edu/about/science_at_amherst/data-science-initiative">Data
Science Initiative</a>. I also have an appointment as visiting
faculty in <a href="https://cs.brown.edu">Computer Science at Brown
University</a>. Previously, I spent some fantastic years as a
research scientist in the Labs group at <a
href="https://www.twosigma.com/">Two Sigma</a>.</p>
<p>My research focuses on <strong>algorithms</strong> for
<strong>knowledge discovery</strong>, <strong>data mining</strong>,
and <strong>machine learning</strong>. I develop theory and methods
to extract the most information from large datasets, as fast as
possible and in a statistically sound way. The problems I study
include pattern extraction, graph mining, and time series analysis.
My algorithms often use concepts from statistical learning theory and
sampling. My research is supported, in part, by <a
href="https://www.nsf.gov/awardsearch/showAward?AWD_ID=2238693&HistoricalAwards=false">NSF
CAREER Award #2238693</a> and by <a
href="https://www.nsf.gov/awardsearch/showAward?AWD_ID=2006765">NSF
Award #2006765</a>.</p>
<p>My <a
href="https://en.wikipedia.org/wiki/Erd%C5%91s_number">Erdős
number</a> is 3 (<a
href="https://en.wikipedia.org/wiki/Paul_Erd%C5%91s">Erdős</a>
→ <a href="http://math.usf.edu/faculty/ssuen/">Suen</a> →
<a href="https://cs.brown.edu/people/eli">Upfal</a> → Matteo),
and I am a <a
href="https://genealogy.math.ndsu.nodak.edu/id.php?id=190626">mathematical
descendant</a> of <a href="https://cs.brown.edu/people/eli/">Eli
Upfal</a>, <a href="https://en.wikipedia.org/wiki/Eli_Shamir">Eli
Shamir</a> (2<sup>nd</sup> generation), <a
href="https://en.wikipedia.org/wiki/Jacques_Hadamard">Jacques
Hadamard</a> (5<sup>th</sup>), <a
href="https://en.wikipedia.org/wiki/Sim%C3%A9on_Denis_Poisson">Siméon
Denis Poisson</a> (9<sup>th</sup>), and <a
href="https://en.wikipedia.org/wiki/Pierre-Simon_Laplace">Pierre-Simon
Laplace</a> (10<sup>th</sup>).</p>
</div>
<div id="news" style="clear:both;">
<h2>News</h2>
<ul>
<li><strong>SDM'25:</strong> I'm the general chair of the <a
href="https://www.siam.org/conferences-events/siam-conferences/sdm25/">2025
SIAM International Conference on Data Mining</a>, together
with <a href="https://www.cs.ucr.edu/~epapalex/">Vagelis</a>.</li>
<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><a href="oldnews.php">News archive</a></li>
</ul>
</div>
<?php include("footer.html"); ?>