A graph b-coloring framework for data clustering

DOI10.1007/s10852-008-9093-xzbMath1191.68466OpenAlexW2039440341MaRDI QIDQ1040797

Alain Dussauchoy, Haytham Elghazel, Hamamache Kheddouci, Véronique Deslandres

Publication date: 25 November 2009

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-008-9093-x

zbMATH Keywords

clusteringgraph b-coloringcluster validity indices

Mathematics Subject Classification ID

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

Related Items (1)

Clustering of patients' trajectories with an auto-stopped bisecting K-Medoids algorithm

Uses Software

• SODAS
• UCI-ml
• AS 136
• ROCK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithm AS 136: A K-Means Clustering Algorithm
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Computing the minimum Hausdorff distance between two point sets on a line under translation
• The b-chromatic number of a graph
• A clustering algorithm based on graph connectivity
• Some bounds for the \(b\)-chromatic number of a graph
• Cure: An efficient clustering algorithm for large databases
• Multi-Terminal Network Flows
• Clustering and its validation in a symbolic framework
• Generalized Minkowski metrics for mixed feature-type data analysis
• An Analysis of Some Graph Theoretical Cluster Techniques
• k-Components, Clusters and Slicings in Graphs
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

This page was built for publication: A graph b-coloring framework for data clustering