Dagstuhl Seminar 26131
New Trends in Clustering
( Mar 22 – Mar 27, 2026 )
(Click in the middle of the image to enlarge)
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/26131
Organizers
- Sayan Bhattacharya (University of Warwick - Coventry, GB)
- Shaofeng Jiang (Peking University, CN)
- Silvio Lattanzi (Google - Barcelona, ES)
- Melanie Schmidt (Heinrich-Heine-Universität Düsseldorf, DE)
Contact
- Michael Gerke (for scientific matters)
- Susanne Bach-Bernhard (for administrative matters)
Dagstuhl Reports
As part of the mandatory documentation, participants are asked to submit their talk abstracts, working group results, etc. for publication in our series Dagstuhl Reports via the Dagstuhl Reports Submission System.
- Upload (Use personal credentials as created in DOOR to log in)
Dagstuhl Seminar Wiki
- Dagstuhl Seminar Wiki (Use personal credentials as created in DOOR to log in)
Shared Documents
- Dagstuhl Materials Page (Use personal credentials as created in DOOR to log in)
Given a collection of data points, how can we partition them into clusters, so that the points in the same (resp. different) clusters are similar (resp. dissimilar) to one another, so as to reveal unknown structure in the data? This is a fundamental unsupervised learning task, with wide ranging applications in social network analysis, image segmentation, spam detection and medical imaging, among many others. The primary focus of this Dagstuhl Seminar is on the theoretical study of clustering algorithms, and specifically, on the design and analysis of approximation algorithms for metric clustering, where data points come from a metric space and their (dis)similarity is meansured by a distance function.
The study of clustering problems dates back several decades, and has led to the adaptation of versatile and powerful algorithm design techniques. In recent years, there has been a surge of activities in the study of clustering problems from different computational vantage points, leading to various new techniques for the development of approximation algorithms. These include new algorithm prototypes that are applicable to sublinear models, and geometric tools to deal with the challenges of high dimensionality. Each of these strands of research focuses on some challenge faced in modern applications involving massive and rapidly evolving data sets, and attempts to design clustering algorithms that overcome this challenge. This had led to a series of recent results on dynamic, online, streaming and massively parallel clustering, as well as on designing clustering algorithms whose outputs are fair, robust, and differentially private.
The seminar aims to bring together researchers working on clustering problems from these divergent perspectives. The topics to be the discussed at the seminar are:
- What are the major open questions? This research area has seen an explosive growth in recent years. In plenary talks and open problem sessions, we plan to survey state-of-the-art results and to identify key open questions.
- Can we find transferable algorithm design techniques? Clustering problems have been considered in a variety of computational models, such as dynamic, online, streaming, MPC, to name a few. A major focus of the seminar will be to identify common algorithm design principles that are transferable across these computational models.
- What strategies can bridge the gap between theory and practice of clustering algorithms? Clustering is a topic that has a diverse set of applications in unsupervised learning. An important goal we want to support is the development of clustering algorithms that are simultaneously: (i) practical and (ii) have strong theoretical guarantees. To this end, we plan to invite several industrial participants (and one of the organizers of this workshop works in industry).
Creative Commons BY 4.0
Sayan Bhattacharya, Shaofeng Jiang, Silvio Lattanzi, and Melanie Schmidt
Please log in to DOOR to see more details.
- Sayan Bhattacharya (University of Warwick - Coventry, GB) [dblp]
- Deeparnab Chakrabarty (Dartmouth College - Hanover, US) [dblp]
- Jaiming Chung (Manchester University, GB)
- Vincent Cohen-Addad (Google - Paris, FR) [dblp]
- Martin Costa (University of Warwick - Coventry, GB) [dblp]
- Artur Czumaj (University of Warwick - Coventry, GB) [dblp]
- Anne Driemel (Universität Bonn, DE) [dblp]
- Aditi Dudeja (The Chinese University of Hong Kong - Shenzhen, CN) [dblp]
- Ermiya Farokhnejad (University of Warwick - Coventry, GB) [dblp]
- Hendrik Fichtenberger (Google Research - Zürich, CH) [dblp]
- Naveen Garg (Indian Institute of Technology - New Delhi, IN) [dblp]
- Gramoz Goranci (Universität Wien, AT) [dblp]
- Anupam Gupta (New York University, US) [dblp]
- Annika Hennes (Heinrich-Heine-Universität Düsseldorf, DE) [dblp]
- Johanna Hillebrand (Heinrich-Heine-Universität Düsseldorf, DE) [dblp]
- Lingxiao Huang (Nanjing University, CN)
- Yichen Huang (Harvard University - Cambridge, US)
- Shaofeng Jiang (Peking University, CN) [dblp]
- Michael Kapralov (EPFL - Lausanne, CH) [dblp]
- Silvio Lattanzi (Google - Barcelona, ES) [dblp]
- Euiwoong Lee (University of Michigan - Ann Arbor, US) [dblp]
- Jianing Lou (Peking University, CN)
- Claire Mathieu (CNRS - Paris, FR) [dblp]
- Danupon Nanongkai (MPI für Informatik - Saarbrücken, DE) [dblp]
- Yasamin Nazari (VU Amsterdam, NL) [dblp]
- Alantha Newman (CNRS & ENS - Lyon, FR) [dblp]
- Heather Newman (Vassar College - Poughkeepsie, US) [dblp]
- Debmalya Panigrahi (Duke University - Durham, US) [dblp]
- Nikos Parotsidis (Google Research - Zürich, CH) [dblp]
- Heiko Röglin (Universität Bonn, DE) [dblp]
- Barna Saha (University of California - San Diego, US) [dblp]
- David Saulpic (CNRS - Paris, FR) [dblp]
- Daniel Schmidt (Heinrich-Heine-Universität Düsseldorf, DE) [dblp]
- Melanie Schmidt (Heinrich-Heine-Universität Düsseldorf, DE) [dblp]
- Chris Schwiegelshohn (Aarhus University, DK) [dblp]
- Antonis Skarlatos (University of Warwick - Coventry, GB)
- Christian Sohler (Universität Köln, DE) [dblp]
- Ola Svensson (EPFL - Lausanne, CH) [dblp]
- Lukas Vogl (EPFL - Lausanne, CH)
- Eric Waingarten (University of Pennsylvania - Philadelphia, US) [dblp]
- David P. Woodruff (Carnegie Mellon University - Pittsburgh, US) [dblp]
Classification
- Data Structures and Algorithms
Keywords
- Clustering
- Approximation Algorithms
