{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:03:11Z","timestamp":1775066591785,"version":"3.50.1"},"reference-count":88,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Audio Speech Lang. Process."],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/taslp.2023.3275040","type":"journal-article","created":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T01:16:14Z","timestamp":1683767774000},"page":"1877-1892","source":"Crossref","is-referenced-by-count":16,"title":["Multi-Task Attentive Residual Networks for Argument Mining"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9711-7042","authenticated-orcid":false,"given":"Andrea","family":"Galassi","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering (DISI), University of Bologna, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9663-1071","authenticated-orcid":false,"given":"Marco","family":"Lippi","sequence":"additional","affiliation":[{"name":"Department of Sciences and Methods for Engineering (DISMI), University of Modena and Reggio Emilia, Modena, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9253-8638","authenticated-orcid":false,"given":"Paolo","family":"Torroni","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering (DISI), University of Bologna, Bologna, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Google's AI guru wants computers to think more like brains","author":"simonite","year":"2018","journal-title":"Wired"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2019.102055"},{"key":"ref56","first-page":"4189","article-title":"Recurrent highway networks","author":"zilly","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W18-5201"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref14","first-page":"1","article-title":"Reduced, reused and recycled: The life of a dataset in machine learning research","author":"koch","year":"0","journal-title":"Proc NeurIPS Datasets Benchmarks"},{"key":"ref58","first-page":"801","article-title":"An annotated corpus of argumentative microtexts","author":"peldszus","year":"0","journal-title":"Proc Eur Conf Argumentation"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/E17-1104"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/766"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.243"},{"key":"ref10","article-title":"Efficient methods for natural language processing: A survey","author":"treviso","year":"2022","journal-title":"Comput Res Repository"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1191"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1162\/COLI_a_00276"},{"key":"ref16","first-page":"1","article-title":"Winner's curse? on pace, progress, and empirical rigor","author":"sculley","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-2038"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1002"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00349"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1371"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-long.497"},{"key":"ref45","first-page":"193","article-title":"Argumentative relation classification as plausibility ranking","author":"opitz","year":"0","journal-title":"Proc 15th Conf Natural Lang Process"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.artmed.2021.102098"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICAC3N56670.2022.10074559"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i05.6438"},{"key":"ref86","first-page":"1","article-title":"Investigating logic tensor networks for neural-symbolic argument mining","author":"galassi","year":"0","journal-title":"Proc 1st Int Joint Conf Learn Reasoning"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.coling-main.478"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.3389\/fdata.2019.00052"},{"key":"ref44","article-title":"RoBERTa: A robustly optimized BERT pretraining approach","author":"liu","year":"2019"},{"key":"ref88","first-page":"47","article-title":"Combining WordNet and word embeddings in data augmentation for legal texts","author":"per\u00e7in","year":"0","journal-title":"Proc Natural Legal Lang Process Workshop"},{"key":"ref43","first-page":"67","article-title":"ECHR: Legal corpus for argument mining","author":"poudyal","year":"0","journal-title":"Proc Workshop Argument Mining"},{"key":"ref87","first-page":"33","article-title":"Generating adversarial examples for topic-dependent argument classification","volume":"326","author":"mayer","year":"2020","journal-title":"Commun"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz682"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.findings-emnlp.140"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3381831"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531766"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1162\/COLI_a_00295"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0_1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1355"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N16-1164"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1002"},{"key":"ref81","first-page":"3543","article-title":"Attention is not explanation","author":"jain","year":"0","journal-title":"Proc Conf North Amer Assoc Comput Linguistics Hum Lang Technol"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.coling-main.128"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1162\/0891201041850885"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85251-1_4"},{"key":"ref80","author":"krippendorff","year":"2018","journal-title":"Content Analysis An Introduction to Its Methodology"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.298"},{"key":"ref79","first-page":"1","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1143"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1006"},{"key":"ref37","first-page":"4171","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"devlin","year":"0","journal-title":"Proc Conf North Amer Assoc Comput Linguistics Hum Lang Technol"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1069"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1402"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/2746090.2746118"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W19-4508"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-019-8208-z"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D16-1129"},{"key":"ref77","first-page":"3081","article-title":"A multi-layered annotated corpus of scientific papers","author":"fisas","year":"0","journal-title":"Proc 10th Int Conf Lang Resour Eval"},{"key":"ref32","first-page":"74","author":"splieth\u00f6ver","year":"0","journal-title":"Proc Workshop Argument Mining"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W18-5206"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1162\/coli_a_00364"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2850417"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1054"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1202"},{"key":"ref71","author":"goodfellow","year":"2016","journal-title":"Deep Learning"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/568"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058655"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1035"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00357"},{"key":"ref68","first-page":"448","article-title":"Batch normalization: Accelerating deep network training by reducing internal covariate shift","author":"ioffe","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1091"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.123"},{"key":"ref26","first-page":"2692","article-title":"Pointer networks","author":"vinyals","year":"0","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref25","first-page":"1","article-title":"Neural machine translation by jointly learning to align and translate","author":"bahdanau","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref69","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":"ref20","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-2006"},{"key":"ref64","author":"jurafsky","year":"2021","journal-title":"Speech and Lang Process (3rd Ed draft)"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_18"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2020.101840"},{"key":"ref66","first-page":"315","article-title":"Deep sparse rectifier neural networks","author":"glorot","year":"0","journal-title":"Proc 14th Int Conf Artif Intell Statist"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1370"},{"key":"ref65","first-page":"2493","article-title":"Natural language processing (almost) from scratch","volume":"12","author":"collobert","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3019893"},{"key":"ref27","first-page":"5998","article-title":"Attention is all you need","author":"vaswani","year":"0","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-020-00364-z"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-26390-3_34"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TG.2018.2804039"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1038\/nature16961"}],"container-title":["IEEE\/ACM Transactions on Audio, Speech, and Language Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6570655\/9970249\/10122594.pdf?arnumber=10122594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T18:21:56Z","timestamp":1686594116000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10122594\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":88,"URL":"https:\/\/doi.org\/10.1109\/taslp.2023.3275040","relation":{},"ISSN":["2329-9290","2329-9304"],"issn-type":[{"value":"2329-9290","type":"print"},{"value":"2329-9304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}