Sequence Graph Network for Online Debate Analysis

Online debates involve a dynamic exchange of ideas over time, where participants need to actively consider their opponents' arguments, respond with counterarguments, reinforce their own points, and introduce more compelling arguments as the discussion unfolds. Modeling such a complex process is...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Mai, Quan, Gauch, Susan, Adams, Douglas, Huang, Miaoqing
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Mai, Quan
Gauch, Susan
Adams, Douglas
Huang, Miaoqing
description Online debates involve a dynamic exchange of ideas over time, where participants need to actively consider their opponents' arguments, respond with counterarguments, reinforce their own points, and introduce more compelling arguments as the discussion unfolds. Modeling such a complex process is not a simple task, as it necessitates the incorporation of both sequential characteristics and the capability to capture interactions effectively. To address this challenge, we employ a sequence-graph approach. Building the conversation as a graph allows us to effectively model interactions between participants through directed edges. Simultaneously, the propagation of information along these edges in a sequential manner enables us to capture a more comprehensive representation of context. We also introduce a Sequence Graph Attention layer to illustrate the proposed information update scheme. The experimental results show that sequence graph networks achieve superior results to existing methods in online debates.
doi_str_mv 10.48550/arxiv.2406.18696
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2406_18696</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2406_18696</sourcerecordid><originalsourceid>FETCH-LOGICAL-a676-13d51acf159076d1583bbb74d5ac3674b6e0c7e8eae4b6f6c81ed4450af2bb5a3</originalsourceid><addsrcrecordid>eNotzr1uwjAUhmEvHSraC-hU30CCje1jM6KUn0oIBtijY-dYjQgJdaDA3dNSpu-dPj2MvUmRa2eMGGK61D_5SAvIpYMxPDO5oe8TtYH4POHhi6_oeO7Sjscu8XXb1C3xD_J4JD5psbn2df_CniI2Pb0-dsC2s-m2WGTL9fyzmCwzBAuZVJWRGKI0Y2GhksYp773VlcGgwGoPJIIlR0i_HSE4SZXWRmAceW9QDdj7_-3dXB5Svcd0Lf_s5d2ublr9Po0</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Sequence Graph Network for Online Debate Analysis</title><source>arXiv.org</source><creator>Mai, Quan ; Gauch, Susan ; Adams, Douglas ; Huang, Miaoqing</creator><creatorcontrib>Mai, Quan ; Gauch, Susan ; Adams, Douglas ; Huang, Miaoqing</creatorcontrib><description>Online debates involve a dynamic exchange of ideas over time, where participants need to actively consider their opponents' arguments, respond with counterarguments, reinforce their own points, and introduce more compelling arguments as the discussion unfolds. Modeling such a complex process is not a simple task, as it necessitates the incorporation of both sequential characteristics and the capability to capture interactions effectively. To address this challenge, we employ a sequence-graph approach. Building the conversation as a graph allows us to effectively model interactions between participants through directed edges. Simultaneously, the propagation of information along these edges in a sequential manner enables us to capture a more comprehensive representation of context. We also introduce a Sequence Graph Attention layer to illustrate the proposed information update scheme. The experimental results show that sequence graph networks achieve superior results to existing methods in online debates.</description><identifier>DOI: 10.48550/arxiv.2406.18696</identifier><language>eng</language><subject>Computer Science - Computation and Language</subject><creationdate>2024-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2406.18696$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2406.18696$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Mai, Quan</creatorcontrib><creatorcontrib>Gauch, Susan</creatorcontrib><creatorcontrib>Adams, Douglas</creatorcontrib><creatorcontrib>Huang, Miaoqing</creatorcontrib><title>Sequence Graph Network for Online Debate Analysis</title><description>Online debates involve a dynamic exchange of ideas over time, where participants need to actively consider their opponents' arguments, respond with counterarguments, reinforce their own points, and introduce more compelling arguments as the discussion unfolds. Modeling such a complex process is not a simple task, as it necessitates the incorporation of both sequential characteristics and the capability to capture interactions effectively. To address this challenge, we employ a sequence-graph approach. Building the conversation as a graph allows us to effectively model interactions between participants through directed edges. Simultaneously, the propagation of information along these edges in a sequential manner enables us to capture a more comprehensive representation of context. We also introduce a Sequence Graph Attention layer to illustrate the proposed information update scheme. The experimental results show that sequence graph networks achieve superior results to existing methods in online debates.</description><subject>Computer Science - Computation and Language</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzr1uwjAUhmEvHSraC-hU30CCje1jM6KUn0oIBtijY-dYjQgJdaDA3dNSpu-dPj2MvUmRa2eMGGK61D_5SAvIpYMxPDO5oe8TtYH4POHhi6_oeO7Sjscu8XXb1C3xD_J4JD5psbn2df_CniI2Pb0-dsC2s-m2WGTL9fyzmCwzBAuZVJWRGKI0Y2GhksYp773VlcGgwGoPJIIlR0i_HSE4SZXWRmAceW9QDdj7_-3dXB5Svcd0Lf_s5d2ublr9Po0</recordid><startdate>20240626</startdate><enddate>20240626</enddate><creator>Mai, Quan</creator><creator>Gauch, Susan</creator><creator>Adams, Douglas</creator><creator>Huang, Miaoqing</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20240626</creationdate><title>Sequence Graph Network for Online Debate Analysis</title><author>Mai, Quan ; Gauch, Susan ; Adams, Douglas ; Huang, Miaoqing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a676-13d51acf159076d1583bbb74d5ac3674b6e0c7e8eae4b6f6c81ed4450af2bb5a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Computation and Language</topic><toplevel>online_resources</toplevel><creatorcontrib>Mai, Quan</creatorcontrib><creatorcontrib>Gauch, Susan</creatorcontrib><creatorcontrib>Adams, Douglas</creatorcontrib><creatorcontrib>Huang, Miaoqing</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mai, Quan</au><au>Gauch, Susan</au><au>Adams, Douglas</au><au>Huang, Miaoqing</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Sequence Graph Network for Online Debate Analysis</atitle><date>2024-06-26</date><risdate>2024</risdate><abstract>Online debates involve a dynamic exchange of ideas over time, where participants need to actively consider their opponents' arguments, respond with counterarguments, reinforce their own points, and introduce more compelling arguments as the discussion unfolds. Modeling such a complex process is not a simple task, as it necessitates the incorporation of both sequential characteristics and the capability to capture interactions effectively. To address this challenge, we employ a sequence-graph approach. Building the conversation as a graph allows us to effectively model interactions between participants through directed edges. Simultaneously, the propagation of information along these edges in a sequential manner enables us to capture a more comprehensive representation of context. We also introduce a Sequence Graph Attention layer to illustrate the proposed information update scheme. The experimental results show that sequence graph networks achieve superior results to existing methods in online debates.</abstract><doi>10.48550/arxiv.2406.18696</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2406.18696
ispartof
issn
language eng
recordid cdi_arxiv_primary_2406_18696
source arXiv.org
subjects Computer Science - Computation and Language
title Sequence Graph Network for Online Debate Analysis
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T09%3A57%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Sequence%20Graph%20Network%20for%20Online%20Debate%20Analysis&rft.au=Mai,%20Quan&rft.date=2024-06-26&rft_id=info:doi/10.48550/arxiv.2406.18696&rft_dat=%3Carxiv_GOX%3E2406_18696%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true