{'fraction_non_alphanumeric': 0.014, 'fraction_numerical': 0.0, 'mean_word_length': 5.763513513513513, '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}}
Performance analysis of stacked generalization classifiers

Stacked generalization is a classification technique which aims to increase the performance of individual classifiers by combining them under a hierarchical architecture. In many applications, this technique, performs better than other classification schemas under some circumstances. However, in some applications, the performance of the technique goes astray, for the reasons that are not well-known. Even though it is used in several application domains up to now, it is not clear under which circumstances stacked generalization technique increases the performance. In this work, the states of the performance of stacked generalization technique is analyzed in terms of the performance parameters of the individual classifiers under the architecture. This work shows that the individual classifiers should learn the training set sharing the members of the set among themselves for the success of the stacked generalization architecture.