{'fraction_non_alphanumeric': 0.020937188434695914, 'fraction_numerical': 0.01296111665004985, 'mean_word_length': 5.783783783783784, '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}}
Constrained overlapping clusters: minimizing the negative effects of bridge‐nodes

This paper presents a new approach to form overlapping clusters of objects by balancing the effects of incompleteness, impurity, and overlap. Incompleteness results from similar objects separated into different clusters while impurity arises when a cluster contains dissimilar objects. Overlap is caused by nodes that appear in more than one cluster. The key to balancing these effects is the identification of bridge‐nodes. We show the limitations of traditional clustering algorithms in handling bridge‐nodes and demonstrate the intractability of minimizing all three effects. Approximation algorithms based on graph mincut and genetic algorithm are proposed to minimize these effects. Our results with real data sets show significant improvement over traditional methods with regard to incompleteness, impurity, and overlap. Copyright © 2009 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 3: 20‐37, 2010