Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance

DOI10.1007/978-3-030-95018-7_14arXiv2104.09392OpenAlexW4225613585MaRDI QIDQ6102274

Unnamed Author, Maike Buchin

Publication date: 8 May 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.09392

zbMATH Keywords

clusteringpolygonal curvescoresetsMedian

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Approximating ( k,ℓ )-Median Clustering for Polygonal Curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relative \((p,\varepsilon )\)-approximations in geometry
• Smaller coresets for \(k\)-median and \(k\)-means clustering
• Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
• The VC dimension of metric balls under Fréchet and Hausdorff distances
• Core-Sets: Updated Survey
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• On coresets for k-means and k-median clustering
• Clustering time series under the Fréchet distance
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Approximating (k, ℓ)-center clustering for curves
• A unified framework for approximating and clustering data
• On the Hardness of Computing an Average Curve.

This page was built for publication: Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance