Partial Closure-based constrained clustering with order ranking
Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Title of host publication | Proceedings - International Conference on Pattern Recognition |
| Publication status | Published - 2008 |
Publication series
| Name | |
|---|---|
| ISSN (Print) | 1051-4651 |
Conference
| Title | 2008 19th International Conference on Pattern Recognition, ICPR 2008 |
|---|---|
| Place | United States |
| City | Tampa, FL |
| Period | 8 - 11 December 2008 |
Link(s)
Abstract
In this paper we propose a new partial closure-based constrained clustering algorithm. We introduce closures into the partial constrained clustering and we propose a new measurement to order the importance of the constrained closures. Experiments on public datasets demonstrate the advantages of our algorithm over the standard Kmeans and two state-of-the-art constrained clustering algorithms. © 2008 IEEE.
Citation Format(s)
Partial Closure-based constrained clustering with order ranking. / Zhang, Shaohong; Wong, Hau-San.
Proceedings - International Conference on Pattern Recognition. 2008. 4760984.
Proceedings - International Conference on Pattern Recognition. 2008. 4760984.
Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review
