{'fraction_non_alphanumeric': 0.024128686327077747, 'fraction_numerical': 0.0, 'mean_word_length': 4.743589743589744, '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}}
Machine preparation for human labelling of hierarchical train sets by spectral clustering

Human labeling of an unknown dataset for machine learning is a tedious work for humans. The aim of the paper was to develop a machine preparation of the data that helps human annotators to label at the higher level (point-set level). We present two different approaches to cluster point-sets with spectral clustering. The fundamental idea was to use the set of relations to rescale the weight of edges between point pairs. The first approach is based on a fully connected weight graph (FC-WG). In this case each point is connected to every other point, and only the weights control the outcome of the clustering. Another approach uses a proposed graph, so called the nearest points of point-sets weight graph (NPP-WG), which is not a fully connected graph, because the connections between point-sets are restricted. We investigated our theoretical approaches at two different datasets. The results show that spectral clustering with weight graphs are suitable to use on points, while it also provides the grouping of point-sets.