Abstract
Knowledge graph completion is an advanced artificial intelligence (AI) methodology that enables the systematic organization and structuring of data. It can significantly enhance the digital economy by facilitating more accurate and appropriate decision-making processes. Logical rule algorithms, known for their interpretability, have attracted significant attention in the field of explainable artificial intelligence. To harness the interpretability benefits of logical rules, we propose a cross-level position constraint template based on Graph Path Feature Learning (GPFL) and introduce an optimized termination policy for rule generation. To improve prediction performance, we focus significant emphasis on the rule evaluation stage, specifically on how to effectively learn the rules. To this end, we propose a Multi-Dimensional Graph Rule Learning (MDGRL) that calculates features from different dimensions to represent the reasoning ability of the rule. Feature I presents metrics for assessing the similarity into rule’s structure. Feature II proposes calculating the path transfer probability to represent the rule reasoning ability from the path reasoning perspective. Moreover, Feature III incorporates embedding distance with the constraint template to represent the rule reasoning ability in a low-dimensional vector space. Lastly, we assign weights to different dimensional features based on their performance and integrate them into MDGRL. Our experiments demonstrate effectiveness across various datasets, showcasing time-saving benefits in rule generation and improved prediction performance in rule evaluation. The source code and dataset for the MDGRL algorithm are available at https://github.com/csjywu1/MDGRL.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have