On the strengths of the self-updating process clustering algorithm
DOI10.1080/00949655.2015.1049605OpenAlexW2280812514MaRDI QIDQ5222391FDOQ5222391
Authors: Shang-Ying Shiu, Ting-Li Chen 
Publication date: 1 April 2020
Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.1979
Recommendations
- Analytical and Numerical Evaluation of the Suppressed Fuzzy C-Means Algorithm
- Design of blurring mean-shift algorithms for data classification
- On Autonomous k-Means Clustering
- A review on suppressed fuzzy c-means clustering models
- Supercluster in statics and dynamics: an approximate structure imitating a rough set
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Clustering in the social and behavioral sciences (91C20)
Cites Work
- Estimating the number of clusters in a data set via the gap statistic
- Title not available (Why is that?)
- GAP: a graphical environment for matrix visualization and cluster analysis
- Title not available (Why is that?)
- Model-Based Gaussian and Non-Gaussian Clustering
- Least squares quantization in PCM
- Title not available (Why is that?)
- The estimation of the gradient of a density function, with applications in pattern recognition
- Title not available (Why is that?)
- On the convergence and consistency of the blurring mean-shift process
- Tight Clustering: A Resampling‐Based Approach for Identifying Stable and Tight Patterns in Data
- \(\gamma\)-SUP: a clustering algorithm for cryo-electron microscopy images of asymmetric particles
- On the weak convergence and central limit theorem of blurring and nonblurring processes with application to robust location estimation
Cited In (1)
Uses Software
This page was built for publication: On the strengths of the self-updating process clustering algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222391)
