scientific article; zbMATH DE number 7053358

Publication date: 10 May 2019

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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

Related Items (6)

Unnamed Item ⋮ Sampling-based dimension reduction for subspace approximation with outliers ⋮ Core-Sets: Updated Survey ⋮ Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering ⋮ Unnamed Item ⋮ An empirical comparison between stochastic and deterministic centroid initialisation for K-means variations

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A smoothing principle for the Huber and other location $M$-estimators
A note on the prize collecting traveling salesman problem
Clustering large graphs via the singular value decomposition
$\epsilon$-nets and simplex range queries
Prediction, learning, uniform convergence, and scale-sensitive dimensions
Efficient distribution-free learning of probabilistic concepts
On approximate geometric $k$-clustering
A randomized approximation scheme for metric MAX-CUT
Characterizations of learnability for classes of $\{0,\dots,n\}$-valued functions
Approximations and optimal geometric divide-and-conquer
Fat-shattering and the learnability of real-valued functions
A combinatorial problem; stability and order for models and theories in infinitary languages
On the density of families of sets
Clustering for edge-cost minimization (extended abstract)
Learnability and the Vapnik-Chervonenkis dimension
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
Sampling-based dimension reduction for subspace approximation
On coresets for k-means and k-median clustering
A PTAS for k-means clustering based on weak coresets
The Planar k-Means Problem is NP-Hard
Scale-sensitive dimensions, uniform convergence, and learnability
Local Search Heuristics for k-Median and Facility Location Problems
A General Approximation Technique for Constrained Forest Problems
On Two Segmentation Problems
Coresets for Discrete Integration and Clustering
A unified framework for approximating and clustering data
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Robust Statistics
Convergence of stochastic processes
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers

This page was built for publication: