On relational possibilistic clustering

DOI10.1016/j.patcog.2006.04.008zbMath1100.68104OpenAlexW1991568354WikidataQ60469157 ScholiaQ60469157MaRDI QIDQ2507068

Francesc Oliva, Xavier Font, Miquel De Cáceres

Publication date: 10 October 2006

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2006.04.008

zbMATH Keywords

cluster analysisdissimilarity measuresrelational datapossibilistic c-means

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items

Heuristic possibilistic clustering for detecting optimal number of elements in fuzzy clusters, ECM: An evidential version of the fuzzy \(c\)-means algorithm, Dealing with non-metric dissimilarities in fuzzy central clustering algorithms

Uses Software

• Silhouettes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesized clustering: A method for amalgamating alternative clustering bases with differential weighting of variables
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Relational duals of the c-means clustering algorithms
• A continuous metric scaling solution for a random variable
• The proximity of an individual to a population with applications in discriminant analysis
• An extension to possibilistic fuzzy cluster analysis
• A robust algorithm for automatic extraction of an unknown number of clusters from noisy data
• Some distance properties of latent root and vector methods used in multivariate analysis