Dealing with non-metric dissimilarities in fuzzy central clustering algorithms
From MaRDI portal
Publication:962863
Recommendations
- Relational duals of the c-means clustering algorithms
- Clustering incomplete relational data using the non-Euclidean relational fuzzy c-means algorithm
- Kernelized non-Euclidean relational c-means algorithms
- Relational partitioning fuzzy clustering algorithms based on multiple dissimilarity matrices
- scientific article; zbMATH DE number 558455
Cites work
- scientific article; zbMATH DE number 1810276 (Why is no real title available?)
- scientific article; zbMATH DE number 3793445 (Why is no real title available?)
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 193745 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A survey of kernel and spectral methods for clustering
- Feature discovery in non-metric pairwise data
- Finding Groups in Data
- Least squares quantization in PCM
- Numerical methods for fuzzy clustering
- On relational possibilistic clustering
- On the information and representation of non-Euclidean pairwise data
- Pattern classification problems and fuzzy sets
- Possibilistic Clustering in Feature Space
- Relational duals of the c-means clustering algorithms
- Support-vector networks
- Theory of Reproducing Kernels
Cited in
(4)
This page was built for publication: Dealing with non-metric dissimilarities in fuzzy central clustering algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962863)