A family of unsupervised sampling algorithms
From MaRDI portal
(Redirected from Publication:3297372)
Recommendations
Cites work
- A Best Possible Heuristic for the k-Center Problem
- A fast minimum spanning tree algorithm based on \(K\)-means
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A note on an inequality involving the normal distribution
- A survey of outlier detection methodologies
- Algorithm AS 136: A K-Means Clustering Algorithm
- An advancement in clustering via nonparametric density estimation
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Approximating extent measures of points.
- Gradual model generator for single-pass clustering
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 3793445 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Least squares quantization in PCM
- On coresets for k-means and k-median clustering
- Probability Inequalities for Sums of Bounded Random Variables
- Random sampling with a reservoir
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Support vector data description
- Two-phase clustering process for outliers detection
- Weighted random sampling with a reservoir
This page was built for publication: A family of unsupervised sampling algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297372)