A New Clustering Approach for Symbolic Data and its Validation: Application to the Healthcare Data

Abstract : Graph coloring is used to characterize some properties of graphs. A b-coloring of a graph G (using colors 1,2,...,k) is a coloring of the vertices of G such that (i) two neighbors have different colors (proper coloring) and (ii) for each color class there exists a dominating vertex which is adjacent to all other k-1 color classes. In this paper, based on a b-coloring of a graph, we propose a new clustering technique. Additionally, we provide a cluster validation algorithm. This algorithm aims at finding the optimal number of clusters by evaluating the property of color dominating vertex. We adopt this clustering technique for discovering a new typology of hospital stays in the French healthcare system.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00188994
Contributor : Véronique Deslandres <>
Submitted on : Monday, November 19, 2007 - 5:12:41 PM
Last modification on : Wednesday, April 3, 2019 - 1:07:18 AM

Identifiers

  • HAL Id : hal-00188994, version 1

Citation

Haytham Elghazel, Véronique Deslandres, Mohand-Said Hacid, Alain Dussauchoy, Hamamache Kheddouci. A New Clustering Approach for Symbolic Data and its Validation: Application to the Healthcare Data. 16th International Symposium on Methodologies for Intelligent Systems, Sep 2006, Bari, Italy. pp.473-482. ⟨hal-00188994⟩

Share

Metrics

Record views

376