Loading [MathJax]/extensions/MathMenu.js
Branch-and-bound technique for solving optimal clustering | IEEE Conference Publication | IEEE Xplore

Branch-and-bound technique for solving optimal clustering


Abstract:

The problem of finding optimal clustering has not been well covered in the literature. Solutions can be found only for special cases, which can be solved in polynomial ti...Show More

Abstract:

The problem of finding optimal clustering has not been well covered in the literature. Solutions can be found only for special cases, which can be solved in polynomial time. In this paper, we give a solution for the general case. The method generates all possible clusterings by a series of merge steps. The clusterings are organized as a minimum redundancy search tree and the optimal clustering is found by a branch-and-bound technique. The result has theoretical interest and could also provide new insight to the problem itself.
Date of Conference: 11-15 August 2002
Date Added to IEEE Xplore: 10 December 2002
Print ISBN:0-7695-1695-X
Print ISSN: 1051-4651
Conference Location: Quebec City, QC, Canada

References

References is not available for this document.