The clustering algorithm based on the most similar relation diagram

DOI10.1007/978-3-642-23321-0_64MaRDI QIDQ3098653zbMATH OpenOpenAlexFDO

Authors

Publication date 18 November 2011

Published in Advances in Computer Science, Environment, Ecoinformatics, and Education (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23321-0_64

zbMATH Keywords

data miningweighted graphclustering algorithmmost similar data (MSD)most similar group (MSG)most similar relation diagram (MSRD)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 278992
• Analysis of a mode clustering diagram
• Clustering algorithm of graphs
• Clustering in ordered dissimilarity data
• MCS: A method for finding the number of clusters

Cites work

• scientific article; zbMATH DE number 2090239 (Why is no real title available?)
• A survey of kernel and spectral methods for clustering

Describes a project that uses

Uses Software

• MSRD

This page was built for publication: The clustering algorithm based on the most similar relation diagram

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