scientific article; zbMATH DE number 7053357

zbMATH Open1422.68259MaRDI QIDQ5743480FDOQ5743480

Authors: Xin Xiao, Kasturi Varadarajan 

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095221

Title of this publication is not available (Why is that?)

Recommendations

• Approximation algorithms for projective clustering
• Publication:4952664
• Efficient approximation algorithms for clustering point-sets
• Linear-time approximation schemes for clustering problems in any dimensions
• Automata, Languages and Programming
• On cluster points of alternating projections
• Projected Gustafson-Kessel Clustering Algorithm and Its Convergence
• scientific article; zbMATH DE number 2069435
• Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
• scientific article; zbMATH DE number 2065610

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Sampling Algorithms and Coresets for $\ell_p$ Regression
• Approximating extent measures of points.
• Title not available (Why is that?)
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• Linear-time approximation schemes for clustering problems in any dimensions
• Approximate clustering via core-sets
• On coresets for k-means and k-median clustering
• A PTAS for k-means clustering based on weak coresets
• Geometric optimization and sums of algebraic functions
• Title not available (Why is that?)
• How to get close to the median shape
• A unified framework for approximating and clustering data
• Robust shape fitting via peeling and grating coresets
• High-dimensional shape fitting in linear time
• Subgradient and sampling algorithms for \(\ell_1\) regression
• Sampling-based dimension reduction for subspace approximation
• Efficient subspace approximation algorithms
• Bi-criteria linear-time approximations for generalized k-mean/median/center
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Title not available (Why is that?)
• Universal \({\epsilon}\)-approximators for integrals
• Coresets and sketches for high dimensional subspace approximation problems
• Coresets for Discrete Integration and Clustering

Cited In (10)

• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
• On the sensitivity of shape fitting problems
• Faster coreset construction for projective clustering via low-rank approximation
• A unified framework for approximating and clustering data
• Learning big (image) data via coresets for dictionaries
• Projective clustering in high dimensions using core-sets
• On geometric prototype and applications
• Approximation algorithms for projective clustering
• Title not available (Why is that?)
• Core-sets: updated survey

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 Q5743480)