{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T13:11:46Z","timestamp":1771593106810,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T00:00:00Z","timestamp":1687219200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T00:00:00Z","timestamp":1687219200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Knowledge Graph Embedding (KGE) translates entities and relations of knowledge graphs (KGs) into a low-dimensional vector space, enabling an efficient way of predicting missing facts. Generally, KGE models are trained with positive and negative examples, discriminating positives against negatives. Nevertheless, KGs contain only positive facts; KGE training requires generating negatives from non-observed ones in KGs, referred to as negative sampling. Since KGE models are sensitive to inputs, negative sampling becomes crucial, and the quality of the negatives becomes critical in KGE training. Generative adversarial networks (GAN) and self-adversarial methods have recently been utilized in negative sampling to address the vanishing gradients observed with early negative sampling methods. However, they introduce the problem of false negatives with high probability. In this paper, we extend the idea of reducing false negatives by adopting a Tucker decomposition representation, i.e., TuckerDNCaching, to enhance the semantic soundness of latent relations among entities by introducing a relation feature space. TuckerDNCaching ensures the quality of generated negative samples, and the experimental results reflect that our proposed negative sampling method outperforms the existing state-of-the-art negative sampling methods.<\/jats:p>","DOI":"10.1007\/s10844-023-00796-y","type":"journal-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T12:02:43Z","timestamp":1687262563000},"page":"739-763","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["TuckerDNCaching: high-quality negative sampling with tucker decomposition"],"prefix":"10.1007","volume":"61","author":[{"given":"Tiroshan","family":"Madushanka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryutaro","family":"Ichise","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,20]]},"reference":[{"key":"796_CR1","doi-asserted-by":"publisher","unstructured":"Ahrabian, K., Feizi, A., Salehi, Y., et al (2020) Structure aware negative sampling in knowledge graphs. In: Proceedings of Conference on Empirical Methods in Natural Language Processing. ACL. pp 6093\u20136101. https:\/\/doi.org\/10.18653\/v1\/2020.emnlp-main.492","DOI":"10.18653\/v1\/2020.emnlp-main.492"},{"key":"796_CR2","doi-asserted-by":"publisher","unstructured":"Bollacker, K., Evans, C., Paritosh, P., et al (2008) Freebase: A collaboratively created graph database for structuring human knowledge. In: Proceedings of ACM SIGMOD International Conference on Management of Data. ACM SIGMOD \u201908. pp 1247\u20131250. https:\/\/doi.org\/10.1145\/1376616.1376746","DOI":"10.1145\/1376616.1376746"},{"key":"796_CR3","unstructured":"Bordes A., Usunier, N., Garcia-Dur\u00e1n, A., et al (2013) Translating embeddings for modeling multi-relational data. In: Proceedings of International Conference on Neural Information Processing Systems. Curran Associates Inc., NIPS\u2019 13. pp 2787\u20132795"},{"key":"796_CR4","unstructured":"Boschin, A., (2020) TorchKGE: Knowledge graph embedding in python and pytorch. CoRR abs\/2009.02963. 2009.02963"},{"key":"796_CR5","doi-asserted-by":"crossref","unstructured":"Cai, L., Wang, W.Y., (2018) KBGAN: Adversarial learning for knowledge graph embeddings. In: Proceedings of Conference of the North American Chapter of the Association for Computational Linguistics. ACL. pp 1470\u20131480. https:\/\/doi.org\/10.18653\/v1\/N18-1133","DOI":"10.18653\/v1\/N18-1133"},{"key":"796_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10844-018-0535-2","volume":"53","author":"G Chenchen","year":"2019","unstructured":"Chenchen, G., Chunhong, Z., Han, X., et al. (2019). AWML: adaptive weighted margin learning for knowledge graph embedding. Journal of Intelligent Information Systems, 53, 167\u2013197. https:\/\/doi.org\/10.1007\/s10844-018-0535-2","journal-title":"Journal of Intelligent Information Systems"},{"key":"796_CR7","doi-asserted-by":"crossref","unstructured":"Ebisu, T., Ichise, R., (2018) TorusE: Knowledge graph embedding on a lie group. In: Proceedings of AAAI Conference on Artificial Intelligence. pp 1819\u20131826","DOI":"10.1609\/aaai.v32i1.11538"},{"key":"796_CR8","unstructured":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., et\u00a0al (2014) Generative adversarial nets. In: Advances in Neural Information Processing Systems, vol\u00a027. Curran Associates Inc. pp 2672\u20132680"},{"key":"796_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/sapm192761164","volume":"6","author":"FL Hitchcock","year":"1927","unstructured":"Hitchcock, F. L. (1927). The expression of a tensor or a polyadic as a sum of products. Journal of Mathematics and Physics, 6, 164\u2013189.","journal-title":"Journal of Mathematics and Physics"},{"key":"796_CR10","doi-asserted-by":"publisher","unstructured":"Hu, K., Liu, H., Hao, T., (2019) A knowledge selective adversarial network for link prediction in knowledge graph. In: Proceedings of Conference on Natural Language Processing and Chinese Computing. Springer. pp 171\u2013183. https:\/\/doi.org\/10.1007\/978-3-030-32233-5_14","DOI":"10.1007\/978-3-030-32233-5_14"},{"key":"796_CR11","doi-asserted-by":"publisher","unstructured":"Ji, G., He, S., Xu, L., et\u00a0al (2015) Knowledge graph embedding via dynamic mapping matrix. In: Proceedings of International Joint Conference on Natural Language Processing. ACL. pp 687\u2013696. https:\/\/doi.org\/10.3115\/v1\/P15-1067","DOI":"10.3115\/v1\/P15-1067"},{"key":"796_CR12","doi-asserted-by":"publisher","unstructured":"Kanojia, V., Maeda, H., Togashi, R., et\u00a0al (2017) Enhancing knowledge graph embedding with probabilistic negative sampling. In: Proceedings of International Conference on World Wide Web Companion. WWW, WWW \u201917 Companion. pp 801\u2013802. https:\/\/doi.org\/10.1145\/3041021.3054238","DOI":"10.1145\/3041021.3054238"},{"key":"796_CR13","doi-asserted-by":"crossref","unstructured":"Krompa\u00df, D., Baier, S., Tresp, V., (2015) Type-constrained representation learning in knowledge graphs. In: TProceedings of International Workshop on the Semantic Web. Springer. pp 640\u2013655","DOI":"10.1007\/978-3-319-25007-6_37"},{"key":"796_CR14","doi-asserted-by":"publisher","first-page":"17637","DOI":"10.1007\/s00521-020-04940-5","volume":"32","author":"H Liu","year":"2020","unstructured":"Liu, H., Hu, K., Wang, F. L., et al. (2020). Aggregating neighborhood information for negative sampling for knowledge graph embedding. Neural Computing and Applications, 32, 17637\u201317653. https:\/\/doi.org\/10.1007\/s00521-020-04940-5","journal-title":"Neural Computing and Applications"},{"key":"796_CR15","doi-asserted-by":"publisher","unstructured":"Madushanka, T., Ichise, R., (2022) MDNCaching: A strategy to generate quality negatives for knowledge graph embedding. In: Proceedings of International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems. Springer. pp 877\u2013888. https:\/\/doi.org\/10.1007\/978-3-031-08530-7_74","DOI":"10.1007\/978-3-031-08530-7_74"},{"issue":"11","key":"796_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/219717.219748","volume":"38","author":"GA Miller","year":"1995","unstructured":"Miller, G. A. (1995). Wordnet: A lexical database for english. Communication of the ACM, 38(11), 39\u201341. https:\/\/doi.org\/10.1145\/219717.219748","journal-title":"Communication of the ACM"},{"key":"796_CR17","unstructured":"Nickel, M., Tresp, V., Kriegel, H.P., (2011) A three-way model for collective learning on multi-relational data. In: Proceedings of International Conference on Machine Learning. Omnipress, ICML\u201911. pp 809\u2013816"},{"key":"796_CR18","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10844-019-00592-7","volume":"55","author":"Z Siheng","year":"2020","unstructured":"Siheng, Z., Zhengya, S., & Wensheng, Z. (2020). Improve the translational distance models for knowledge graph embedding. Journal of Intelligent Information Systems, 55, 445\u2013467. https:\/\/doi.org\/10.1007\/s10844-019-00592-7","journal-title":"Journal of Intelligent Information Systems"},{"key":"796_CR19","unstructured":"Sun, Z., Deng, Z., Nie, J., et\u00a0al (2019) RotatE: Knowledge graph embedding by relational rotation in complex space. In: Proceedings of International Conference on Learning Representations"},{"key":"796_CR20","doi-asserted-by":"publisher","unstructured":"Toutanova, K., Chen, D., (2015) Observed versus latent features for knowledge base and text inference. In: Proceedings of Workshop on Continuous Vector Space Models and their Compositionality. ACL. pp 57\u201366. https:\/\/doi.org\/10.18653\/v1\/W15-4007","DOI":"10.18653\/v1\/W15-4007"},{"key":"796_CR21","unstructured":"Trouillon, T., Welbl J, Riedel S, et\u00a0al (2016) Complex embeddings for simple link prediction. In: Proceedings of International Conference on Machine Learning. JMLR.org, ICML\u201916. pp 2071\u20132080"},{"key":"796_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker, L. R. (1966). Some mathematical notes on three-mode factor analysis. Psychometrika, 31, 279\u2013311. https:\/\/doi.org\/10.1007\/BF02289464","journal-title":"Psychometrika"},{"key":"796_CR23","doi-asserted-by":"crossref","unstructured":"Wang, P., Li, S., Pan, R., (2018) Incorporating GAN for negative sampling in knowledge representation learning. In: Proceedings of AAAI Conference on Artificial Intelligence. AAAI Press, AAAI\u201918\/IAAI\u201918\/EAAI\u201918. pp 2005\u20132012","DOI":"10.1609\/aaai.v32i1.11536"},{"key":"796_CR24","doi-asserted-by":"publisher","unstructured":"Wang, Y., Ruffinelli, D., Gemulla, R., et\u00a0al (2019) On evaluating embedding models for knowledge base completion. In: Proceedings of Workshop on Representation Learning for NLP. ACL. pp 104\u2013112. https:\/\/doi.org\/10.18653\/v1\/W19-4313","DOI":"10.18653\/v1\/W19-4313"},{"key":"796_CR25","doi-asserted-by":"crossref","unstructured":"Wang, Z., Zhang, J., Feng, J., et\u00a0al (2014) Knowledge graph embedding by translating on hyperplanes. In: Proceedings of AAAI Conference on Artificial Intelligence. AAAI Press, AAAI\u201914. pp 1112\u20131119","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"796_CR26","doi-asserted-by":"publisher","unstructured":"Xie, Q., Ma, X., Dai, Z., et\u00a0al (2017) An interpretable knowledge transfer model for knowledge base completion. In: Proceedings of Annual Meeting of the Association for Computational Linguistics). ACL. pp 950\u2013962. https:\/\/doi.org\/10.18653\/v1\/P17-1088","DOI":"10.18653\/v1\/P17-1088"},{"key":"796_CR27","unstructured":"Yang, B., Yih, W., He, X., et\u00a0al (2015) Embedding entities and relations for learning and inference in knowledge bases. In: Proceedings of International Conference on Learning Representations"},{"key":"796_CR28","doi-asserted-by":"crossref","unstructured":"Yao, N., Liu, Q., Li, X., et\u00a0al (2022) Entity similarity-based negative sampling for knowledge graph embedding. In: Proceedings of Pacific Rim International Conference on Artificial Intelligence. Springer. pp 73\u201387","DOI":"10.1007\/978-3-031-20865-2_6"},{"key":"796_CR29","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yao, Q., Shao, Y., et\u00a0al (2019) NSCaching: Simple and efficient negative sampling for knowledge graph embedding. In: Proceedings of IEEE International Conference on Data Engineering. IEEE. pp 614\u2013625","DOI":"10.1109\/ICDE.2019.00061"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-023-00796-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10844-023-00796-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-023-00796-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T11:07:37Z","timestamp":1702724857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10844-023-00796-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,20]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["796"],"URL":"https:\/\/doi.org\/10.1007\/s10844-023-00796-y","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,20]]},"assertion":[{"value":"19 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"Not Applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}},{"value":"Not Applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}