{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T02:41:37Z","timestamp":1755830497057,"version":"3.44.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.23919\/iconac.2019.8895214","type":"proceedings-article","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T04:06:29Z","timestamp":1573617989000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["A calculation cost reduction method for a log-likelihood maximization in word2vec"],"prefix":"10.23919","author":[{"given":"Sakuya","family":"Nakamura","sequence":"first","affiliation":[{"name":"Shibaura Institute of Technology,Electrical Engineering and Computer Science Course,Tokyo,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaomi","family":"Kimura","sequence":"additional","affiliation":[{"name":"Shibaura Institute of Technology,Electrical Engineering and Computer Science Course,Tokyo,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Skip-Thought Vectors","year":"2015","author":"kiros","key":"ref10"},{"article-title":"Compressing Word Embeddings via Deep Compositional Code Learning","year":"2017","author":"shu","key":"ref11"},{"article-title":"Word2Bits - Quantized Word Vectors","year":"2018","author":"lam","key":"ref12"},{"article-title":"Advances in Pre-Training Distributed Word Representations","year":"2017","author":"mikolov","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3146347.3146354"},{"key":"ref15","first-page":"55","article-title":"Noise-Contrastive Estimation of Unnormalized Statistical Models, with Applications to Natural Image Statistics","author":"gutmann","year":"2012","journal-title":"The Journal of Machine Learning Research"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P14-1129"},{"key":"ref17","article-title":"Blackout: Speeding up recurrent neural network language models with very large vocabularies","author":"ji","year":"2016","journal-title":"Proc of ICLR"},{"key":"ref18","first-page":"9","article-title":"Learning word embeddings efficiently with noise-contrastive estimation","author":"mnih","year":"2013","journal-title":"In NIPS"},{"article-title":"A fast and simple algorithm for training neural probabilistic language models","year":"2012","author":"mnih","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/00437956.1954.11659520"},{"key":"ref3","first-page":"3111","article-title":"Distributed Representations of Words and Phrases and their Compositionality","author":"mikolov","year":"2013","journal-title":"NIPS"},{"article-title":"Enriching Word Vectors with Subword Information","year":"2016","author":"bojanowski","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2016.7738886"},{"article-title":"Distributed Representations of Sentences and Documents","year":"2014","author":"le","key":"ref7"},{"key":"ref2","first-page":"746","article-title":"Linguistic Regularities in Continuous SpaceWord Representations","author":"mikolov","year":"2013","journal-title":"Proceedings of NAACL-HLT"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"article-title":"Efficient estimation of word representations in vector space","year":"2013","author":"mikolov","key":"ref1"},{"article-title":"word2vec Parameter Learning Explained","year":"2014","author":"rong","key":"ref20"},{"article-title":"word2vec Explained: deriving Mikolov’s negative-sampling word-embedding method","year":"2014","author":"goldberg","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00106"}],"event":{"name":"2019 25th International Conference on Automation and Computing (ICAC)","start":{"date-parts":[[2019,9,5]]},"location":"Lancaster, UK","end":{"date-parts":[[2019,9,7]]}},"container-title":["2019 25th International Conference on Automation and Computing (ICAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8891805\/8894921\/08895214.pdf?arnumber=8895214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:21:04Z","timestamp":1755800464000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8895214\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":22,"URL":"https:\/\/doi.org\/10.23919\/iconac.2019.8895214","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}