{'fraction_non_alphanumeric': 0.01624815361890694, 'fraction_numerical': 0.0, 'mean_word_length': 5.277777777777778, '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}}
Bayesian nonparametric relational learning with the broken tree process

Recently, an increase in the availability and importance of relational datasets-such as social network data or protein interaction data-has lead to increased interest in modelling and learning from such data. Such data are often modelled as exchangeable arrays, yielding a particular representation due to Aldous and Hoover. We present a Bayesian nonparametric model based on this representation, which uses a novel process to generate a partition of the data. We present a Reversible Jump MCMC algorithm for inference in this model, and demonstrate the effectiveness of this approach on real-world data.