{'fraction_non_alphanumeric': 0.02267818574514039, 'fraction_numerical': 0.0, 'mean_word_length': 6.130769230769231, '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}}
Two-Phase Spectral Clustering Based on Discretization

As spectral clustering has become increasingly popular in recent years, further research on it is very important. Due to the important role of discretization in data mining, a new clustering approach integrating discretization with density-sensitive spectral clustering namely density-sensitive spectral clustering of categorized data (DSSCCAT) is proposed. To alleviate the high computational complexity of DSSCCAT, two-phase spectral clustering (TPSC) algorithm is proposed, which involves two phases: construct the representatives of the original dataset and cluster the representatives with DSSCCAT. Experimental results on UCI datasets show the feasibility of combining discretization with density-sensitive spectral clustering. TPSC can obtain desirable clusters with high performance. Furthermore, TPSC outperforms DSSCCAT obviously in terms of computational time.