{'fraction_non_alphanumeric': 0.0193756727664155, 'fraction_numerical': 0.0, 'mean_word_length': 5.788321167883212, '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}}
From continuous to Multiple-valued data

In modern science, significant advances are typically made at cross-roads of disciplines. Thus, many optimization problems in Multiple-valued Logic Design have been successfully approached using ideas and techniques from Artificial Intelligence. In particular, improvements in multiple-valued logic design have been made by utilizing information/uncertainty measures. In this respect, the paper addresses the problem known as discretization and introduces a method of finding an optimal representation of continuous data in the multiple-valued domain. The paper introduces new information density measures and an optimization criterion. We propose an algorithm that incorporates new measures and is applied to both unsupervised and supervised discretization. The experimental results on continuous-valued benchmarks are given to demonstrate the efficiency and robustness of the algorithm.