{'fraction_non_alphanumeric': 0.013568521031207599, 'fraction_numerical': 0.0, 'mean_word_length': 4.904, '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}}
A Data Mapping Strategy of Parallel Data Mining in Grid

In order to achieve data load balancing of mining nodes in parallel data mining based on grid, this paper proposes a data mapping strategy based on minimum time cost: MapND. Firstly, MapND strategy divided data sets referenced in the data mining into data blocks; Then, the strategy respectively estimated the sum of transmission time and data mining time between each mining node and each data block, and mapped each data block to corresponding mining node according to the minimum time sum. Experimental results show that the proposed MapND strategy can solve the problem of data load balancing for data mining nodes, and improve the performance of parallel data mining in grid.