{'fraction_non_alphanumeric': 0.015977443609022556, 'fraction_numerical': 0.0018796992481203006, 'mean_word_length': 4.98314606741573, '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}}
A New Boosting Algorithm for Classification on Distributed Databases

In this paper, we propose a new boosting algorithm for distributed databases. The main idea of the proposed method is to utilize the parallelism of the distributed databases to build an ensemble of classifiers. At each round of the algorithm, each site processes its own data locally, and calculates all needed information. A center site will collect information from all sites and build the global classifier, which is then a classifier in the ensemble. This global classifier is also used by each distributed site to compute required information for the next round. By repeating this process, an ensemble of classifiers, which is almost identical to the one built on the whole data, will be produced from the distributed databases. The experiments were performed on 5 different datasets from the UCI repository [9]. The experimental results show that the accuracy of the proposed algorithm is almost equal to or higher than the accuracy when applying boosting algorithm to the whole database.