Abstract
Knowledge graph completion (KGC) involves inferring unknown triples from known ones to improve the completeness and richness of information and semantics in knowledge graphs (KG). Most existing KGC works are dominated by the embedding method, but it fails to explain the predicted triples. Rule mining methods can achieve this, but it is challenging to mine rules from a large KG under the open-world assumption. Although several mining methods have already addressed this issue, those based on search lack the ability to learn during the search process, which leads to the generation of ineffective rules. In this paper, answer set programming is used to convert search-failed rules into constraints to avoid rule specializations. Through constraint learning, the search process is continuously improved to optimize mining. Additionally, this paper utilizes the embedding method to pre-enhance KG and introduces a comprehensive evaluation approach to tackle the weak generalization of the rule mining method. Extensive experiments show that the proposed method achieves the best accuracy and efficiency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Balažević, I., Allen, C., Hospedales, T.M.: Tucker: Tensor factorization for knowledge graph completion. arXiv preprint arXiv:1901.09590 (2019)
Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: Advances in Neural Information Processing Systems, vol. 26 (2013)
Cropper, A., Dumančić, S.: Inductive logic programming at 30: a new introduction. J. Artif. Intell. Res. 74, 765–850 (2022)
Cropper, A., Morel, R.: Learning programs by learning from failures. Mach. Learn. 110, 801–856 (2021)
Dettmers, T., Minervini, P., Stenetorp, P., Riedel, S.: Convolutional 2D knowledge graph embeddings. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32 (2018)
Galárraga, L., Teflioudi, C., Hose, K., Suchanek, F.M.: Fast rule mining in ontological knowledge bases with AMIE+. VLDB J. 24(6), 707–730 (2015)
Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot asp solving with Clingo. Theory Pract. Logic Program. 19(1), 27–82 (2019)
Gu, Z., Chen, H.: Knowledge graph representation learning based on automatic network search for link prediction. CMES-Comput. Model. Eng. Sci. 135(3) (2023)
Gupta, G., Pontelli, E., Ali, K.A., Carlsson, M., Hermenegildo, M.V.: Parallel execution of prolog programs: a survey. ACM Trans. Programm. Lang. Syst. (TOPLAS) 23(4), 472–602 (2001)
Kazemi, S.M., Poole, D.: Simple embedding for link prediction in knowledge graphs. In: Advances in Neural Information Processing Systems, vol. 31 (2018)
Liang, S., Shao, J., Zhang, D., Zhang, J., Cui, B.: DRGI: deep relational graph infomax for knowledge graph completion. IEEE Transactions on Knowledge and Data Engineering (2021)
Meilicke, C., Chekol, M.W., Ruffinelli, D., Stuckenschmidt, H.: Anytime bottom-up rule learning for knowledge graph completion. In: IJCAI, pp. 3137–3143 (2019)
Rocktäschel, T., Riedel, S.: End-to-end differentiable proving. In: Advances in Neural Information Processing Systems, vol. 30 (2017)
Schlichtkrull, M., Kipf, T.N., Bloem, P., van den Berg, R., Titov, I., Welling, M.: Modeling relational data with graph convolutional networks. In: Gangemi, A., et al. (eds.) ESWC 2018. LNCS, vol. 10843, pp. 593–607. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-93417-4_38
Toutanova, K., Chen, D.: Observed versus latent features for knowledge base and text inference. In: Proceedings of the 3rd Workshop on Continuous Vector Space Models and their Compositionality, pp. 57–66 (2015)
Vashishth, S., Sanyal, S., Nitin, V., Agrawal, N., Talukdar, P.: Interacte: improving convolution-based knowledge graph embeddings by increasing feature interactions. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 3009–3016 (2020)
Xu, Z., Ye, P., Li, J., Chen, H., Zhang, W.: Differentiable learning of rules with constants in knowledge graph. Knowl.-Based Syst. 275, 110686 (2023)
Yang, F., Yang, Z., Cohen, W.W.: Differentiable learning of logical rules for knowledge base reasoning. In: Advances in Neural Information Processing Systems, vol. 30 (2017)
Zhang, C., Hsu, C.N., Katsis, Y., Kim, H.C., Vázquez-Baeza, Y.: Theoretical rule-based knowledge graph reasoning by connectivity dependency discovery. In: 2022 International Joint Conference on Neural Networks (IJCNN), pp. 1–9. IEEE (2022)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Cai, K., Wang, X., Luo, X. (2024). Optimize Rule Mining Based on Constraint Learning in Knowledge Graph. In: Cao, C., Chen, H., Zhao, L., Arshad, J., Asyhari, T., Wang, Y. (eds) Knowledge Science, Engineering and Management. KSEM 2024. Lecture Notes in Computer Science(), vol 14886. Springer, Singapore. https://doi.org/10.1007/978-981-97-5498-4_7
Download citation
DOI: https://doi.org/10.1007/978-981-97-5498-4_7
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-5497-7
Online ISBN: 978-981-97-5498-4
eBook Packages: Computer ScienceComputer Science (R0)