On the strengths of the self-updating process clustering algorithm
From MaRDI portal
Publication:5222391
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
Cites work
- 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 1750179 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Estimating the number of clusters in a data set via the gap statistic
- GAP: a graphical environment for matrix visualization and cluster analysis
- Least squares quantization in PCM
- Model-Based Gaussian and Non-Gaussian Clustering
- On the convergence and consistency of the blurring mean-shift process
- On the weak convergence and central limit theorem of blurring and nonblurring processes with application to robust location estimation
- The estimation of the gradient of a density function, with applications in pattern recognition
- 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
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)