A graph b-coloring framework for data clustering
type: Item
instance of: scholarly article
title: A graph b-coloring framework for data clustering
zbMATH Open document ID: 1191.68466
author: Haytham Elghazel
author: H. Kheddouci
author: Véronique Deslandres
author: Alain Dussauchoy
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2009-11-25T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5638525
zbMATH Keywords: clustering
zbMATH Keywords: graph b-coloring
zbMATH Keywords: cluster validity indices
describes a project that uses: SODAS
describes a project that uses: AS 136
describes a project that uses: ROCK
describes a project that uses: UCI-ml
MaRDI profile type: Publication
full work available at URL: s10852-008-9093-x
OpenAlex ID: W2039440341
cites work: Generalized Minkowski metrics for mixed feature-type data analysis
cites work: Cure: An efficient clustering algorithm for large databases
cites work: Algorithm AS 136: A K-Means Clustering Algorithm
cites work: An Analysis of Some Graph Theoretical Cluster Techniques
cites work: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
cites work: Q5626710
cites work: k-Components, Clusters and Slicings in Graphs
cites work: Efficient algorithms for divisive hierarchical clustering with the diameter criterion
cites work: A clustering algorithm based on graph connectivity
cites work: Multi-Terminal Network Flows
cites work: Q3869362
cites work: The b-chromatic number of a graph
cites work: Q4483922
cites work: Some bounds for the \(b\)-chromatic number of a graph
cites work: Clustering and its validation in a symbolic framework
cites work: Computing the minimum Hausdorff distance between two point sets on a line under translation
DOI: 10.1007/S10852-008-9093-X
description: scientific article; zbMATH DE number 5638525