{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T14:40:16Z","timestamp":1776523216853,"version":"3.51.2"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2018AAA0100300"],"award-info":[{"award-number":["2018AAA0100300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovation Foundation of Science and Technology of Dalian","award":["2018J12GX045"],"award-info":[{"award-number":["2018J12GX045"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3010981","type":"journal-article","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T20:48:06Z","timestamp":1595364486000},"page":"135686-135699","source":"Crossref","is-referenced-by-count":4,"title":["Polyseme-Aware Vector Representation for Text Classification"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3723-7688","authenticated-orcid":false,"given":"Shun","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9705-6649","authenticated-orcid":false,"given":"Nianmin","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3115\/1219840.1219855"},{"key":"ref32","first-page":"142","article-title":"Learning word vectors for sentiment analysis","author":"maas","year":"2011","journal-title":"Proc ACL"},{"key":"ref31","first-page":"1871","article-title":"LIBLINEAR: A library for large linear classification","volume":"9","author":"fan","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref30","first-page":"3294","article-title":"Skip-thought vectors","author":"kiros","year":"2015","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref11","first-page":"39","article-title":"A C-LSTM neural network for text classification","volume":"1","author":"zhou","year":"2015","journal-title":"Comput Sci"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99501-4_24"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-2041"},{"key":"ref14","first-page":"2672","article-title":"Generative adversarial nets","author":"goodfellow","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref15","first-page":"1","article-title":"Adversarial training methods for semi-supervised text classification","author":"miyato","year":"2017","journal-title":"Proc ICLR"},{"key":"ref16","first-page":"1","article-title":"Learning structured representation for text classification via reinforcement learning","author":"zhang","year":"2018","journal-title":"Proc 32nd AAAI Conf Artif Intell"},{"key":"ref17","first-page":"1","article-title":"Reinforcement learning for relation classification from noisy data","author":"feng","year":"2018","journal-title":"Proc 32nd AAAI Conf Artif Intell"},{"key":"ref18","first-page":"1","article-title":"Semisupervised classification with graph convolutional networks","author":"kipf","year":"2017","journal-title":"Proc ICLR"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017370"},{"key":"ref28","first-page":"1631","article-title":"Recursive deep models for semantic compositionality over a sentiment treebank","author":"socher","year":"2013","journal-title":"Proc Conf Empirical Methods Natural Lang Process"},{"key":"ref4","first-page":"1188","article-title":"Distributed representations of sentences and documents","author":"le","year":"2014","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1001"},{"key":"ref3","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1181"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390294"},{"key":"ref5","first-page":"1","article-title":"Efficient vector representation for documents through corruption","author":"chen","year":"2017","journal-title":"Proc ICLR"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/E17-1104"},{"key":"ref7","first-page":"2741","article-title":"Character-aware neural language models","author":"kim","year":"2016","journal-title":"Proc 13th AAAI Conf Artif Intell"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1210"},{"key":"ref1","article-title":"Efficient estimation of word representations in vector space","author":"mikolov","year":"2013","journal-title":"Comput Sci"},{"key":"ref20","article-title":"Simplifying graph convolutional networks","author":"wu","year":"2019","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref22","first-page":"4171","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"devlin","year":"2019","journal-title":"Proc NAACL-HLT"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1202"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.05.017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2019.2913511"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-1001"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1151"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09145584.pdf?arnumber=9145584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:56:37Z","timestamp":1642002997000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9145584\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3010981","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}