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

DOI10.1145/3559764arXiv2009.01488MaRDI QIDQ6051930

Anne Driemel, Maike Buchin, Unnamed Author

Publication date: 23 October 2023

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

clusteringmedianapproximation algorithmspolygonal curves

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proposal for robust curve clustering
• Graph clustering
• A global averaging method for dynamic time warping, with applications to clustering
• Correlation clustering
• Summarizing a set of time series by averaging: from Steiner sequence to compact multiple alignment
• Computing the Fréchet distance between simple polygons
• Hierarchical clustering schemes
• Clustering for metric and nonmetric distance measures
• Clustering by Compression
• On coresets for k-means and k-median clustering
• Unsupervised Curve Clustering using B‐Splines
• Clustering time series under the Fréchet distance
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Functional Clustering and Identifying Substructures of Longitudinal Data
• Approximating (k, ℓ)-center clustering for curves
• Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
• A unified framework for approximating and clustering data
• On the Hardness of Computing an Average Curve.
• Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance

This page was built for publication: Approximating ( k,ℓ )-Median Clustering for Polygonal Curves