{'fraction_non_alphanumeric': 0.020486555697823303, 'fraction_numerical': 0.0, 'mean_word_length': 5.306451612903226, '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}}
Tensor decomposition model for link prediction in multi-relational networks

Many real-world datasets can be considered as a linked collection of objects with multi-type relations, where each type of relations may play a distinct role. In this paper, we address the problem of link prediction in such multi-relational networks. While traditional link prediction methods are limited to single-type link prediction we attempt here to capture the correlations among the different relation types. For that, we use tensor formalization and formulate the link pattern prediction task as a tensor decomposition model which is solved by quasi-Newton optimization method. Extensive experiments on real-world multi-relational datasets demonstrate the accuracy and effectiveness of our model.