{'fraction_non_alphanumeric': 0.015258215962441314, 'fraction_numerical': 0.0, 'mean_word_length': 5.413533834586466, '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}}
Finding Compact Classification Rules With Parsimonious Gene Expression Programming

Gene expression programming (GEP) is a new evolutionary computation technique. Its fixed-length representation spares it from the problem of bloat, which is a serious problem of GP. Recent work has shown that GEP can discover accurate and understandable classification rules in the form of mathematical expressions. But some of the rules are still too large than necessary because of the existence of useless parts in genes. Basic GEP classifiers don't have the ability to remove the useless parts from the classification rules. This paper presents a new fitness function incorporating a parsimonious term to evolve more compact rules with parsimonious gene expression programming (PGEP). Results show that PGEP can find more parsimonious rules without losing accuracy