{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:41:25Z","timestamp":1778254885220,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"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":["Int J Comput Intell Syst"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The automated analysis of different trends in online debating forums is an interesting tool for sampling the agreement between citizens in different topics. In previous work, we have defined computational models to measure different values in these online debating forums. One component in these models has been the identification of the set of <jats:italic>accepted posts<\/jats:italic> by an argumentation problem that characterizes this accepted set through a particular argumentation acceptance semantics. A second component is the classification of posts into two groups: the ones that agree with the root post of the debate, and the ones that disagree with it. Once we compute the set of accepted posts, we compute the different measures we are interested to get from the debate, as functions defined over the bipartition of the posts and the set of accepted posts. In this work, we propose to explore the use of graph neural networks (GNNs), based on graph isomorphism networks, to solve the problem of computing these measures, using as input the debate tree, instead of using our previous argumentation reasoning system. We focus on the particular online debate forum Reddit, and on the computation of a measure of the polarization in the debate. We explore the use of two different approaches: one where a single GNN model computes directly the polarization of the debate, and another one where the polarization is computed using two different GNNs: the first one to compute the accepted posts of the debate, and the second one to compute the bipartition of the posts of the debate. Our results over a set of Reddit debates show that GNNs can be used to compute the polarization measure with an acceptable error, even if the number of layers of the network is bounded by a constant. We observed that the model based on a single GNN shows the lowest error, yet the one based on two GNNs has more flexibility to compute additional measures from the debates. We also compared the execution time of our GNN-based models with a previous approach based on a distributed algorithm for the computation of the accepted posts, and observed a better performance.<\/jats:p>","DOI":"10.1007\/s44196-022-00147-9","type":"journal-article","created":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T12:02:32Z","timestamp":1666008152000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Argumentation Reasoning with Graph Isomorphism Networks for Reddit Conversation Analysis"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4594-5502","authenticated-orcid":false,"given":"Teresa","family":"Alsinet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josep","family":"Argelich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ram\u00f3n","family":"B\u00e9jar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Gibert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Planes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"issue":"15","key":"147_CR1","first-page":"1","volume":"8","author":"P Aragon","year":"2017","unstructured":"Aragon, P., Gomez, V., Garcia, D., Kaltenbrunner, A.: Generative models of online discussion threads: state of the art and research challenges. J. Intern. Serv. Appl. 8(15), 1\u201317 (2017)","journal-title":"J. Intern. Serv. Appl."},{"issue":"5439","key":"147_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999). https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Science"},{"key":"147_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511894701","volume-title":"Exponential Random Graph Models for Social Networks: Theory, Methods, and Applications. Structural Analysis in the Social Sciences","year":"2012","unstructured":"Lusher, D., Koskinen, J., Robins, G. (eds.): Exponential Random Graph Models for Social Networks: Theory, Methods, and Applications. Structural Analysis in the Social Sciences. Cambridge University Press, Cambridge (2012). https:\/\/doi.org\/10.1017\/CBO9780511894701"},{"key":"147_CR4","unstructured":"Hamilton, W.L., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Guyon, I., von Luxburg, U., Bengio, S., Wallach, H.M., Fergus, R., Vishwanathan, S.V.N., Garnett, R. (eds.) Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4\u20139, 2017, Long Beach, CA, USA, pp. 1024\u20131034 (2017). https:\/\/proceedings.neurips.cc\/paper\/2017\/hash\/5dd9db5e033da9c6fb5ba83c7a7ebea9-Abstract.html"},{"key":"147_CR5","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24\u201326, 2017, Conference Track Proceedings. OpenReview.net (2017). https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"key":"147_CR6","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6\u20139, 2019. OpenReview.net (2019). https:\/\/openreview.net\/forum?id=ryGs6iA5Km"},{"issue":"18","key":"147_CR7","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.1016\/j.artint.2009.09.001","volume":"173","author":"PE Dunne","year":"2009","unstructured":"Dunne, P.E.: The computational complexity of ideal semantics. Artif. Intell. 173(18), 1559\u20131591 (2009)","journal-title":"Artif. Intell."},{"key":"147_CR8","doi-asserted-by":"publisher","unstructured":"Alsinet, T., Argelich, J., B\u00e9jar, R., Mart\u00ednez, S.: An argumentation approach for agreement analysis in reddit debates. In: Artificial Intelligence Research and Development\u2014Current Challenges, New Trends and Applications, CCIA 2018, 21st International Conference of the Catalan Association for Artificial Intelligence, Alt Empord\u00e0, Catalonia, Spain, 8\u201310th October 2018, pp. 217\u2013226 (2018). https:\/\/doi.org\/10.3233\/978-1-61499-918-8-217","DOI":"10.3233\/978-1-61499-918-8-217"},{"key":"147_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.patrec.2020.02.008","volume":"133","author":"T Alsinet","year":"2020","unstructured":"Alsinet, T., Argelich, J., B\u00e9jar, R., Mart\u00ednez, S.: Measuring user relevance in online debates through an argumentative model. Pattern Recognit. Lett. 133, 41\u201347 (2020). https:\/\/doi.org\/10.1016\/j.patrec.2020.02.008","journal-title":"Pattern Recognit. Lett."},{"key":"147_CR10","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-030-35514-2_3","volume-title":"Scalable Uncertainty Management","author":"I Kuhlmann","year":"2019","unstructured":"Kuhlmann, I., Thimm, M.: Using graph convolutional networks for approximate reasoning with abstract argumentation frameworks: a feasibility study. In: Ben Amor, N., Quost, B., Theobald, M. (eds.) Scalable Uncertainty Management, pp. 24\u201337. Springer, Berlin (2019)"},{"key":"147_CR11","doi-asserted-by":"publisher","unstructured":"Craandijk, D., Bex, F.: Deep learning for abstract argumentation semantics. In: Bessiere, C. (ed.) Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI-20, pp. 1667\u20141673. International Joint Conferences on Artificial Intelligence Organization (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/231. Main Track","DOI":"10.24963\/ijcai.2020\/231"},{"key":"147_CR12","doi-asserted-by":"publisher","unstructured":"Schmidt, R.M.: Recurrent neural networks (RNNs): a gentle Introduction and Overview. arXiv (2019). https:\/\/doi.org\/10.48550\/ARXIV.1912.05911","DOI":"10.48550\/ARXIV.1912.05911"},{"key":"147_CR13","doi-asserted-by":"crossref","unstructured":"Choi, D., Han, J., Chung, T., Ahn, Y., Chun, B., Kwon, T.T.: Characterizing conversation patterns in reddit: from the perspectives of content properties and user participation behaviors. In: Proceedings of the 2015 ACM on Conference on Online Social Networks, COSN 2015, Palo Alto, California, USA, November 2\u20133, 2015, pp. 233\u2013243 (2015)","DOI":"10.1145\/2817946.2817959"},{"key":"147_CR14","doi-asserted-by":"publisher","unstructured":"G\u00f3mez, V., Kaltenbrunner, A., L\u00f3pez, V.: Statistical analysis of the social network and discussion threads in Slashdot. In: Proceedings of the 17th International Conference on World Wide Web. WWW\u201908, pp. 645\u2013654. Association for Computing Machinery, New York, NY, USA (2008). https:\/\/doi.org\/10.1145\/1367497.1367585","DOI":"10.1145\/1367497.1367585"},{"key":"147_CR15","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1038\/s41586-021-04167-x","volume":"600","author":"I Waller","year":"2021","unstructured":"Waller, I., Anderson, A.: Quantifying social organization and political polarization in online platforms. Nature 600, 264\u2013268 (2021). https:\/\/doi.org\/10.1038\/s41586-021-04167-x","journal-title":"Nature"},{"issue":"3","key":"147_CR16","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1093\/logcom\/13.3.429","volume":"13","author":"TJM Bench-Capon","year":"2003","unstructured":"Bench-Capon, T.J.M.: Persuasion in practical argument using value-based argumentation frameworks. J. Log. Comput. 13(3), 429\u2013448 (2003)","journal-title":"J. Log. Comput."},{"issue":"10\u201315","key":"147_CR17","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.artint.2007.05.003","volume":"171","author":"PM Dung","year":"2007","unstructured":"Dung, P.M., Mancarella, P., Toni, F.: Computing ideal sceptical argumentation. Artif. Intell. 171(10\u201315), 642\u2013674 (2007)","journal-title":"Artif. Intell."},{"issue":"7","key":"147_CR18","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1007\/s00500-018-3380-x","volume":"23","author":"T Alsinet","year":"2019","unstructured":"Alsinet, T., Argelich, J., B\u00e9jar, R., Cemeli, J.: A distributed argumentation algorithm for mining consistent opinions in weighted twitter discussions. Soft. Comput. 23(7), 2147\u20132166 (2019). https:\/\/doi.org\/10.1007\/s00500-018-3380-x","journal-title":"Soft. Comput."},{"key":"147_CR19","doi-asserted-by":"publisher","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data. SIGMOD\u201910, pp. 135\u2013146. Association for Computing Machinery, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1807167.1807184","DOI":"10.1145\/1807167.1807184"},{"key":"147_CR20","unstructured":"Errica, F., Podda, M., Bacciu, D., Micheli, A.: A fair comparison of graph neural networks for graph classification. In: 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26\u201330, 2020. OpenReview.net (2020). https:\/\/openreview.net\/forum?id=HygDF6NFPB"},{"issue":"1","key":"147_CR21","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2021","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., Yu, P.S.: A comprehensive survey on graph neural networks. IEEE Trans. Neural Netw. Learn. Syst. 32(1), 4\u201324 (2021). https:\/\/doi.org\/10.1109\/TNNLS.2020.2978386","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"9","key":"147_CR22","doi-asserted-by":"publisher","first-page":"3981","DOI":"10.1021\/acs.jcim.9b00387","volume":"59","author":"J Lim","year":"2019","unstructured":"Lim, J., Ryu, S., Park, K., Choe, Y.J., Ham, J., Kim, W.Y.: Predicting drug-target interaction using a novel graph neural network with 3D structure-embedded graph representation. J. Chem. Inf. Model. 59(9), 3981\u20133988 (2019). https:\/\/doi.org\/10.1021\/acs.jcim.9b00387","journal-title":"J. Chem. Inf. Model."},{"key":"147_CR23","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-019-3039-3","author":"J Wen","year":"2019","unstructured":"Wen, J., Liu, Y., Shi, Y., et al.: A classification model for LNCRNA and MRNA based on $$k$$-MERS and a convolutional neural network. BMC Bioinform. (2019). https:\/\/doi.org\/10.1186\/s12859-019-3039-3","journal-title":"BMC Bioinform."},{"key":"147_CR24","unstructured":"Sanchez-Gonzalez, A., Godwin, J., Pfaff, T., Ying, R., Leskovec, J., Battaglia, P.: Learning to simulate complex physics with graph networks. In: III, H.D., Singh, A. (eds.) Proceedings of the 37th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 119, pp. 8459\u20138468. PMLR (2020). https:\/\/proceedings.mlr.press\/v119\/sanchez-gonzalez20a.html"},{"issue":"9","key":"147_CR25","first-page":"12","volume":"2","author":"BY Weisfeiler","year":"1968","unstructured":"Weisfeiler, B.Y., Leman, A.A.: A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno Tech. Inf. 2(9), 12\u201316 (1968)","journal-title":"Nauchno Tech. Inf."},{"key":"147_CR26","unstructured":"Ba, L.J., Kiros, J.R., Hinton, G.E.: Layer normalization. CoRR (2016) arXiv:1607.06450"},{"key":"147_CR27","unstructured":"Hinton, G.E., Srivastava, N., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.: Improving neural networks by preventing co-adaptation of feature detectors. CoRR (2012) arXiv:1207.0580"},{"key":"147_CR28","doi-asserted-by":"crossref","unstructured":"Manning, C.D., Surdeanu, M., Bauer, J., Finkel, J., Bethard, S.J., McClosky, D.: The Stanford CoreNLP natural language processing toolkit. In: Association for Computational Linguistics (ACL) System Demonstrations, pp. 55\u201360 (2014). http:\/\/www.aclweb.org\/anthology\/P\/P14\/P14-5010","DOI":"10.3115\/v1\/P14-5010"},{"key":"147_CR29","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. CoRR (2017) arXiv:1412.6980"}],"container-title":["International Journal of Computational Intelligence Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-022-00147-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44196-022-00147-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-022-00147-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T12:06:26Z","timestamp":1666008386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44196-022-00147-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["147"],"URL":"https:\/\/doi.org\/10.1007\/s44196-022-00147-9","relation":{},"ISSN":["1875-6883"],"issn-type":[{"value":"1875-6883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,17]]},"assertion":[{"value":"2 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2022","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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval and Consent to Participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}],"article-number":"86"}}