CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2009 vol.31 Issue No.11 - November

Subscribe

Issue No.11 - November (2009 vol.31)

pp: 2083-2087

Edward K.F. Dang , The Hong Kong Polytechnic University, Hong Kong

D.L. Lee , Hong Kong University of Science and Technology, Hong Kong

K.S. Ho , The Hong Kong Polytechnic University, Hong Kong

Stephen C.F. Chan , The Hong Kong Polytechnic University, Hong Kong

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2009.75

ABSTRACT

Given a set of clusters, we consider an optimization problem which seeks a subset of clusters that maximizes the microaverage F-measure. This optimal value can be used as an evaluation measure of the goodness of clustering. For arbitrarily overlapping clusters, finding the optimal value is NP-hard. We claim that a greedy approximation algorithm yields the global optimal solution for clusters that overlap only by nesting. We present a mathematical proof of this claim by induction. For a family of n clusters containing a total of N objects, this algorithm has an {\rm O}(n^{2}) time complexity and O(N) space complexity.

INDEX TERMS

Clustering, classification, performance evaluation, optimization.

CITATION

Edward K.F. Dang, D.L. Lee, K.S. Ho, Stephen C.F. Chan, "Optimal Combination of Nested Clusters by a Greedy Approximation Algorithm",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol.31, no. 11, pp. 2083-2087, November 2009, doi:10.1109/TPAMI.2009.75REFERENCES