2006
DOI: 10.1007/11875604_54
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0

Year Published

2007
2007
2014
2014

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 25 publications
(18 citation statements)
references
References 7 publications
0
18
0
Order By: Relevance
“…This paper reports the work in adopting the Markov Models and a recently proposed b-coloring based clustering approach [1] for discovering a typology of clinical pathways in the French medical information system.…”
Section: Context and Motivationsmentioning
confidence: 99%
See 2 more Smart Citations
“…This paper reports the work in adopting the Markov Models and a recently proposed b-coloring based clustering approach [1] for discovering a typology of clinical pathways in the French medical information system.…”
Section: Context and Motivationsmentioning
confidence: 99%
“…In order to divide the vertex set V into a partition , , … , where for ∀ C i ,C j ∈ P, C i ∩ C j =∅ for i≠j (when the number of clusters k is not pre-defined), our new clustering approach [1], based on graph b-coloring is applied to the graph G. A graph b-coloring is the assignment of colors (clusters) to the vertices of the graph such that: (i) no two adjacent vertices have the same color (proper coloring), (ii) for each color there exists at least one dominating vertex which is adjacent to all the other colors.…”
Section: Clinical Pathways Clusteringmentioning
confidence: 99%
See 1 more Smart Citation
“…The b-coloring based clustering method enables to build a fine partition of the dataset into clusters even when the number of clusters is not specified in advance. The previous clustering algorithm in (Elghazel et al, 2006) conducts the following two steps in greedy fashion: 1. initalizes the colors of vertices so that the colors satisfy proper coloring, and 2. removes, by a greedy procedure, the colors that have no dominating vertices, until each color has at least one dominating vertex. These steps correspond to the above two constraints in b-coloring.…”
Section: Introductionmentioning
confidence: 99%
“…In order to alleviate this weakness, we have proposed a greedy algorithm which realizes the re-coloring of data items (vertices) to improve the quality of the constructed partition (Elghazel et al, 2007). Informally, our algorithm selects at each stage the vertex with the maximum degree of "outlier" and which do not affects the dominant vertices in the bcoloring.…”
Section: Introductionmentioning
confidence: 99%