Academic
Publications
Toward Improving Re-coloring Based Clustering with Graph b-Coloring

Toward Improving Re-coloring Based Clustering with Graph b-Coloring,10.1007/978-3-642-15246-7_21,Hiroki Ogino,Tetsuya Yoshida

Toward Improving Re-coloring Based Clustering with Graph b-Coloring   (Citations: 2)
BibTex | RIS | RefWorks Download
This paper proposes an approach toward improving re-coloring based clustering with graph b-coloring. Previous b-coloring based clustering algorithm did not consider the quality of clusters. Although a greedy re-coloring algorithm was proposed, it was still restrictive in terms of the explored search space due to its greedy and sequential re-coloring process. We aim at overcoming the limitations by enlarging the search space for re-coloring, while guaranteeing b-coloring properties. A best first re-coloring algorithm is proposed to realize non-greedy search for the admissible colors of vertices. A color exchange algorithm is proposed to remedy the problem in sequential re-coloring. These algorithms are orthogonal with respect to the re-colored vertices and thus can be utilized in conjunction. Preliminary evaluations are conducted over several benchmark datasets, and the results are encouraging.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: