On the sensitivity of shape fitting problems

DOI10.4230/LIPICS.FSTTCS.2012.486MaRDI QIDQ2957523zbMATH OpenFDO

Authors Xin Xiao, Kasturi Varadarajan

Publication date 26 January 2017

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

zbMATH Keywords

clustering\(k\)-meanscoresetsshape fittingsubspace approximation

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 7053357
• A unified framework for approximating and clustering data
• Projective clustering in high dimensions using core-sets
• Smaller coresets for \(k\)-median and \(k\)-means clustering
• Coresets for Discrete Integration and Clustering

Cited in

(10)

• scientific article; zbMATH DE number 5149735 (Why is no real title available?)
• Fitting cylinders computation with an application to measuring \(3D\) shapes
• High-dimensional shape fitting in linear time
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
• Weighted SGD for \(\ell_p\) regression with randomized preconditioning
• Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance
• Shape Fitting on Point Sets with Probability Distributions
• On estimating local shape using contact sensing
• New subset selection algorithms for low rank approximation: offline and online
• Turning big data into tiny data: coresets for unsupervised learning problems

This page was built for publication: On the sensitivity of shape fitting problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957523)