{'fraction_non_alphanumeric': 0.016177957532861477, 'fraction_numerical': 0.0, 'mean_word_length': 5.1875, '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}}
Text clustering algorithm based on spectral graph seriation

In the field of information processing, most of the existing text clustering algorithm is based on Vector Space Model(VSM). However, VSM can not effectively express the structure of the text so that it can not fully express the semantic information of the text. In order to improve the ability of expression in the semantic information, this paper presents a new text structure graph model. With the weighted graph, this model expresses the characteristics term of the text and its associated location information. On this basis of spectral graph seriation, a spectral clustering algorithm is put forward. This algorithm replace solving common subgraph with matrix computation, then reduce the computational complexity of graph clustering. There are also algorithm analysis and experiment in the paper. The results of the study show that the text clustering algorithm based on spectral graph seriation is effective and feasible.