KERNEL METHODS FOR CLUSTERING: COMPETITIVE LEARNING AND c-MEANS
From MaRDI portal
(Redirected from Publication:5487875)
Recommendations
- Kernel approach to possibilisticC-means clustering
- Gaussian-kernel \(c\)-means clustering algorithms
- Cooperative and penalized competitive learning with application to kernel-based clustering
- A survey of kernel and spectral methods for clustering
- A kernel-based hybrid c-means clustering model
- Approximate kernel clustering
- Gaussian-kernel c-means clustering algorithms
Cited in
(15)- SAKM: self-adaptive kernel machine. A kernel-based algorithm for online clustering
- \textit{Kernel cuts}: kernel and spectral clustering meet regularization
- A survey of kernel and spectral methods for clustering
- Self-learning \(K\)-means clustering: a global optimization approach
- Kernel-based methods to identify overlapping clusters with linear and nonlinear boundaries
- A complete gradient clustering algorithm formed with kernel estimators
- Recursive kernel trick for network segmentation
- Selective classification and regression models based on support vector clustering
- A kernel-based core growing clustering method
- Overview on kernels for least-squares support-vector-machine-based clustering: explaining kernel spectral clustering
- A kernel based clustering algorithm using particle swarm optimization
- MICAI 2004: Advances in Artificial Intelligence
- Cooperative and penalized competitive learning with application to kernel-based clustering
- K-T.R.A.C.E: a kernel k-means procedure for classification
- Approximate kernel competitive learning
This page was built for publication: KERNEL METHODS FOR CLUSTERING: COMPETITIVE LEARNING AND c-MEANS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487875)
