A clustering algorithm based on graph connectivity

DOI10.1016/S0020-0190(00)00142-3zbMath0996.68525WikidataQ60307349 ScholiaQ60307349MaRDI QIDQ1607070

Ron Shamir, Erez Hartuv

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (22)

Simulated annealing based automatic fuzzy clustering combined with ANN classification for analyzing microarray data ⋮ Exploring gene causal interactions using an enhanced constraint-based method ⋮ Partitioning a Graph into Highly Connected Subgraphs ⋮ A clustering algorithm based on maximal \(\varTheta\)-distant subtrees ⋮ Optimal rates for community estimation in the weighted stochastic block model ⋮ GrDBSCAN: a granular density-based clustering algorithm ⋮ Mechanism and a new algorithm for nonconvex clustering ⋮ Post-processing hierarchical community structures: quality improvements and multi-scale view ⋮ Unnamed Item ⋮ Graph clustering ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ Reconstruction and estimation in the planted partition model ⋮ FPT Approximation for Constrained Metric k-Median/Means ⋮ Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques ⋮ Clustering with \(r\)-regular graphs ⋮ GAPS: A clustering method using a new point symmetry-based distance measure ⋮ Highly Bi-Connected Subgraphs for Computational Protein Function Annotation ⋮ Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics ⋮ A graph b-coloring framework for data clustering ⋮ Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters ⋮ Hierarchical clustering based on ordinal consistency ⋮ 2-proper partition of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cluster analysis and mathematical programming
• Mathematical classification and clustering
• Multi-Terminal Network Flows
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• Printer graphics for clustering
• k-Components, Clusters and Slicings in Graphs

This page was built for publication: A clustering algorithm based on graph connectivity