Rough dissimilarity measurement and its application in hierarchical clustering

DOI10.3969/J.ISSN.1005-3085.2017.04.003MaRDI QIDQ4643032zbMATH OpenFDO

Authors Chunzhong Li, Yu-Bang Zheng, Ting Wang

Publication date 25 May 2018

zbMATH Keywords

clusteringnearest neighborhoodhierarchical connection graph

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On Constructing Clusters from Non-Euclidean Dissimilarity Matrix by Using Rough Clustering
• An expressive dissimilarity measure for relational clustering using neighbourhood trees
• Structural similarity measure for binary data clustering
• scientific article; zbMATH DE number 2034562
• Vector dissimilarity and clustering

Cited in

(1)

• An expressive dissimilarity measure for relational clustering using neighbourhood trees

This page was built for publication: Rough dissimilarity measurement and its application in hierarchical clustering

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