{'fraction_non_alphanumeric': 0.011349306431273645, 'fraction_numerical': 0.0037831021437578815, 'mean_word_length': 5.251968503937008, '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}}
Exploiting training example parallelism with a batch variant of the ART 2 classification algorithm

In this article we develop a batch variant of the ART 2 classification algorithm invented by Carpenter and Grossberg. Our algorithm exploits training example parallelism while leaving the overall design of the ART 2 network unchanged such that a significant reduction of the execution time can be achieved on a multiprocessor system. We present a parallel implementation strategy and analyze it w.r.t. execution time and speedup. As our algorithm naturally benefits from data parallelism, the implementation uses data parallel skeletons of the Muenster skeleton library Muesli. We show that skeletons are an efficient way to write parallel applications compared to a manual MPI implementation.