{'fraction_non_alphanumeric': 0.011389521640091117, 'fraction_numerical': 0.0, 'mean_word_length': 5.559701492537314, '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 Mining Formalization to Improve Hypergraph Minimal Transversal Computation

Finding hypergraph transversals is a major algorithmic issue which was shown having many connections with the data mining area. In this paper, by defining a new Galois connection, we show that this problem is closely related to the mining of the so-called condensed representations of frequent patterns. This data mining formalization enables us to benefit from efficient algorithms dedicated to the extraction of condensed representations. More precisely, we demonstrate how it is possible to use the levelwise framework to improve the hypergraphminimal transversal computation by exploiting an anti-monotone constraint to safely prune the search space. We propose a new algorithm MTMINER to extract minimal transversals and provide experiments showing that our method is efficient in practice.