{'fraction_non_alphanumeric': 0.020525451559934318, 'fraction_numerical': 0.0016420361247947454, 'mean_word_length': 5.219387755102041, '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}}
Generating closed frequent gensets under constraints based on FP-Tree structure

The mechanism of gene regulation is of great interest for biologists, especially in the genomic field. One part of mechanisms controlling the genes expression is provided by the transcription factors, which are proteins that can either repress or stimulate the transcription of a gene. In this paper, we propose a new data mining algorithm, based on Boolean contexts, in order to extract a priori relevant frequent closed gensets, i.e., sets of tissues and associated sets of genes and transcription factors which are useful for the biologist. The key feature of our algorithm is a better compromise between the size of the search space and the conveyed discovered knowledge in bioinformatics. For this, the proposed algorithm, called MC 2G for mining constraint closed gensets, uses the frequent pattern tree (FP-Tree) structure, which is an extended prefix-tree structure, to prune the search space. Moreover MC2G enables to define statistical and syntaxic constraints on the desired frequent closed gensets and uses them during the extraction process. Experimental comparisons with other algorithms are achieved on real world datasets