Dealing with non-metric dissimilarities in fuzzy central clustering algorithms
From MaRDI portal
Publication:962863
DOI10.1016/J.IJAR.2008.08.006zbMATH Open1191.68570OpenAlexW2168633009MaRDI QIDQ962863FDOQ962863
Authors: M. Filippone 
Publication date: 7 April 2010
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: http://eprints.gla.ac.uk/56334/1/56334.pdf
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
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Cites Work
- Finding Groups in Data
- Support-vector networks
- Least squares quantization in PCM
- Theory of Reproducing Kernels
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of kernel and spectral methods for clustering
- On relational possibilistic clustering
- Numerical methods for fuzzy clustering
- Relational duals of the c-means clustering algorithms
- Title not available (Why is that?)
- Pattern classification problems and fuzzy sets
- On the information and representation of non-Euclidean pairwise data
- Possibilistic Clustering in Feature Space
Cited In (3)
Uses Software
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)
