On Constructing Clusters from Non-Euclidean Dissimilarity Matrix by Using Rough Clustering

DOI10.1007/11780496_2MaRDI QIDQ3617022zbMATH OpenOpenAlexFDO

Authors Shoji Hirano, Shusaku Tsumoto

Publication date 26 March 2009

Published in New Frontiers in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780496_2

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Nonlinear multicriteria clustering based on multiple dissimilarity matrices
• Clustering incomplete relational data using the non-Euclidean relational fuzzy c-means algorithm
• A model for clustering data from heterogeneous dissimilarities
• scientific article; zbMATH DE number 2030530
• A study on the relation between dissimilarity and hierarchical agglomerative methods in cluster analysis

Cites work

• Cluster analysis.
• scientific article; zbMATH DE number 3140353 (Why is no real title available?)

Cited in

(2)

• Rough dissimilarity measurement and its application in hierarchical clustering
• Nonlinear multicriteria clustering based on multiple dissimilarity matrices

This page was built for publication: On Constructing Clusters from Non-Euclidean Dissimilarity Matrix by Using Rough Clustering

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