19bc916108fc6938f52cb96f7e087941-Reviews.html

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. The authors study a variant of ratio cut with R clusters where the balancing function is biased towards partitions where each cluster has the same size. The main contribution of the paper is a continuous formulation and an algorithm to optimize the criterion directly, whereas previous algorithms are mostly limited to recursive splitting. The direct solution of multi-cut problems instead of using recursive splitting is an important problem given the new developments in finding balanced graph cuts [3,4,5,11,12,18]. The authors first describe the discrete problem (P) and then derive a relaxation of the problem (P-rlx).