{'fraction_non_alphanumeric': 0.022564102564102566, 'fraction_numerical': 0.003076923076923077, 'mean_word_length': 5.684931506849315, '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}}
Towards an improvement of variable interaction identification for large-scale constrained problems

In this work, three modifications are proposed to improve the performance of the Variable Interaction Identification for Constrained problems (VIIC), a technique to detect interacting variables in large scale constrained numerical optimization problems. The changes proposed are: (1) the optimization of a single variable arrangement (the original VIIC needs to find an arrangement of variables for the objective function and also for each constraint), (2) two new strategies to generate a new arrangement, instead of the random generator of the original VIIC, and (3) simulated annealing as an optimizer instead of the greedy search adopted in the original VIIC. The results indicate the viability of using just one variable arrangement and the good performance provided by the two proposed strategies in the search, particularly combined with VIIC's original greedy search.