{'fraction_non_alphanumeric': 0.01245753114382786, 'fraction_numerical': 0.0, 'mean_word_length': 5.405797101449275, '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}}
Manifold clustering via energy minimization

Manifold clustering aims to partition a set of input data into several clusters each of which contains data points from a separate, simple low-dimensional manifold. This paper presents a novel solution to this problem. The proposed algorithm begins by randomly selecting some neighboring orders of the input data and defining an energy function that is described by geometric features of underlying manifolds. By minimizing such energy using the tabu search method, an approximately optimal sequence could be found with ease, and further different manifolds are separated by detecting some crucial points, boundaries between manifolds, along the optimal sequence. We have applied the proposed method to both synthetic data and real image data and experimental results show that the method is feasible and promising in manifold clustering.