As similar items should be in the same part of the split, the best split is one which removes edges with low weights.
a minimum cut problem is to find a partition of the graph which minimizes the following formula, where w(u, v) expresses the weight of an edge between two vertices.