{'fraction_non_alphanumeric': 0.020395156150414276, 'fraction_numerical': 0.0, 'mean_word_length': 5.3562753036437245, '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}}
PRRL: Path Rotation based Knowledge Graph Representation Learning method

Knowledge graph (KG) representation learning aims at embedding triples in the form of vectors. Their semantic similarity can be expressed through the distance of those vectors, and thus easily be computed for further application, such as knowledge completion. Early KG embedding methods, such as the TransE model, were mainly training with relationship of each individual triple, and ignore the relationships between multiple triples. Thus their representation result is subject to the integrity of the triples. Recently, some path-enhanced methods, such as PTransE and RPJE, adopt the path information composed of multiple triples as supplement relation information for training, which achieves better effect than those triples based methods. On the other hand, the performance of path-enhanced methods is still affected by the fact that they are hard to learn the symmetric relation pattern in both triples and paths. Thus we propose Path Rotation based KG Representation Learning method (PRRL), which maps entities and relations into complex vector space and defines both relations and paths (composed by sequence of relations) as a rotation from source entity to target entity. PRRL can model and infer a variety of relation patterns, including symmetry/antisymmetry, inversion and composition relations by representing the path with Hadamard product of relations. The results of experiment on multiple datasets show that PRRL is better than the baseline in the completion of the task of KG.