{'fraction_non_alphanumeric': 0.023969319271332695, 'fraction_numerical': 0.0, 'mean_word_length': 5.365853658536586, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Improved Maximum Margin Clustering via the Bundle Method

Maximum margin clustering (MMC) is an effective clustering algorithm, which first extends a large margin principle into unsupervised learning. This paper revisits the MMC problem and points out the potential problems encountered by a cutting plane approach. We propose an improved MMC algorithm via the bundle method (BMMC). Specifically, the constrained convex–concave procedure algorithm is first applied to decompose the MMC problem into a series of convex sub-problems, and then, the bundle method is adopted to efficiently solve each sub-problem. Moreover, a simpler formulation for the multi-class MMC is presented. In addition to clustering problems, the BMMC is also extended to the semi-supervised case by incorporating the pairwise constraints, which reveals its high scalability. Compared with the previous works, the proposed solution is much simpler and faster. The experiments on several data sets are conducted to demonstrate the effectiveness of our proposed algorithm.