{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,3]],"date-time":"2026-11-03T19:27:22Z","timestamp":1793734042823,"version":"4.6.1"},"reference-count":91,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Council for Scientific and Technological Development (CNPq) of Brazil","award":["420562\/2018-4"],"award-info":[{"award-number":["420562\/2018-4"]}]},{"name":"National Council for Scientific and Technological Development (CNPq) of Brazil","award":["440045\/2020-7"],"award-info":[{"award-number":["440045\/2020-7"]}]},{"name":"National Council for Scientific and Technological Development (CNPq) of Brazil","award":["309863\/2020-1"],"award-info":[{"award-number":["309863\/2020-1"]}]},{"name":"Amazon, Inc.","award":["CNPq\/AWS032\/2019"],"award-info":[{"award-number":["CNPq\/AWS032\/2019"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Artif. Intell."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1109\/tai.2021.3114390","type":"journal-article","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T16:26:05Z","timestamp":1632241565000},"page":"657-668","source":"Crossref","is-referenced-by-count":62,"title":["Toward Text Data Augmentation for Sentiment Analysis"],"prefix":"10.1109","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5208-0290","authenticated-orcid":false,"given":"Hugo Queiroz","family":"Abonizio","sequence":"first","affiliation":[{"name":"Computer Science Department, State University of Londrina (UEL), Londrina, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6740-7855","authenticated-orcid":false,"given":"Emerson Cabrera","family":"Paraiso","sequence":"additional","affiliation":[{"name":"Informatics Department, Pontificia Universidade Catolica do Parana (PUCPR), Curitiba, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4988-0702","authenticated-orcid":false,"given":"Sylvio","family":"Barbon","sequence":"additional","affiliation":[{"name":"Computer Science Department, State University of Londrina (UEL), Londrina, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2016.31"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksues.2016.04.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2851311"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.08.053"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1253"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-61377-8_38"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017402"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S1532\u20130464(03)00034-0"},{"key":"ref10","volume-title":"Pattern Recognition and Machine Learning (Information Science and Statistics)","author":"Bishop","year":"2006"},{"issue":"56","key":"ref11","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s13398-014-0173-7.2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.191"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2021.3054609"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-019-0197-0"},{"key":"ref16","first-page":"18","article-title":"Data augmentation using pre-trained transformer models","volume-title":"Proc. 2nd Workshop Life-long Learn. Spoken Lang. Syst.","author":"Kumar","year":"2020"},{"key":"ref17","first-page":"271","article-title":"Model-portability experiments for textual temporal analysis","volume-title":"Proc. 49th Annu. Meeting Assoc. Comput. Linguistics., Human Lang. Technol., Short Papers","author":"Kolomiyets","year":"2011"},{"key":"ref18","first-page":"649","article-title":"Character-level convolutional networks for text classification","volume-title":"Proc. 28th Int. Conf. Neural Inf. Process. Syst.","author":"Zhang","year":"2015"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10350"},{"key":"ref20","article-title":"Text data augmentation made simple by leveraging NLP cloud APIS","author":"Coulombe","year":"2018"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1670"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.750"},{"key":"ref23","first-page":"3239","article-title":"Learning to compose domain-specific transformations for data augmentation","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Ratner","year":"2017"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1132"},{"key":"ref25","first-page":"6256","article-title":"Unsupervised data augmentation for consistency training","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Xie","year":"2020"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2018.00141"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-5018"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1306"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.372"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-2072"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22747-0_7"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1545"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W19-2306"},{"key":"ref34","article-title":"Neural machine translation for paraphrase generation","volume-title":"arXiv:2006.14223","author":"Sokolov","year":"2020"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.coling-industry.2"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.eacl-main.88"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1009"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1045"},{"key":"ref39","first-page":"1","article-title":"Fast and accurate reading comprehension by combining self-attention and convolution","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Yu","year":"2018"},{"key":"ref40","article-title":"Bet: A backtranslation approach for easy data augmentation in transformer-based paraphrase identification context","volume-title":"arXiv:2009.12452","author":"Corbeil","year":"2020"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.60"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i05.6233"},{"key":"ref43","first-page":"22","article-title":"Text augmentation techniques for clinical case classification","volume-title":"Proc. Work. Notes Conf. Labs Eval. Forum. CEUR Workshop Proc.","author":"Ollagnier","year":"2020"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682544"},{"key":"ref45","article-title":"Augmenting data with mixup for sentence classification: An empirical study","volume-title":"arXiv:1905.08941","author":"Guo","year":"2019"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-6101"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.194"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219748"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00020"},{"key":"ref50","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"26","author":"Mikolov","year":"2013"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref52","first-page":"1","article-title":"Pointer sentinel mixture models","volume-title":"Proc. 5th Int. Conf. Learn. Representations","author":"Merity","year":"2017"},{"issue":"1","key":"ref53","first-page":"1","article-title":"Paraphrasing questions using given and new information","volume":"9","author":"McKeown","year":"1983","journal-title":"Comput. Linguistics"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27779-8_27"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.3115\/1220835.1220893"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-4012"},{"key":"ref57","article-title":"Improving language understanding by generative pre-training","author":"Radford","year":"2018"},{"issue":"8","key":"ref58","first-page":"9","article-title":"Language models are unsupervised multitask learners","volume":"1","author":"Radford","year":"2019","journal-title":"OpenAI Blog"},{"key":"ref59","first-page":"1","article-title":"Xlnet: Generalized autoregressive pretraining for language understanding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Yang","year":"2019"},{"key":"ref60","first-page":"2672","article-title":"Generative adversarial nets","volume-title":"Proc. 27th Int. Conf. Neural Inf. Process. Syst.","author":"Goodfellow","year":"2014"},{"key":"ref61","first-page":"1","article-title":"Distilling the knowledge in a neural network","volume-title":"Proc. NIPS Deep Learn. Representation Learn. Workshop","author":"Hinton","year":"2015"},{"key":"ref62","article-title":"Distilbert, A distilled version of bert: smaller, faster, cheaper and lighter","volume-title":"arXiv:1910.01108","author":"Sanh","year":"2019"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.18653\/vl\/N19-142"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.703"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-7502-7_79-1"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1002\/asi.23062"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s10579-008-9076-6"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/T-AFFC.2011.20"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8462160"},{"key":"ref70","article-title":"Ethos: An online hate speech detection dataset","volume-title":"arXiv:2006.08328","author":"Mollas","year":"2020"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507163"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783380"},{"key":"ref73","first-page":"1631","article-title":"Recursive deep models for semantic compositionality over a sentiment treebank","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process.","author":"Socher","year":"2013"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1181"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref76","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. 3rd Int. Conf. Learn. Representations","author":"Kingma","year":"2015"},{"key":"ref77","first-page":"1","article-title":"Decoupled weight decay regularization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Loshchilov","year":"2019"},{"key":"ref78","first-page":"III-1310","article-title":"On the difficulty of training recurrent neural networks","volume-title":"Proc. 30th Int. Conf. Int. Conf. Mach. Learn.","author":"Pascanu","year":"2013"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3455008"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/p19-1139"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i05.6428"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W18-5446"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-demos.6"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022627411411"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/S18-1004"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1023\/A:I0I0933404324"},{"key":"ref87","first-page":"2825","article-title":"Scikit-learn: Machine learning in Python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/ICICOS.2018.8621648"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94463-0"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1590\/S0102-44502002000300008"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1032"}],"container-title":["IEEE Transactions on Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9078688\/9924246\/09543519.pdf?arnumber=9543519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T01:09:59Z","timestamp":1755911399000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9543519\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":91,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tai.2021.3114390","relation":{},"ISSN":["2691-4581"],"issn-type":[{"value":"2691-4581","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10]]}}}