{'fraction_non_alphanumeric': 0.013297872340425532, 'fraction_numerical': 0.0, 'mean_word_length': 4.837209302325581, '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 Implementation and Investigation of Ensemble KNN

This paper reports the investigation of a large scale data mining application to supercomputing environment. The aim is to explore some of the issues that may arise in porting and working with the C++/MPI implementation of the ensemble knn application on supercomputers. In this paper we evaluate behaviour of MFS on several large data sets. The aim of this study is to identify how the performance of the ensemble application depends on the nature of the algorithm used, and on the characteristics of the datasets and the analysis to be performed. This can then be used to select the most appropriate algorithm for a given analysis/dataset, and to indicate the optimum number of processors to