New Clusterization Method Based on Graph Connectivity Search

DOI10.17516/1997-1397-2017-10-4-443-449MaRDI QIDQ5853154zbMATH OpenOpenAlexFDO

Authors M. G. Sadovsky, Eugene Yu. Bushmelev, A. N. Ostylovsky

Publication date 18 March 2021

Published in Journal of Siberian Federal University. Mathematics & Physics (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/jsfu573

zbMATH Keywords

clusterizationcomplexitycomponentconnectivityorder

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Recommendations

• A New Similarity Measure and Its Use in Determining the Number of Clusters in a Multivariate Data Set
• A partitional clustering algorithm validated by a clustering tendency index based on graph theory
• Clustering algorithm of graphs
• scientific article; zbMATH DE number 278992
• A new non-iterative approach for clustering

Cites work

• Community structure in social and biological networks
• Graph theory with applications
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 41467 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)

Cited in

(3)

• Clustering method based on the elastic energy functional of directed signed weighted graphs
• A Local Clustering Algorithm for Connection Graphs
• New Method to Determine Topology of Low-Dimension Manifold Approximating Multidimensional Data Sets

This page was built for publication: New Clusterization Method Based on Graph Connectivity Search

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