{'fraction_non_alphanumeric': 0.020080321285140562, 'fraction_numerical': 0.0, 'mean_word_length': 5.528384279475983, '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}}
Taguchi's T-method with nearest integer-based binary bat algorithm for prediction

Taguchi’s T-method is a new prediction technique under the Mahalanobis-Taguchi system to predict unknown output or future states based on available historical information. Conventionally, in optimizing the T-method prediction accuracy, Taguchi’s orthogonal array is utilized to determine a subset of significant features to be used in formulating the optimal prediction model. This, however, resulted in a sub-optimal prediction accuracy due to its fixed and limited feature combination offered for evaluation and lack of higher-order feature interaction. In this paper, a swarm-based binary bat optimization algorithm with a nearest integer discretization approach is integrated with the Taguchi’s T-method. A comparative study is conducted by comparing the performance of the proposed method against the conventional approach using mean absolute error as the performance measure on four benchmark case studies. The results from experimental studies show a significant improvement in the T-method prediction accuracy. A reduction in the total number of features results in a less complex model. Based on the general observation, the nearest integer-based binary bat algorithm successfully optimized the selection of significant features due to recursive and repetitive searchability, in addition to its adaptive element in response to the current best solution in guiding the search process towards optimality.