{'fraction_non_alphanumeric': 0.01607717041800643, 'fraction_numerical': 0.003215434083601286, 'mean_word_length': 4.768518518518518, '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}}
Metrics for Graph Partition by Using Machine Learning Techniques

In our previous work, we explored the possibility of applying machine learning technique to graph partition. We use some metrics to describe the graph, rank the execution time of some graph algorithm and feed them into the machine learning models. We proved that decision tree and KNN and good models of this problem. In the paper, we go on to investigate more metrics to describe the graph after partitioning. We found that AverageDegreeNotCut is also an important metric. We improve the precision score of original machine learning models by 4.9 percent.