{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T10:47:23Z","timestamp":1782125243239,"version":"3.54.5"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["18K11457"],"award-info":[{"award-number":["18K11457"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19H04173"],"award-info":[{"award-number":["19H04173"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tkde.2021.3075070","type":"journal-article","created":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T20:37:10Z","timestamp":1619123830000},"page":"1-1","source":"Crossref","is-referenced-by-count":12,"title":["Binarized Embeddings for Fast, Space-Efficient Knowledge Graph Completion"],"prefix":"10.1109","author":[{"given":"Katsuhiko","family":"Hayashi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Koki","family":"Kishimoto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Masashi","family":"Shimbo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Logistic tensor factorization for multi-relational data","author":"nickel","year":"0"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W17-2609"},{"key":"ref33","article-title":"DoReFa-Net: Training low bitwidth convolutional neural networks with low bitwidth gradients","author":"zhou","year":"2016"},{"key":"ref32","article-title":"A survey on methods and theories of quantized neural networks","author":"guo","year":"2018"},{"key":"ref31","first-page":"3123","article-title":"BinaryConnect: Training deep neural networks with binary weights during propagations","author":"courbariaux","year":"2015","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013060"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.28"},{"key":"ref35","article-title":"Word2bits - quantized word vectors","author":"lam","year":"2018"},{"key":"ref34","first-page":"1","article-title":"ProxQuant: Quantized neural networks via proximal operators","author":"bai","year":"2019","journal-title":"Proc 7th Int Conf Learn Representations"},{"key":"ref10","first-page":"2071","article-title":"Complex embeddings for simple link prediction","author":"trouillon","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"ref40","article-title":"Estimating or propagating gradients through stochastic neurons for conditional computation","author":"bengio","year":"2013"},{"key":"ref12","first-page":"4289","article-title":"Simple embedding for link prediction in knowledge graphs","author":"kazemi","year":"2018","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref13","first-page":"2869","article-title":"Canonical tensor decomposition for knowledge base completion","author":"lacroix","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/sapm192761164"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11738"},{"key":"ref16","first-page":"1","article-title":"Embedding entities and relations for learning and inference in knowledge bases","author":"yang","year":"2015","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-2088"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10314"},{"key":"ref19","first-page":"2168","article-title":"Analogical inference for multi-relational embeddings","author":"liu","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1067"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376746"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N16-1054"},{"key":"ref6","first-page":"14","article-title":"An empirical comparison of knowledge graph embeddings for item recommendation","author":"palumbo","year":"2018","journal-title":"Proc 1st Workshop Deep Learn Knowl Graphs Semantic Technol"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178992"},{"key":"ref29","first-page":"553","article-title":"Hypernetwork knowledge graph embeddings","author":"balazevic","year":"2019","journal-title":"Proc Int Conf Artif Neural Netw"},{"key":"ref8","first-page":"809","article-title":"A three-way model for collective learning on multi-relational data","author":"nickel","year":"2011","journal-title":"Proc 28th Int Conf Mach Learn"},{"key":"ref7","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","author":"bordes","year":"2013","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"key":"ref9","first-page":"926","article-title":"Reasoning with neural tensor networks for knowledge base completion","author":"socher","year":"2013","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-15712-8_12"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11616"},{"key":"ref46","first-page":"381","article-title":"Learning systems of concepts with an infinite relational model","author":"kemp","year":"2006","journal-title":"Proc 21st Nat Conf Artif Intell"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187874"},{"key":"ref22","first-page":"2731","article-title":"Quaternion knowledge graph embeddings","author":"zhang","year":"2019","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref21","first-page":"1655","article-title":"Exclusive feature learning on arbitrary structures via $\\ell _{1,2}$?1,2-norm","author":"kong","year":"2014","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.77"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1026"},{"key":"ref42","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","author":"glorot","year":"2010","journal-title":"Proc 13th Int Conf Artif Intell Statist"},{"key":"ref23","article-title":"RotatE: Knowledge graph embedding by relational rotation in complex space","author":"sun","year":"2019","journal-title":"Proc 7th Int Conf Learn Representations"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2483592"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113355"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1522"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46493-0_32"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09411687.pdf?arnumber=9411687","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T15:27:03Z","timestamp":1670513223000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9411687\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/tkde.2021.3075070","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}