Minimum Average Cost Clustering

A number of objective functions in clustering problems can be described with submodular functions. In this paper, we introduce the minimum average cost criterion, and show that the theory of intersecting submodular functions can be used for clustering with submodular objective functions. The proposed algorithm does not require the number of clusters in advance, and it will be determined by the property of a given set of data points. The minimum average cost clustering problem is parameterized with a real variable, and surprisingly, we show that all information about optimal clusterings for all parameters can be computed in polynomial time in total. Additionally, we evaluate the performance of the proposed algorithm through computational experiments.

[1]  R. P. Dilworth.  Dependence Relations in a Semi-Modular Lattice , 1944 .

[2]  William H. Cunningham,et al.  Optimal attack and reinforcement of a network , 1985, JACM.

[3]  Satoru Fujishige,et al.  Submodular functions and optimization , 1991 .

[4]  Dorit S. Hochbaum,et al.  A Polynomial Algorithm for the k-cut Problem for Fixed k , 1994, Math. Oper. Res..

[5]  Maurice Queyranne,et al.  Minimizing symmetric submodular functions , 1998, Math. Program..

[6]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[7]  Toshihide Ibaraki,et al.  A Unified Framework for Approximating Multiway Partition Problems , 2009, ISAAC.

[8]  Toshihide Ibaraki,et al.  Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts , 2001, J. Comb. Optim..

[9]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[10]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[11]  Dale Schuurmans,et al.  Maximum Margin Clustering , 2004, NIPS.

[12]  S. Thomas McCormick,et al.  Submodular Function Minimization , 2005 .

[13]  Jeff A. Bilmes,et al.  Q-Clustering , 2005, NIPS.

[14]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[15]  Jeff A. Bilmes,et al.  Local Search for Balanced Submodular Clusterings , 2007, IJCAI.

[16]  Vladimir Kolmogorov,et al.  A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph , 2010, Algorithmica.

[17]  Takuro Fukunaga,et al.  Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems , 2009, ISAAC.

[18]  Yoshio Okamoto,et al.  Submodular fractional programming for balanced clustering , 2011, Pattern Recognit. Lett..