{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:21:08Z","timestamp":1740108068901,"version":"3.37.3"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T00:00:00Z","timestamp":1702857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T00:00:00Z","timestamp":1702857600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Our research focuses on extracting exchanged views from dialogical documents through argument pair extraction (APE). The objective of this process is to facilitate comprehension of complex argumentative discourse by finding the related arguments. The APE comprises two stages: argument mining and argument matching. Researchers typically employ sequence labeling models for mining arguments and text matching models to calculate the relationships between them, thereby generating argument pairs. However, these approaches fail to capture long-distance contextual information and struggle to fully comprehend the complex structure of arguments. In our work, we propose the context-aware heterogeneous graph matching (HGMN) model for the APE task. First, we design a graph schema specifically tailored to argumentative texts, along with a heterogeneous graph attention network that effectively captures context information and structural information of arguments. Moreover, the text matching between arguments is converted into a graph matching paradigm and a multi-granularity graph matching model is proposed to handle the intricate relationships between arguments at various levels of granularity. In this way, the semantics of argument are modeled structurally and thus capture the complicated correlations between arguments. Extensive experiments are conducted to evaluate the HGMN model, including comparisons with existing methods and the GPT series of large language models (LLM). The results demonstrate that HGMN outperforms the state-of-the-art method.\n<\/jats:p>","DOI":"10.1007\/s00521-023-09250-0","type":"journal-article","created":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T20:02:06Z","timestamp":1702929726000},"page":"4741-4762","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Seeing both sides: context-aware heterogeneous graph matching networks for extracting-related arguments"],"prefix":"10.1007","volume":"36","author":[{"given":"Tiezheng","family":"Mao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4192-554X","authenticated-orcid":false,"given":"Osamu","family":"Yoshie","sequence":"additional","affiliation":[]},{"given":"Jialing","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Weixin","family":"Mao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"9250_CR1","doi-asserted-by":"crossref","unstructured":"Afantenos S, Peldszus A, Stede M (2018) Comparing decoding mechanisms for parsing argumentative structures. Argum Comput","DOI":"10.3233\/AAC-180033"},{"key":"9250_CR2","unstructured":"Arora S, Narayan A, Chen MF et al (2022) Ask me anything: A simple strategy for prompting language models. arXiv preprint arXiv:2210.02441"},{"key":"9250_CR3","doi-asserted-by":"crossref","unstructured":"Bao J, Liang B, Sun J et al (2021a) Argument pair extraction with mutual guidance and inter-sentence relation graph. In: Proc. of EMNLP","DOI":"10.18653\/v1\/2021.emnlp-main.319"},{"key":"9250_CR4","doi-asserted-by":"crossref","unstructured":"Bao J, Liang B, Sun J et al (2021b) Argument pair extraction with mutual guidance and inter-sentence relation graph. In: Proc. of EMNLP","DOI":"10.18653\/v1\/2021.emnlp-main.319"},{"key":"9250_CR5","doi-asserted-by":"crossref","unstructured":"Bao J, Sun J, Zhu Q et al (2022) Have my arguments been replied to? argument pair extraction as machine reading comprehension. In: Proc. of ACL","DOI":"10.18653\/v1\/2022.acl-short.4"},{"key":"9250_CR6","unstructured":"Beltagy I, Peters ME, Cohan A (2020) Longformer: The long-document transformer. ArXiv preprint"},{"key":"9250_CR7","doi-asserted-by":"crossref","unstructured":"Bommarito\u00a0II M, Katz DM (2022) Gpt takes the bar exam. arXiv preprint arXiv:2212.14402","DOI":"10.2139\/ssrn.4314839"},{"key":"9250_CR8","unstructured":"Brown T, Mann B, Ryder N et al (2020) Language models are few-shot learners. Proc of NeurIPS"},{"key":"9250_CR9","unstructured":"Bubeck S, Chandrasekaran V, Eldan R et al (2023) Sparks of artificial general intelligence: Early experiments with gpt-4. arXiv preprint arXiv:2303.12712"},{"key":"9250_CR10","doi-asserted-by":"crossref","unstructured":"Chakrabarty T, Hidey C, Muresan S et al (2019) Ampersand: Argument mining for persuasive online discussions. In: Proc. of EMNLP","DOI":"10.18653\/v1\/D19-1291"},{"key":"9250_CR11","doi-asserted-by":"crossref","unstructured":"Chakrabarty T, Hidey C, Muresan S et al (2019) AMPERSAND: Argument mining for PERSuAsive oNline discussions. In: Proc. of EMNLP","DOI":"10.18653\/v1\/D19-1291"},{"key":"9250_CR12","doi-asserted-by":"crossref","unstructured":"Chen D, Manning C (2014) A fast and accurate dependency parser using neural networks. In: Proc. of EMNLP","DOI":"10.3115\/v1\/D14-1082"},{"key":"9250_CR13","doi-asserted-by":"crossref","unstructured":"Chen L, Zhao Y, Lyu B et al (2020) Neural graph matching networks for Chinese short text matching. In: Proc. of ACL","DOI":"10.18653\/v1\/2020.acl-main.547"},{"key":"9250_CR14","unstructured":"Chen X, Ye J, Zu C et al (2023) How robust is gpt-3.5 to predecessors? a comprehensive study on language understanding tasks. arXiv preprint arXiv:2303.00293"},{"key":"9250_CR15","doi-asserted-by":"crossref","unstructured":"Cheng L, Bing L, Yu Q et al (2020) APE: Argument pair extraction from peer review and rebuttal via multi-task learning. In: Proc. of EMNLP","DOI":"10.18653\/v1\/2020.emnlp-main.569"},{"key":"9250_CR16","doi-asserted-by":"crossref","unstructured":"Cheng L, Wu T, Bing L et al (2021) Argument pair extraction via attention-guided multi-layer multi-cross encoding. In: Proc. of ACL","DOI":"10.18653\/v1\/2021.acl-long.496"},{"key":"9250_CR17","doi-asserted-by":"crossref","unstructured":"Cheng L, Bing L, He R et al (2022) IAM: A comprehensive and large-scale dataset for integrated argument mining tasks. In: Proc. of ACL","DOI":"10.18653\/v1\/2022.acl-long.162"},{"key":"9250_CR18","unstructured":"Devlin J, Chang MW, Lee K et al (2019) BERT: Pre-training of deep bidirectional transformers for language understanding. In: Proc. of AACL"},{"key":"9250_CR19","doi-asserted-by":"crossref","unstructured":"Dua D, Gupta S, Singh S et al (2022) Successive prompting for decomposing complex questions. arXiv preprint arXiv:2212.04092","DOI":"10.18653\/v1\/2022.emnlp-main.81"},{"key":"9250_CR20","doi-asserted-by":"crossref","unstructured":"Dutta S, Das D, Chakraborty T (2020) Changing views: Persuasion modeling and argument extraction from online discussions. Information Processing & Management","DOI":"10.1016\/j.ipm.2019.102085"},{"key":"9250_CR21","doi-asserted-by":"crossref","unstructured":"Ferragina P, Scaiella U (2010) TAGME: on-the-fly annotation of short text fragments (by wikipedia entities). In: Proceedings of the 19th ACM Conference on Information and Knowledge Management, CIKM 2010, Toronto, Ontario, Canada, October 26-30, 2010","DOI":"10.1145\/1871437.1871689"},{"key":"9250_CR22","doi-asserted-by":"crossref","unstructured":"Fromm M, Faerman E, Berrendorf M et al (2021) Argument mining driven analysis of peer-reviews. In: Proc. of AAAI","DOI":"10.1609\/aaai.v35i6.16607"},{"key":"9250_CR23","doi-asserted-by":"crossref","unstructured":"Garg S, Ramakrishnan G (2020) Bae: Bert-based adversarial examples for text classification. In: Proc. of EMNLP","DOI":"10.18653\/v1\/2020.emnlp-main.498"},{"key":"9250_CR24","unstructured":"Glaese A, McAleese N, Trebacz M et al (2022) Improving alignment of dialogue agents via targeted human judgements. arXiv preprint arXiv:2209.14375"},{"key":"9250_CR25","doi-asserted-by":"crossref","unstructured":"Gretz S, Friedman R, Cohen-Karlik E et al (2020) A large-scale dataset for argument quality ranking: Construction and analysis. In: Proc. of AAAI","DOI":"10.1609\/aaai.v34i05.6285"},{"key":"9250_CR26","unstructured":"Hamilton WL, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Proc. of NeurIPS"},{"key":"9250_CR27","unstructured":"Hoffman MD, Blei DM, Bach FR (2010) Online learning for latent dirichlet allocation. In: Proc. of NeurIPS"},{"key":"9250_CR28","doi-asserted-by":"crossref","unstructured":"Hou Y, Jochim C (2017) Argument relation classification using a joint inference model. In: Proceedings of the 4th Workshop on Argument Mining","DOI":"10.18653\/v1\/W17-5107"},{"key":"9250_CR29","doi-asserted-by":"crossref","unstructured":"Hua X, Nikolov M, Badugu N et al (2019) Argument mining for understanding peer reviews. In: Proc. of NAACL","DOI":"10.18653\/v1\/N19-1219"},{"key":"9250_CR30","doi-asserted-by":"crossref","unstructured":"Huang KY, Huang HH, Chen HH (2021) Hargan: heterogeneous argument attention network for persuasiveness prediction. In: Proc. of AAAI","DOI":"10.1609\/aaai.v35i14.17542"},{"key":"9250_CR31","unstructured":"Kingma DP, Ba J (2015) Adam: A method for stochastic optimization. In: Proc. of ICLR"},{"key":"9250_CR32","unstructured":"Kipf TN, Welling M (2016) Variational graph auto-encoders. ArXiv preprint"},{"key":"9250_CR33","doi-asserted-by":"crossref","unstructured":"Koco\u0144 J, Cichecki I, Kaszyca O et al (2023) Chatgpt: Jack of all trades, master of none. arXiv preprint arXiv:2302.10724","DOI":"10.2139\/ssrn.4372889"},{"key":"9250_CR34","unstructured":"Kojima T, Gu SS, Reid M et al (2022) Large language models are zero-shot reasoners. In: ICML 2022 Workshop on Knowledge Retrieval and Language Models"},{"key":"9250_CR35","doi-asserted-by":"crossref","unstructured":"Kuribayashi T, Ouchi H, Inoue N et al (2019) An empirical study of span representations in argumentation structure parsing. In: Proc. of ACL","DOI":"10.18653\/v1\/P19-1464"},{"key":"9250_CR36","doi-asserted-by":"crossref","unstructured":"Li S, Cheng W (2022) Augmenting the global semantic information between words to heterogeneous graph for deception detection. Neural Comput Appl","DOI":"10.1007\/s00521-022-07492-y"},{"key":"9250_CR37","unstructured":"Ling X, Wu L, Wang S et al (2021) Multilevel graph matching networks for deep graph similarity learning. IEEE Transactions on Neural Netwd Learn Syst"},{"key":"9250_CR38","unstructured":"Liu Y, Ott M, Goyal N et al (2019) Roberta: A robustly optimized bert pretraining approach. ArXiv preprint"},{"key":"9250_CR39","doi-asserted-by":"crossref","unstructured":"Min S, Lyu X, Holtzman A et al (2022) Rethinking the role of demonstrations: What makes in-context learning work? arXiv preprint arXiv:2202.12837","DOI":"10.18653\/v1\/2022.emnlp-main.759"},{"key":"9250_CR40","doi-asserted-by":"crossref","unstructured":"Morio G, Fujita K (2018) End-to-end argument mining for discussion threads based on parallel constrained pointer architecture. In: Proceedings of the 5th Workshop on Argument Mining","DOI":"10.18653\/v1\/W18-5202"},{"key":"9250_CR41","doi-asserted-by":"crossref","unstructured":"Morio G, Fujita K (2019) Syntactic graph convolution in multi-task learning for identifying and classifying the argument component. In: 2019 IEEE 13th International Conference on Semantic Computing (ICSC)","DOI":"10.1109\/ICOSC.2019.8665505"},{"key":"9250_CR42","doi-asserted-by":"crossref","unstructured":"Morio G, Ozaki H, Morishita T et al (2020) Towards better non-tree argument mining: Proposition-level biaffine parsing with task-specific parameterization. In: Proc. of ACL","DOI":"10.18653\/v1\/2020.acl-main.298"},{"key":"9250_CR43","doi-asserted-by":"crossref","unstructured":"Morris J, Lifland E, Lanchantin J et al (2020) Reevaluating adversarial examples in natural language. In: Proc. of EMNLP Findings","DOI":"10.18653\/v1\/2020.findings-emnlp.341"},{"key":"9250_CR44","doi-asserted-by":"crossref","unstructured":"Morris J, Lifland E, Yoo JY et al (2020) Textattack: A framework for adversarial attacks, data augmentation, and adversarial training in nlp. In: Proc. of EMNLP","DOI":"10.18653\/v1\/2020.emnlp-demos.16"},{"key":"9250_CR45","unstructured":"Ouyang L, Wu J, Jiang X et al (2022) Training language models to follow instructions with human feedback. arXiv preprint arXiv:2203.02155"},{"key":"9250_CR46","doi-asserted-by":"crossref","unstructured":"Persing I, Ng V (2016) End-to-end argumentation mining in student essays. In: Proc. of NAACL","DOI":"10.18653\/v1\/N16-1164"},{"key":"9250_CR47","doi-asserted-by":"crossref","unstructured":"Qiu L, Xiao Y, Qu Y et al (2019) Dynamically fused graph network for multi-hop reasoning. In: Proc. of ACL","DOI":"10.18653\/v1\/P19-1617"},{"key":"9250_CR48","doi-asserted-by":"crossref","unstructured":"Ragesh R, Sellamanickam S, Iyer A et al (2021) Hetegcn: Heterogeneous graph convolutional networks for text classification. In: Proc. of WSDM","DOI":"10.1145\/3437963.3441746"},{"key":"9250_CR49","doi-asserted-by":"crossref","unstructured":"Rocha G, Stab C, Lopes\u00a0Cardoso H et al (2018) Cross-lingual argumentative relation identification: from English to Portuguese. In: Proceedings of the 5th Workshop on Argument Mining","DOI":"10.18653\/v1\/W18-5217"},{"key":"9250_CR50","doi-asserted-by":"crossref","unstructured":"Schiller B, Daxenberger J, Gurevych I (2021) Aspect-controlled neural argument generation. In: Proc. of AACL","DOI":"10.18653\/v1\/2021.naacl-main.34"},{"key":"9250_CR51","doi-asserted-by":"crossref","unstructured":"Shnarch E, Alzate C, Dankin L et al (2018) Will it blend? blending weak and strong labeled data in a neural network for argumentation mining. In: Proc. of ACL","DOI":"10.18653\/v1\/P18-2095"},{"key":"9250_CR52","doi-asserted-by":"crossref","unstructured":"Song W, Song Z, Liu L et al (2020) Hierarchical multi-task learning for organization evaluation of argumentative student essays. In: Proc. of IJCAI","DOI":"10.24963\/ijcai.2020\/536"},{"key":"9250_CR53","doi-asserted-by":"crossref","unstructured":"Stab C, Gurevych I (2014) Identifying argumentative discourse structures in persuasive essays. In: Proc. of EMNLP","DOI":"10.3115\/v1\/D14-1006"},{"key":"9250_CR54","doi-asserted-by":"crossref","unstructured":"Stab C, Gurevych I (2017) Parsing argumentation structures in persuasive essays. Computational Linguistics","DOI":"10.1162\/COLI_a_00295"},{"key":"9250_CR55","doi-asserted-by":"crossref","unstructured":"Sun Q, Zhang K, Huang K et al (2022) Enhanced graph convolutional network based on node importance for document-level relation extraction. Neural Comput Appl","DOI":"10.1007\/s00521-022-07223-3"},{"key":"9250_CR56","doi-asserted-by":"crossref","unstructured":"Swanson R, Ecker B, Walker M (2015) Argument mining: Extracting arguments from online dialogue. In: Proceedings of the 16th annual meeting of the special interest group on discourse and dialogue","DOI":"10.18653\/v1\/W15-4631"},{"key":"9250_CR57","doi-asserted-by":"crossref","unstructured":"Tay Y, Luu AT, Hui SC (2018) Hermitian co-attention networks for text matching in asymmetrical domains. In: Proc. of IJCAI","DOI":"10.24963\/ijcai.2018\/615"},{"key":"9250_CR58","doi-asserted-by":"crossref","unstructured":"Trautmann D, Daxenberger J, Stab C et al (2020) Fine-grained argument unit recognition and classification. In: Proc. of AAAI","DOI":"10.1609\/aaai.v34i05.6438"},{"key":"9250_CR59","doi-asserted-by":"crossref","unstructured":"Trautmann D, Daxenberger J, Stab C et al (2020) Fine-grained argument unit recognition and classification. In: Proc. of AAAI","DOI":"10.1609\/aaai.v34i05.6438"},{"key":"9250_CR60","doi-asserted-by":"crossref","unstructured":"Tu M, Wang G, Huang J et al (2019) Multi-hop reading comprehension across multiple documents by reasoning over heterogeneous graphs. In: Proc. of ACL","DOI":"10.18653\/v1\/P19-1260"},{"key":"9250_CR61","unstructured":"Velickovic P, Cucurull G, Casanova A et al (2018) Graph attention networks. In: Proc. of ICLR"},{"key":"9250_CR62","unstructured":"Wachsmuth H, Al-Khatib K, Stein B (2016) Using argument mining to assess the argumentation quality of essays. In: Proc. of COLING"},{"key":"9250_CR63","doi-asserted-by":"crossref","unstructured":"Wang X, Wang H, Yang D (2022) Measure and improve robustness in nlp models: A survey. In: Proc. of NAACL","DOI":"10.18653\/v1\/2022.naacl-main.339"},{"key":"9250_CR64","unstructured":"Wei J, Wang X, Schuurmans D et al (2022) Chain-of-thought prompting elicits reasoning in large language models. In: Proc. of NeurIPS"},{"key":"9250_CR65","doi-asserted-by":"crossref","unstructured":"Xu J, Gan Z, Cheng Y et al (2020) Discourse-aware neural extractive text summarization. In: Proc. of ACL","DOI":"10.18653\/v1\/2020.acl-main.451"},{"key":"9250_CR66","doi-asserted-by":"crossref","unstructured":"Yao L, Mao C, Luo Y (2019) Graph convolutional networks for text classification. In: Proc. of AAAI","DOI":"10.1609\/aaai.v33i01.33017370"},{"key":"9250_CR67","doi-asserted-by":"crossref","unstructured":"Yasunaga M, Zhang R, Meelu K et al (2017) Graph-based neural multi-document summarization. In: Proc. of CoNLL","DOI":"10.18653\/v1\/K17-1045"},{"key":"9250_CR68","doi-asserted-by":"crossref","unstructured":"Yuan J, Wei Z, Zhao D et al (2021) Leveraging argumentation knowledge graph for interactive argument pair identification. In: Proc. of ACL Findings","DOI":"10.18653\/v1\/2021.findings-acl.203"},{"key":"9250_CR69","unstructured":"Zaheer M, Guruganesh G, Dubey KA et al (2020) Big bird: Transformers for longer sequences. In: Proc. of NeurIPS"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09250-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-09250-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09250-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T10:08:58Z","timestamp":1708164538000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-09250-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,18]]},"references-count":69,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["9250"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-09250-0","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2023,12,18]]},"assertion":[{"value":"4 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}