A New Clustering Approach for Symbolic Data and Its Validation: Application to the Healthcare Data
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.
KeywordsCluster Algorithm Graph Coloring Diagnosis Related Group Symbolic Data Optimal Partition
Unable to display preview. Download preview PDF.
- 2.Guha, S., Rastogi, R., Shim, K.: CURE: An efficient clustering algorithm for large databases. In: Proceedings of the ACM SIGMOD Conference, Seattle, WA, pp. 73–84 (1998)Google Scholar
- 5.Ng, R., Han, J.: Efficient and effective clustering methods for spatial data mining. In: Proceedings of the 20th Conference on VLDB, Santiago, Chile, pp. 144–155 (1994)Google Scholar