Partitioning hard clustering algorithms based on multiple dissimilarity matrices

DOI10.1016/J.PATCOG.2011.05.016MaRDI QIDQ645877zbMATH OpenOpenAlexFDO

Authors Yves Lechevallier, Filipe M. De Melo, Francisco de A. T. de Carvalho

Publication date 10 November 2011

Published in Pattern Recognition (Search for Journal in Brave)

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

zbMATH Keywords

relational datamultiple dissimilarity matricespartitioning clustering algorithmsrelevance weight

Mathematics Subject Classification ID

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

Recommendations

• A tractable multi-partitions clustering
• Relational partitioning fuzzy clustering algorithms based on multiple dissimilarity matrices
• Partial dissimilarities with application to clustering
• Partitional clustering algorithms
• Clustering via nonsymmetric partition distributions
• Partition-based clustering using constraint optimization
• Nonlinear multicriteria clustering based on multiple dissimilarity matrices
• Algorithm of Hierarchical Matrix Clusterization and Its Applications

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 3793445 (Why is no real title available?)
• scientific article; zbMATH DE number 3518115 (Why is no real title available?)
• scientific article; zbMATH DE number 3584801 (Why is no real title available?)
• scientific article; zbMATH DE number 1107554 (Why is no real title available?)
• scientific article; zbMATH DE number 1385870 (Why is no real title available?)
• scientific article; zbMATH DE number 3448387 (Why is no real title available?)
• A monothetic clustering method
• Clustering and aggregation of relational data with applications to image database categorization
• Dissimilarity measures for time trajectories
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Finding Groups in Data
• J-MEANS: A new local search heuristic for minimum sum of squares clustering
• Relational duals of the c-means clustering algorithms

Cited in

(11)

• Clustering in ordered dissimilarity data
• A Clustering Method Based on Soft Learning of Model (Prototype) and Dissimilarity Metrics
• Generalized hard cluster analysis
• Relational partitioning fuzzy clustering algorithms based on multiple dissimilarity matrices
• Combining dissimilarity matrices by using rank correlations
• A model for clustering data from heterogeneous dissimilarities
• \(k\)-Mnv-Rep: a \(k\)-type clustering algorithm for matrix-object data
• Active constrained fuzzy clustering: a multiple kernels learning approach
• A fast multiobjective fuzzy clustering with multimeasures combination
• Nonlinear multicriteria clustering based on multiple dissimilarity matrices
• A tractable multi-partitions clustering

Describes a project that uses

Uses Software

• ROCK
• UCI
• J-MEANS

This page was built for publication: Partitioning hard clustering algorithms based on multiple dissimilarity matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645877)