{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T15:46:34Z","timestamp":1748447194444,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T00:00:00Z","timestamp":1669507200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T00:00:00Z","timestamp":1669507200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62036012,62072456"],"award-info":[{"award-number":["62036012,62072456"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Research Projects of Zhejiang Lab","award":["2021KE0AB05","62106262"],"award-info":[{"award-number":["2021KE0AB05","62106262"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Multimed Info Retr"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s13735-022-00256-3","type":"journal-article","created":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T21:09:14Z","timestamp":1669583354000},"page":"589-597","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["TCKGE: Transformers with contrastive learning for knowledge graph embedding"],"prefix":"10.1007","volume":"11","author":[{"given":"Xiaowei","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4190-1529","authenticated-orcid":false,"given":"Quan","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Shengsheng","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Changsheng","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,27]]},"reference":[{"issue":"2","key":"256_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.3233\/SW-140134","volume":"6","author":"J Lehmann","year":"2015","unstructured":"Lehmann J et al (2015) Dbpedia - a large-scale, multilingual knowledge base extracted from Wikipedia. Sem Web 6(2):167\u2013195. https:\/\/doi.org\/10.3233\/SW-140134","journal-title":"Sem Web"},{"key":"256_CR2","doi-asserted-by":"crossref","unstructured":"Bollacker KD, Evans C, Paritosh PK, Sturge T, Taylor J (2008) Freebase: a collaboratively created graph database for structuring human knowledge, pp 1247\u20131250 (ACM)","DOI":"10.1145\/1376616.1376746"},{"key":"256_CR3","doi-asserted-by":"crossref","unstructured":"Suchanek FM, Kasneci G, Weikum G (2007) Yago: a core of semantic knowledge, pp 697\u2013706 (ACM)","DOI":"10.1145\/1242572.1242667"},{"key":"256_CR4","unstructured":"IV, RL L, Liu NF, Peters ME, Gardner M, Singh S (2019) Barack\u2019s wife hillary: using knowledge graphs for fact-aware language modeling, pp 5962\u20135971 (association for computational linguistics)"},{"key":"256_CR5","doi-asserted-by":"crossref","unstructured":"Zhang Z et\u00a0al (2019) ERNIE: enhanced language representation with informative entities, pp 1441\u20131451 (association for computational linguistics)","DOI":"10.18653\/v1\/P19-1139"},{"key":"256_CR6","doi-asserted-by":"crossref","unstructured":"Hayashi H, Hu Z, Xiong C, Neubig G (2020) Latent relation language models, AAAI Press, pp 7911\u20137918","DOI":"10.1609\/aaai.v34i05.6298"},{"issue":"4","key":"256_CR7","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1109\/TMM.2019.2937181","volume":"22","author":"C Chaudhary","year":"2020","unstructured":"Chaudhary C, Goyal P, Prasad DN, Chen YP (2020) Enhancing the quality of image tagging using a visio-textual knowledge base. IEEE Trans Multim 22(4):897\u2013911. https:\/\/doi.org\/10.1109\/TMM.2019.2937181","journal-title":"IEEE Trans Multim"},{"issue":"8","key":"256_CR8","doi-asserted-by":"publisher","first-page":"2098","DOI":"10.1109\/TMM.2019.2951194","volume":"22","author":"F Xue","year":"2020","unstructured":"Xue F et al (2020) Knowledge-based topic model for multi-modal social event analysis. IEEE Trans Multim 22(8):2098\u20132110. https:\/\/doi.org\/10.1109\/TMM.2019.2951194","journal-title":"IEEE Trans Multim"},{"issue":"9","key":"256_CR9","doi-asserted-by":"publisher","first-page":"1562","DOI":"10.1109\/TMM.2015.2449660","volume":"17","author":"X Zhang","year":"2015","unstructured":"Zhang X et al (2015) Enhancing video event recognition using automatically constructed semantic-visual knowledge base. IEEE Trans Multim 17(9):1562\u20131575. https:\/\/doi.org\/10.1109\/TMM.2015.2449660","journal-title":"IEEE Trans Multim"},{"key":"256_CR10","unstructured":"Riedel S, Yao L, McCallum A, Marlin BM (2013) Relation extraction with matrix factorization and universal schemas, pp 74\u201384 (the association for computational linguistics)"},{"key":"256_CR11","doi-asserted-by":"crossref","unstructured":"Xiong W, Hoang T, Wang WY (2017) Deeppath: a reinforcement learning method for knowledge graph reasoning, pp 564\u2013573 (association for computational linguistics)","DOI":"10.18653\/v1\/D17-1060"},{"key":"256_CR12","doi-asserted-by":"crossref","unstructured":"Verga P, Sun H, Soares LB, Cohen WW (2020) Facts as experts: adaptable and interpretable neural memory over symbolic knowledge. CoRR . arXiv:2007.00849","DOI":"10.18653\/v1\/2021.naacl-main.288"},{"issue":"1","key":"256_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/JPROC.2015.2483592","volume":"104","author":"M Nickel","year":"2016","unstructured":"Nickel M, Murphy K, Tresp V, Gabrilovich E (2016) A review of relational machine learning for knowledge graphs. Proc IEEE 104(1):11\u201333. https:\/\/doi.org\/10.1109\/JPROC.2015.2483592","journal-title":"Proc IEEE"},{"issue":"12","key":"256_CR14","doi-asserted-by":"publisher","first-page":"2724","DOI":"10.1109\/TKDE.2017.2754499","volume":"29","author":"Q Wang","year":"2017","unstructured":"Wang Q, Mao Z, Wang B, Guo L (2017) Knowledge graph embedding: a survey of approaches and applications. IEEE Trans Knowl Data Eng 29(12):2724\u20132743. https:\/\/doi.org\/10.1109\/TKDE.2017.2754499","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"256_CR15","unstructured":"Weston J, Bordes A, Yakhnenko O, Usunier N (2013) Connecting language and knowledge bases with embedding models for relation extraction, pp 1366\u20131371 (ACL). https:\/\/aclanthology.org\/D13-1136\/"},{"key":"256_CR16","doi-asserted-by":"crossref","unstructured":"Bordes A, Chopra S, Weston J (2014) Question answering with subgraph embeddings, pp 615\u2013620 (ACL)","DOI":"10.3115\/v1\/D14-1067"},{"issue":"4","key":"256_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1561\/1500000063","volume":"14","author":"R Reinanda","year":"2020","unstructured":"Reinanda R, Meij E, de Rijke M (2020) Knowledge graphs: an information retrieval perspective. Found Trends Inf Retr 14(4):289\u2013444. https:\/\/doi.org\/10.1561\/1500000063","journal-title":"Found Trends Inf Retr"},{"issue":"8","key":"256_CR18","doi-asserted-by":"publisher","first-page":"3549","DOI":"10.1109\/TKDE.2020.3028705","volume":"34","author":"Q Guo","year":"2022","unstructured":"Guo Q et al (2022) A survey on knowledge graph-based recommender systems. IEEE Trans Knowl Data Eng 34(8):3549\u20133568. https:\/\/doi.org\/10.1109\/TKDE.2020.3028705","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"256_CR19","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1109\/TNNLS.2021.3070843","volume":"33","author":"S Ji","year":"2022","unstructured":"Ji S, Pan S, Cambria E, Marttinen P, Yu PS (2022) A survey on knowledge graphs: representation, acquisition, and applications. IEEE Trans Neural Netw Learn Syst 33(2):494\u2013514. https:\/\/doi.org\/10.1109\/TNNLS.2021.3070843","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"256_CR20","unstructured":"Bordes A, Usunier N, Garc\u00eda-Dur\u00e1n A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data, pp 2787\u20132795"},{"key":"256_CR21","unstructured":"Yang B, Yih W, He X, Gao J, Deng L (2015) Embedding entities and relations for learning and inference in knowledge bases"},{"key":"256_CR22","unstructured":"Sun Z, Deng Z, Nie J, Tang J (2019) Rotate: knowledge graph embedding by relational rotation in complex space (OpenReview.net)"},{"key":"256_CR23","doi-asserted-by":"crossref","unstructured":"Schlichtkrull MS (2018) et\u00a0al. Modeling relational data with graph convolutional networks, vol 10843. Springer, pp 593\u2013607","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"256_CR24","unstructured":"Vashishth S, Sanyal S, Nitin V, Talukdar PP (2020) Composition-based multi-relational graph convolutional networks (OpenReview.net)"},{"key":"256_CR25","doi-asserted-by":"crossref","unstructured":"Dettmers T, Minervini P, Stenetorp P, Riedel S (2018) Convolutional 2d knowledge graph embeddings. AAAI Press, pp 1811\u20131818","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"256_CR26","unstructured":"Chen T, Kornblith S, Norouzi M, Hinton GE (2020) A simple framework for contrastive learning of visual representations, vol 119, pp 1597\u20131607 (PMLR)"},{"key":"256_CR27","doi-asserted-by":"crossref","unstructured":"Yan Y et\u00a0al (2021) Consert: a contrastive framework for self-supervised sentence representation transfer, pp 5065\u20135075 (association for computational linguistics)","DOI":"10.18653\/v1\/2021.acl-long.393"},{"key":"256_CR28","unstructured":"You Y et\u00a0al (2020) Graph contrastive learning with augmentations"},{"key":"256_CR29","unstructured":"Wang Q et\u00a0al (2019) Coke: contextualized knowledge graph embedding. CoRR . arXiv:1911.02168"},{"key":"256_CR30","doi-asserted-by":"crossref","unstructured":"Chen S et\u00a0al (2021) Hitter: Hierarchical transformers for knowledge graph embeddings, pp 10395\u201310407 (association for computational linguistics)","DOI":"10.18653\/v1\/2021.emnlp-main.812"},{"key":"256_CR31","doi-asserted-by":"crossref","unstructured":"Wang Z, Zhang J, Feng J, Chen Z (2014) Knowledge graph embedding by translating on hyperplanes. AAAI Press, pp 1112\u20131119","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"256_CR32","doi-asserted-by":"crossref","unstructured":"Lin Y, Liu Z, Sun M, Liu Y, Zhu X (2015) Learning entity and relation embeddings for knowledge graph completion. AAAI Press, pp 2181\u20132187","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"256_CR33","doi-asserted-by":"crossref","unstructured":"Ji G, He S, Xu L, Liu K, Zhao J (2015) Knowledge graph embedding via dynamic mapping matrix, pp 687\u2013696 (the association for computer linguistics)","DOI":"10.3115\/v1\/P15-1067"},{"key":"256_CR34","doi-asserted-by":"crossref","unstructured":"Jia Y, Wang Y, Lin H, Jin X, Cheng X (2016) Locally adaptive translation for knowledge graph embedding. AAAI Press, pp 992\u2013998","DOI":"10.1609\/aaai.v30i1.10091"},{"key":"256_CR35","doi-asserted-by":"crossref","unstructured":"Xiao H, Huang M, Hao Y, Zhu X (2015) Transg : a generative mixture model for knowledge graph embedding. CoRR. arXiv:1509.05488","DOI":"10.18653\/v1\/P16-1219"},{"key":"256_CR36","unstructured":"Trouillon T, Welbl J, Riedel S, Gaussier \u00c9, Bouchard G (2016) Complex embeddings for simple link prediction, vol\u00a048, pp 2071\u20132080 (JMLR.org)"},{"key":"256_CR37","unstructured":"Liu H, Wu Y, Yang Y (2017) Analogical inference for multi-relational embeddings, vol\u00a070, pp 2168\u20132178 (PMLR)"},{"key":"256_CR38","unstructured":"Kazemi SM, Poole D (2018) Simple embedding for link prediction in knowledge graphs, pp 4289\u20134300"},{"key":"256_CR39","doi-asserted-by":"crossref","unstructured":"Balazevic I, Allen C, Hospedales TM (2019) Tucker: tensor factorization for knowledge graph completion, pp 5184\u20135193 (association for computational linguistics)","DOI":"10.18653\/v1\/D19-1522"},{"key":"256_CR40","doi-asserted-by":"crossref","unstructured":"Chami I et\u00a0al (2020) Low-dimensional hyperbolic knowledge graph embeddings, pp 6901\u20136914 (association for computational linguistics)","DOI":"10.18653\/v1\/2020.acl-main.617"},{"key":"256_CR41","unstructured":"Nickel M, Tresp V, Kriegel H (2011) A three-way model for collective learning on multi-relational data, pp 809\u2013816 (Omnipress)"},{"key":"256_CR42","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks (OpenReview.net)"},{"key":"256_CR43","unstructured":"Zhu Y et\u00a0al (2021) Graph contrastive learning with adaptive augmentation, pp 2069\u20132080 (ACM\/IW3C2)"},{"key":"256_CR44","unstructured":"Hassani K, Ahmadi A HK (2020) Contrastive multi-view representation learning on graphs, vol 119, pp 4116\u20134126 (PMLR)"},{"key":"256_CR45","unstructured":"Zhang R, Lu C, Jiao Z, Li X (2021) Deep contrastive graph representation via adaptive homotopy learning. CoRR. arXiv:2106.09244"},{"key":"256_CR46","unstructured":"Velickovic P et\u00a0al (2018) Deep graph infomax. CoRR. arXiv:1809.10341"},{"key":"256_CR47","unstructured":"Sun F, Hoffmann J, Verma V, Tang J (2020) Infograph: unsupervised and semi-supervised graph-level representation learning via mutual information maximization (OpenReview.net)"},{"key":"256_CR48","doi-asserted-by":"crossref","unstructured":"Wan S, Pan S, Yang J, Gong C (2021) Contrastive and generative graph convolutional networks for graph-based semi-supervised learning, AAAI Press, pp 10049\u201310057","DOI":"10.1609\/aaai.v35i11.17206"},{"key":"256_CR49","unstructured":"Devlin J, Chang M, Lee K, Toutanova K (2019) BERT: pre-training of deep bidirectional transformers for language understanding, pp 4171\u20134186 (association for computational linguistics)"},{"key":"256_CR50","unstructured":"van\u00a0den Oord A, Li Y, Vinyals O (2018) Representation learning with contrastive predictive coding. CoRR. arXiv:1807.03748"},{"key":"256_CR51","doi-asserted-by":"crossref","unstructured":"Toutanova K, Chen D (2015) Observed versus latent features for knowledge base and text inference. Association for Computational Linguistics, Beijing, China, pp 57\u201366","DOI":"10.18653\/v1\/W15-4007"},{"issue":"11","key":"256_CR52","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/219717.219748","volume":"38","author":"GA Miller","year":"1995","unstructured":"Miller GA (1995) Wordnet: a lexical database for English. Commun ACM 38(11):39\u201341. https:\/\/doi.org\/10.1145\/219717.219748","journal-title":"Commun ACM"},{"key":"256_CR53","doi-asserted-by":"crossref","unstructured":"Broscheit S, Ruffinelli D, Kochsiek A, Betz P, Gemulla R (2020) Libkge - a knowledge graph embedding library for reproducible research, pp 165\u2013174 (association for computational linguistics)","DOI":"10.18653\/v1\/2020.emnlp-demos.22"},{"key":"256_CR54","unstructured":"Vaswani A et\u00a0al (2017) Attention is all you need, pp 5998\u20136008"},{"key":"256_CR55","unstructured":"Kingma DP, Ba J (2015) A method for stochastic optimization, Adam"}],"container-title":["International Journal of Multimedia Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13735-022-00256-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13735-022-00256-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13735-022-00256-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T14:28:05Z","timestamp":1671287285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13735-022-00256-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,27]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["256"],"URL":"https:\/\/doi.org\/10.1007\/s13735-022-00256-3","relation":{},"ISSN":["2192-6611","2192-662X"],"issn-type":[{"type":"print","value":"2192-6611"},{"type":"electronic","value":"2192-662X"}],"subject":[],"published":{"date-parts":[[2022,11,27]]},"assertion":[{"value":"22 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2022","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}