A branch and bound clustering algorithm
Publication in refereed journal


Times Cited
Web of Science15WOS source URL (as at 27/05/2020) Click here for the latest count
Altmetrics Information
.

Other information
AbstractWe 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.
All Author(s) ListCHENG CH
Journal nameIEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS
Year1995
Month5
Day1
Volume Number25
Issue Number5
PublisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Pages895 - 898
ISSN0018-9472
LanguagesEnglish-United Kingdom
Web of Science Subject CategoriesComputer Science; Computer Science, Cybernetics; Engineering; Engineering, Electrical & Electronic

Last updated on 2020-28-05 at 03:56