{'fraction_non_alphanumeric': 0.023479188900747065, 'fraction_numerical': 0.0010672358591248667, 'mean_word_length': 5.090909090909091, '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}}
An Analytical Solution to Dujmovic's Iterative OWA

Iterative OWA (ItOWA) as proposed by Dujmovic, is a two-stage procedure for computing the weighting vector by a double nested iteration: (i) weights at step h are computed as limit to infinity of a matrix power, (ii) the result is used to start the computation at step h + 1, until the OWA operator arity n is reached. Thereafter Dujmovic suggested a computational solution based on the conjecture that the limit exists, and numerical simulations have being supported the hypothesis that the conjecture is correct. In this paper, we prove that the limit actually exists and we provide an analytical solution to the procedure, so the weighting vector can be computed directly instead of an iterative time-consuming procedure. This theoretical result enables a faster computation of the weighting vector and characterization in terms of weights values, attitudinal character and entropy.