By Topic

Partial closure-based constrained clustering with order ranking

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shaohong Zhang ; Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong, China ; Hau-San Wong

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.

Published in:

Pattern Recognition, 2008. ICPR 2008. 19th International Conference on

Date of Conference:

8-11 Dec. 2008