Statistical and Probabilistic Methods in Algorithmic Data Analysis (Dagstuhl Seminar 24391)

Authors Aristides Gionis, Matteo Riondato, Eli Upfal and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.14.9.127.pdf
  • Filesize: 2.49 MB
  • 18 pages

Document Identifiers

Author Details

Aristides Gionis
  • KTH Royal Institute of Technology - Stockholm, SE
Matteo Riondato
  • Amherst College, US
Eli Upfal
  • Brown University - Providence, US
and all authors of the abstracts in this report

Cite As Get BibTex

Aristides Gionis, Matteo Riondato, and Eli Upfal. Statistical and Probabilistic Methods in Algorithmic Data Analysis (Dagstuhl Seminar 24391). In Dagstuhl Reports, Volume 14, Issue 9, pp. 127-144, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/DagRep.14.9.127

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar "Statistical and Probabilistic Methods in Algorithmic Data Analysis" (24391). Modern algorithms for data analysis require the use of advanced probabilistic methods to achieve the necessary scalability and accuracy guarantees. At the same time, modern tasks of knowledge discovery from data require the use of advanced statistics to handle challenges such as the test of multiple hypotheses or dependency structure of the data points, such as in time series or graphs. Probabilistic methods are also at the core of areas of theoretical computer science such as sub-linear algorithms and average-case analysis. The application of these methods requires careful balancing of theoretical and practical considerations, to obtain efficient algorithms for data analysis. The Dagstuhl Seminar focused on statistical and probabilistic methods to develop and analyze useful, scalable algorithms for knowledge discovery from large, rich datasets. Participants from different countries, at different stages of their careers, and from both industry and academia gave talks on the topics of the seminar, usually presenting their own research, either recently published or soon-to-be. There was ample time for socializing, networking, and starting or continuing collaborations, and new results are expected to be published thanks to these collaborations.

Subject Classification

ACM Subject Classification
  • Theory of computation → Approximation algorithms analysis
  • Information systems → Data mining
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Streaming, sublinear and near linear time algorithms
Keywords
  • approximation algorithms
  • data science
  • online algorithms
  • randomized algorithms
  • statistical data analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail