Submodular fractional programming for balanced clustering

Authors:
Yoshinobu Kawahara;Kiyohito Nagano;Yoshio Okamoto
Affiliations:
The Institute of Scientific and Industrial Research (ISIR), Osaka University, Japan;Institute of Industrial Science, the University of Tokyo, Japan;Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Japan
Venue:
Pattern Recognition Letters
Year:
2011

Citing 12
Cited 0

Algorithms for clustering data

Algorithms for clustering data
A fast parametric maximum flow algorithm and applications

SIAM Journal on Computing
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Co-clustering documents and words using bipartite spectral graph partitioning

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Techniques of Cluster Algorithms in Data Mining

Data Mining and Knowledge Discovery
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Cluster ensembles --- a knowledge reuse framework for combining multiple partitions

The Journal of Machine Learning Research
Improving graph partitions using submodular functions

Discrete Applied Mathematics - Submodularity
Nonmyopic active learning of Gaussian processes: an exploration-exploitation approach

Proceedings of the 24th international conference on Machine learning
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies

The Journal of Machine Learning Research
Clustering with local and global regularization

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Local search for balanced submodular clusterings

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Quantified Score

Hi-index	0.10

Visualization

Abstract

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.