Dealing with non-metric dissimilarities in fuzzy central clustering algorithms

DOI10.1016/j.ijar.2008.08.006zbMath1191.68570OpenAlexW2168633009MaRDI QIDQ962863

Maurizio 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

zbMATH Keywords

fuzzy clusteringrelational clusteringkernel clustering methods

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (3)

Ricci flow embedding for rectifying non-Euclidean dissimilarity data ⋮ A data envelopment analysis-based clustering approach under dynamic situations ⋮ Indefinite Proximity Learning: A Review

Uses Software

• clusfind

Cites Work

• Relational duals of the c-means clustering algorithms
• Pattern classification problems and fuzzy sets
• Support-vector networks
• A survey of kernel and spectral methods for clustering
• On the information and representation of non-Euclidean pairwise data
• On relational possibilistic clustering
• Numerical methods for fuzzy clustering
• Possibilistic Clustering in Feature Space
• Finding Groups in Data
• Least squares quantization in PCM
• Theory of Reproducing Kernels
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dealing with non-metric dissimilarities in fuzzy central clustering algorithms