Journal
PATTERN RECOGNITION LETTERS
Volume 32, Issue 2, Pages 235-243Publisher
ELSEVIER
DOI: 10.1016/j.patrec.2010.08.008
Keywords
Submodular function optimization; Balanced clustering; Discrete optimization
Categories
Funding
- Grants-in-Aid for Scientific Research [22700007, 22700147] Funding Source: KAKEN
Ask authors/readers for more resources
We address the balanced clustering problem where cluster sizes are regularized with submodular functions The objective function for balanced clustering is a submodular fractional function i e the ratio of two submodular functions and thus includes the well-known ratio cuts as special cases In this paper we present a novel algorithm for minimizing this objective function (submodular fractional programming) using recent submodular optimization techniques The main idea is to utilize an algorithm to minimize the difference of two submodular functions combined with the discrete Newton method Thus it can be applied to the objective function involving any submodular functions in both the numerator and the denominator which enables us to design flexible clustering setups We also give theoretical analysis on the algorithm and evaluate the performance through comparative experiments with conventional algorithms by artificial and real datasets (C) 2010 Elsevier B V All rights reserved
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available