By Topic

A branch and bound clustering algorithm

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

1 Author(s)
Chun-Hung Cheng ; Dept. of Syst. Eng. & Eng. Management, Chinese Univ. of Hong Kong, Shatin, Hong Kong

We discuss the clustering problem in a 0-1 matrix in this paper. Although clustering algorithms are available in the literature, many of them cannot produce a solution matrix in a desirable structure. Therefore, additional computation or user intervention is required to obtain submatrices (i.e., clusters) from a solution matrix. To solve the clustering problem effectively, we use a branch and bound approach. The proposed algorithm uses optimal and heuristic branching rules, and therefore, generates optimal and heuristic solutions, respectively. The comparative study shows that our algorithm not only is more efficient but also produces more reliable solutions than many existing algorithms

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:25 ,  Issue: 5 )