{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T06:20:26Z","timestamp":1775197226195,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T00:00:00Z","timestamp":1696032000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T00:00:00Z","timestamp":1696032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Norwegian University of Science and Technology, Norway"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In recent years, online question\u2013answer (Q &amp;A) platforms, such as Stack Exchange (SE), have become increasingly popular for information and knowledge sharing. Despite the vast amount of information available on these platforms, many questions remain unresolved. In this work, we aim to address this issue by proposing a novel approach to identify unresolved questions in SE Q &amp;A communities. Our approach utilises the graph structure of communication formed around a question by users to model the communication network surrounding it. We employ a property graph model and graph neural networks (GNNs), which can effectively capture both the structure of communication and the content of messages exchanged among users. By leveraging the power of graph representation and GNNs, our approach can effectively identify unresolved questions in SE communities. Experimental results on the complete historical data from three distinct Q &amp;A communities demonstrate the superiority of our proposed approach over baseline methods that only consider the content of questions. Finally, our work represents a first but important step towards better understanding the factors that can affect questions becoming and remaining unresolved in SE communities.<\/jats:p>","DOI":"10.1007\/s41060-023-00454-0","type":"journal-article","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T11:02:20Z","timestamp":1696071740000},"page":"205-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A deep learning-based approach for identifying unresolved questions on Stack Exchange Q &amp;A communities through graph-based communication modelling"],"prefix":"10.1007","volume":"18","author":[{"given":"Hassan Abedi","family":"Firouzjaei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,30]]},"reference":[{"key":"454_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-022-00914-8","author":"H Abedi Firouzjaei","year":"2022","unstructured":"Abedi Firouzjaei, H.: Survival analysis for user disengagement prediction: question-and-answering communities\u2019 case. Soc. Netw. Anal. Min. (2022). https:\/\/doi.org\/10.1007\/s13278-022-00914-8","journal-title":"Soc. Netw. Anal. Min."},{"key":"454_CR2","doi-asserted-by":"publisher","unstructured":"Anderson, A., Huttenlocher, D., Kleinberg, J., et\u00a0al.: Discovering value from community activity on focused question answering sites: a case study of stack overflow. In: KDD (2012). https:\/\/doi.org\/10.1145\/2339530.2339665","DOI":"10.1145\/2339530.2339665"},{"key":"454_CR3","doi-asserted-by":"publisher","unstructured":"Asaduzzaman, M., Mashiyat, A.S., Roy, C.K., et\u00a0al.: Answering questions about unanswered questions of stack overflow. In: MSR (2013). https:\/\/doi.org\/10.1109\/MSR.2013.6624015","DOI":"10.1109\/MSR.2013.6624015"},{"key":"454_CR4","doi-asserted-by":"publisher","unstructured":"Bonifati, A., Fletcher, G., Voigt, H., et al.: Querying Graphs. Morgan & Claypool Publishers (2018). https:\/\/doi.org\/10.2200\/S00873ED1V01Y201808DTM051","DOI":"10.2200\/S00873ED1V01Y201808DTM051"},{"key":"454_CR5","doi-asserted-by":"publisher","unstructured":"Bubeck, S., Chandrasekaran, V., Eldan, R., et\u00a0al.: Sparks of Artificial General Intelligence: Early experiments with GPT-4 (2023). https:\/\/doi.org\/10.48550\/arXiv.2303.12712. arXiv preprint arXiv:2303.12712","DOI":"10.48550\/arXiv.2303.12712"},{"key":"454_CR6","doi-asserted-by":"publisher","unstructured":"Chen, T., Guestrin, C.: XGBoost: A Scalable Tree Boosting System. In: KDD (2016). https:\/\/doi.org\/10.1145\/2939672.2939785","DOI":"10.1145\/2939672.2939785"},{"key":"454_CR7","doi-asserted-by":"publisher","unstructured":"Chorowski, J.K., Bahdanau, D., Serdyuk, D., et\u00a0al.: Attention-based models for speech recognition. In: NeurIPS (2015). https:\/\/doi.org\/10.48550\/arXiv.1506.07503","DOI":"10.48550\/arXiv.1506.07503"},{"key":"454_CR8","doi-asserted-by":"publisher","unstructured":"Devlin, J., Chang, M.W., Lee, K., et\u00a0al.: BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding (2018). https:\/\/doi.org\/10.48550\/arXiv.1810.04805. arXiv preprint arXiv:1810.04805","DOI":"10.48550\/arXiv.1810.04805"},{"key":"454_CR9","doi-asserted-by":"publisher","DOI":"10.1162\/089976698300017197","author":"TG Dietterich","year":"1998","unstructured":"Dietterich, T.G.: Approximate statistical tests for comparing supervised classification learning algorithms. Neural Comput. (1998). https:\/\/doi.org\/10.1162\/089976698300017197","journal-title":"Neural Comput."},{"key":"454_CR10","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1969.300225","author":"K Fukushima","year":"1969","unstructured":"Fukushima, K.: Visual feature extraction by a multilayered network of analog threshold elements. IEEE Trans. Syst. Sci. Cybern. (1969). https:\/\/doi.org\/10.1109\/TSSC.1969.300225","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"454_CR11","doi-asserted-by":"publisher","unstructured":"Goderie, J., Georgsson, B.M., Van\u00a0Graafeiland, B., et\u00a0al.: ETA: estimated time of answer predicting response time in stack overflow. In: MSR (2015). https:\/\/doi.org\/10.1109\/MSR.2015.52","DOI":"10.1109\/MSR.2015.52"},{"key":"454_CR12","doi-asserted-by":"publisher","unstructured":"He, K., Zhang, X., Ren, S., et\u00a0al: Delving deep into rectifiers: surpassing human-level performance on imagenet classification. In: ICCV (2015). https:\/\/doi.org\/10.1109\/ICCV.2015.123","DOI":"10.1109\/ICCV.2015.123"},{"key":"454_CR13","doi-asserted-by":"publisher","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised Classification with Graph Convolutional Networks. https:\/\/doi.org\/10.48550\/arXiv.1609.02907 (2016). arXiv preprint arXiv:1609.02907","DOI":"10.48550\/arXiv.1609.02907"},{"key":"454_CR14","doi-asserted-by":"publisher","unstructured":"Lin, M., Chen, Q., Yan, S.: Network In Network (2013). https:\/\/doi.org\/10.48550\/arXiv.1312.4400. arXiv preprint arxiv:1312.4400","DOI":"10.48550\/arXiv.1312.4400"},{"key":"454_CR15","doi-asserted-by":"publisher","unstructured":"Pareja, A., Domeniconi, G., Chen, J., et\u00a0al.: EvolveGCN: evolving graph convolutional networks for dynamic graphs. In: AAAI (2020). https:\/\/doi.org\/10.48550\/arXiv.1902.10191","DOI":"10.48550\/arXiv.1902.10191"},{"key":"454_CR16","doi-asserted-by":"publisher","unstructured":"Reimers, N., Gurevych, I.: Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks (2019). https:\/\/doi.org\/10.48550\/arXiv.1908.10084. arXiv preprint arXiv:1908.10084","DOI":"10.48550\/arXiv.1908.10084"},{"key":"454_CR17","doi-asserted-by":"publisher","unstructured":"Sanatizadeh, A., Lu, Y., Zhao, K., et al.: Information Foraging in the Era of AI: Exploring the Effect of ChatGPT on Digital Q &A Platforms. Available at SSRN 4459729 (2023). https:\/\/doi.org\/10.2139\/ssrn.4459729","DOI":"10.2139\/ssrn.4459729"},{"key":"454_CR18","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605","author":"F Scarselli","year":"2009","unstructured":"Scarselli, F., Gori, M., Tsoi, A.C., et al.: The graph neural network model. IEEE Trans. Neural Netw. (2009). https:\/\/doi.org\/10.1109\/TNN.2008.2005605","journal-title":"IEEE Trans. Neural Netw."},{"key":"454_CR19","doi-asserted-by":"publisher","unstructured":"Sohail, S.S., Farhat, F., Himeur, Y., et al.: The Future of GPT: A Taxonomy of Existing ChatGPT Research, Current Challenges, and Possible Future Directions. Available at SSRN 4413921 (2023). https:\/\/doi.org\/10.2139\/ssrn.4413921","DOI":"10.2139\/ssrn.4413921"},{"key":"454_CR20","doi-asserted-by":"publisher","unstructured":"Tunstall, L., Reimers, N., Jo, U.E.S., et\u00a0al.: Efficient Few-Shot Learning Without Prompts (2022). https:\/\/doi.org\/10.48550\/arXiv.2209.11055. arXiv preprint arXiv:2209.11055","DOI":"10.48550\/arXiv.2209.11055"},{"key":"454_CR21","doi-asserted-by":"publisher","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., et\u00a0al.: Attention is all you need. In: NeurIPS (2017). https:\/\/doi.org\/10.48550\/arXiv.1706.03762","DOI":"10.48550\/arXiv.1706.03762"},{"key":"454_CR22","doi-asserted-by":"publisher","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., et\u00a0al.: Graph Attention Networks (2017). https:\/\/doi.org\/10.48550\/arXiv.1710.10903. arXiv preprint arXiv:1710.10903","DOI":"10.48550\/arXiv.1710.10903"},{"key":"454_CR23","doi-asserted-by":"publisher","unstructured":"Wu, L., Cui, P., Pei, J., et al.: Graph Neural Networks: Foundations, Frontiers, and Applications. Springer (2022). https:\/\/doi.org\/10.1109\/ICPC52881.2021.00015","DOI":"10.1109\/ICPC52881.2021.00015"},{"key":"454_CR24","doi-asserted-by":"publisher","unstructured":"Xue, J., Wang, L., Zheng, J., et al.: Can ChatGPT Kill User-Generated Q &A Platforms? Available at SSRN 4448938 (2023). https:\/\/doi.org\/10.2139\/ssrn.4448938","DOI":"10.2139\/ssrn.4448938"},{"key":"454_CR25","doi-asserted-by":"publisher","unstructured":"Yazdaninia, M., Lo, D., Sami, A.: Characterization and prediction of questions without accepted answers on stack overflow. In: ICPC (2021). https:\/\/doi.org\/10.1109\/ICPC52881.2021.00015","DOI":"10.1109\/ICPC52881.2021.00015"},{"key":"454_CR26","doi-asserted-by":"publisher","unstructured":"You, J., Ying, Z., Leskovec, J.: Design space for graph neural networks. In: NeurIPS (2020). https:\/\/doi.org\/10.1145\/3447548.3467283","DOI":"10.1145\/3447548.3467283"},{"key":"454_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5221-8","author":"HF Yu","year":"2011","unstructured":"Yu, H.F., Huang, F.L., Lin, C.J.: Dual coordinate descent methods for logistic regression and maximum entropy models. Mach. Learn. (2011). https:\/\/doi.org\/10.1007\/s10994-010-5221-8","journal-title":"Mach. Learn."},{"key":"454_CR28","doi-asserted-by":"publisher","unstructured":"Yun, S., Jeong, M., Kim, R., et\u00a0al.: Graph transformer networks. In: NeurIPS (2019). https:\/\/doi.org\/10.48550\/arXiv.1911.06455","DOI":"10.48550\/arXiv.1911.06455"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-023-00454-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-023-00454-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-023-00454-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T11:17:05Z","timestamp":1723893425000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-023-00454-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,30]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["454"],"URL":"https:\/\/doi.org\/10.1007\/s41060-023-00454-0","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,30]]},"assertion":[{"value":"6 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 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":"I do not have any conflicts or competing interests to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}