2010 Fiscal Year Final Research Report
A Clustering Method based on graph Coloring for integrating Local and Global Constraints
| Project/Area Number |
20500123
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Intelligent informatics
|
|---|
| Research Institution | Hokkaido University |
|---|
Principal Investigator |
YOSHIDA Tetsuya Hokkaido University, 大学院・情報科学研究科, 准教授 (80294164)
|
|---|
| Project Period (FY) |
2008 – 2010
|
| Keywords | グラフ / クラスタリング / 彩色 / 制約 |
|---|
| Research Abstract |
We have developed a clustering method based on b-coloring of a graph in Graph Theory. This coloring requires that two kinds of constraints should be satisfied in the coloring of a graph. By regarding one kind of constraint as a local constraint and the other as a global constraint, we have developed a clustering method which reflects both constraints in a unified manner. For a given dataset, we define a graph structure based on the pairwise dissimilarities so that the coloring of the dataset can be conducted over the graph. The developed algorithm conducts the coloring of the graph for conducting the clustering of the dataset. The algorithm has been implemented as a prototype system, and experiments using the prototype system were conducted over several datasets. The results of the experiments indicate the effectiveness of the developed clustering algorithm.
|
-
-
-
-
-
-
-
-
-
-
[Presentation] Message Correlation and Web Service Protocol Mining from Inaccurate Logs2010
Author(s)
Musaraj, K, Yoshida, T., Daniel, F., Hacid, M.S., Casati,F., Benatallah, B.
Organizer
The IEEE 8th International Conference on Web Services, 259-266
Place of Presentation
Florida, USA
Year and Date
2010-07-08
-
