{'fraction_non_alphanumeric': 0.02017067494181536, 'fraction_numerical': 0.0, 'mean_word_length': 5.231884057971015, '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}}
Information entropy-based Clustering Algorithm for Rapid Software Fault Diagnosis

In order to rapidly diagnose and locate the fault, we present ICARSFD (Information entropy-based Clustering Algorithm for Rapid Software Fault Diagnosis). In this paper, the average entropy and the total entropy are defined to guide the clustering operation over fault modes. This algorithm firstly stores the related information of existing faults in the form of fault tree, and deems each fault as an initial cluster. By calculating the information entropy between clusters and comparing them with the average entropy and the total entropy, fault clustering is completed. For the faults inappropriate to their located clusters, we take a retrospective approach to cluster them. Thereby the clustering effect related with the fault order could be addressed. Secondly, according to the ascending order of information entropy, the fault to be analyzed is matched to each cluster. Lastly, both the fault diagnosis results and fault paths are put out. In addition, if the fault match isn't successful, the fault path will be identified through fault tree, and the clustering results will be updated later. The experimental results demonstrate that ICARSFD has both good clustering effect and detection effect.