Matteo Riondato

Contact info

Head shot of Matteo
					Riondato by Andrea Podestà

I am an assistant professor of computer science at Amherst College, where I lead the Data* Mammoths. I also have an appointment as visiting faculty in Computer Science at Brown University. Previously, I spent some fantastic years as a research scientist in the Labs group at Two Sigma.

My research focuses on algorithms for knowledge discovery, data mining, and machine learning. 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 NSF Award #2006765.

My Erdős number is 3 (ErdősSuenUpfal → Matteo), and I am a mathematical descendant of Eli Upfal, Eli Shamir (2nd generation), Jacques Hadamard (5th), Siméon Denis Poisson (9th), and Pierre-Simon Laplace (10th).

News

  • KDD'21: Two papers accepted in the research track: Bavarian, on betweenness centrality approximation, and MaNIACS, on approximating the frequent subgraphs in a large graph through sampling.
  • WSDM'21: RePBubLik wins a Best Paper Award Honorable Mention! Yay!
  • KTH talk (2/18): Giving a talk about RePBubLik at KTH. Thank you Aris and Stefan for inviting me!
  • TKDD: TipTap, our work on maintaining frequent subgraphs in fully-dynamic edge graph streams has been accepted to ACM TKDD. Nice work using reservoir sampling and random pairing, with Gianmarco, Cigdem, and Anis.
  • News archive