{'fraction_non_alphanumeric': 0.01593625498007968, 'fraction_numerical': 0.0, 'mean_word_length': 5.080645161290323, '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 streams clustering algorithm using DNA computing techniques based on mobile agent

D-Stream algorithm is an extended grid-based clustering algorithm for the data streams. Actually, grid-based clustering can be considered to be a combinatorial problem of the grids and DNA computing techniques are more suitable to solve the combinatorial problem since its first application, which is the Hamilton path problem. In this paper, we propose a new strategy to do CLIQUE clustering using DNA computing techniques and a new framework based on the mobile agent in order to save time and space. The parallelism of DNA computing, the flexibility, autonomy and interaction of the mobile agent improve the executing efficiency of the data streams clustering.