A Family of Unsupervised Sampling Algorithms
From MaRDI portal
Publication:3297372
DOI10.1007/978-3-030-29349-9_3zbMath1436.62041OpenAlexW2982016054MaRDI QIDQ3297372
Publication date: 3 July 2020
Published in: Sampling Techniques for Supervised or Unsupervised Tasks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-29349-9_3
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- A fast minimum spanning tree algorithm based on \(K\)-means
- Support vector data description
- An advancement in clustering via nonparametric density estimation
- Gradual model generator for single-pass clustering
- Weighted random sampling with a reservoir
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- A note on an inequality involving the normal distribution
- A survey of outlier detection methodologies
- Approximating extent measures of points
- On coresets for k-means and k-median clustering
- Random sampling with a reservoir
- A Best Possible Heuristic for the k-Center Problem
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Least squares quantization in PCM
- Two-phase clustering process for outliers detection
- Probability Inequalities for Sums of Bounded Random Variables
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: A Family of Unsupervised Sampling Algorithms
