{'fraction_non_alphanumeric': 0.009363295880149813, 'fraction_numerical': 0.0, 'mean_word_length': 5.524390243902439, '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}}
Parallel Multidimensional Uncertain Data Evidence Theory Decision Tree

Evidence theory decision tree is an efficient classification technique can be used in uncertain data mining field. But it can’t deal with large training sets of millions of samples which are common in this field. This paper develops parallel algorithm for evidence theory decision tree on the multidimensional cube structure. Example shows this algorithm can treat with very large multidimensional uncertain data training set and shows good parallel performance.