{'fraction_non_alphanumeric': 0.017948717948717947, 'fraction_numerical': 0.0, 'mean_word_length': 4.785185185185185, '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}}
Graph Based AHC Algorithm for Text Clustering

In this research, we propose the graph based AHC algorithm where a graph is given as the input, as the approach to the text clustering tasks. The ontology is the popular and standard representations of knowledge as a graph, so it may be more natural to encode texts into graphs rather than numerical vectors. In this research, we encode texts into graphs, define the similarity measure between graphs, and modify the AHC algorithm into the graph based version. As the benefits from this research, we may expect the better performance and more graphical representations of data items, by proposing that texts should be encoded so. Therefore, the goal of this research is to implement the text clustering system which has the benefits.