scientific article; zbMATH DE number 6850339
zbMATH Open1403.68070arXiv1711.01171MaRDI QIDQ4607908FDOQ4607908
Authors: Vincent Cohen-Addad, Arnaud de Mesmay, Eva Rotenberg, Alan Roytman
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1711.01171
Title of this publication is not available (Why is that?)
Recommendations
- Minimum sum of squares clustering in a low dimensional space
- Dimensionality reduction for \(k\)-means clustering and low rank approximation
- On the limits of clustering in high dimensions via cost functions
- Clustering high dimension, low sample size data using the maximal data piling distance
- The challenges of clustering high dimensional data
- Cluster-based estimation for sufficient dimension reduction
- Detecting low-rank clusters via random sampling
- Dimensionality-reduced subspace clustering
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (6)
- Geometric clustering, fixed-parameter tractability and lower bounds with respect to the dimension
- On the fixed-parameter tractability of capacitated clustering
- Parameterized \(k\)-clustering: tractability island
- On Geometric Set Cover for Orthants
- Lossy kernelization of same-size clustering
- Lossy kernelization of same-size clustering
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607908)