{'fraction_non_alphanumeric': 0.022794846382556987, 'fraction_numerical': 0.015857284440039643, 'mean_word_length': 5.9655172413793105, '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}}
Distributed Decision‐Tree Induction in Peer‐to‐Peer Systems

This paper offers a scalable and robust distributed algorithm for decision‐tree induction in large peer‐to‐peer (P2P) environments. Computing a decision tree in such large distributed systems using standard centralized algorithms can be very communication‐expensive and impractical because of the synchronization requirements. The problem becomes even more challenging in the distributed stream monitoring scenario where the decision tree needs to be updated in response to changes in the data distribution. This paper presents an alternate solution that works in a completely asynchronous manner in distributed environments and offers low communication overhead, a necessity for scalability. It also seamlessly handles changes in data and peer failures. The paper presents extensive experimental results to corroborate the theoretical claims. Copyright © 2008 Wiley Periodicals, Inc., A Wiley Company Statistical Analy Data Mining 1: 000‐000, 2008