{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:23:36Z","timestamp":1742948616815,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031274398"},{"type":"electronic","value":"9783031274404"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-27440-4_43","type":"book-chapter","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T20:39:41Z","timestamp":1685479181000},"page":"448-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stack Tag - Predicting the Stack Overflow Questions\u2019 Tags Using Gated Recurrent Unit Networks"],"prefix":"10.1007","author":[{"given":"Varun","family":"Prakash","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sagar","family":"Raghav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shubham","family":"Sood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mrinal","family":"Pandey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mamta","family":"Arora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,31]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Dey, R., Salem, F.M.: Gate-Variants of Gated Recurrent Unit (GRU) Neural Networks (2017). arXiv preprint arXiv","DOI":"10.1109\/MWSCAS.2017.8053243"},{"issue":"7553","key":"43_CR2","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521(7553), 436\u2013444 (2015)","journal-title":"Nature"},{"key":"43_CR3","unstructured":"Lipton, Z.C., Berkowitz, J., Elkan, C.: A critical review of recurrent neural networks for sequence learning (2015). arXiv preprint arXiv:1506.00019"},{"key":"43_CR4","doi-asserted-by":"publisher","unstructured":"Gers, F.A., Schmidhuber, J., Cummins, F.: Learning to forget: continual prediction with LSTM. In: 1999 Ninth International Conference on Artificial Neural Networks ICANN 1999. (Conf. Publ. No. 470), Edinburgh, UK, vol. 2, pp. 850\u2013855 (1999). https:\/\/doi.org\/10.1049\/cp:19991218","DOI":"10.1049\/cp:19991218"},{"issue":"5","key":"43_CR5","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1136\/amiajnl-2011-000464","volume":"18","author":"PM Nadkarni","year":"2011","unstructured":"Nadkarni, P.M., Ohno-Machado, L., Chapman, W.W.: Natural language processing: an introduction. J. Am. Med. Inform. Assoc. 18(5), 544\u2013551 (2011)","journal-title":"J. Am. Med. Inform. Assoc."},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"110505","DOI":"10.1016\/j.jss.2019.110505","volume":"162","author":"K Alrashedy","year":"2020","unstructured":"Alrashedy, K., Dharmaretnam, D., German, D.M., Venkatesh Srinivasan, T., Gulliver, A.: SCC++: predicting the programming language of questions and snippets of stack overflow. J. Syst. Softw. 162, 110505 (2020). https:\/\/doi.org\/10.1016\/j.jss.2019.110505","journal-title":"J. Syst. Softw."},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Venigalla, A.S.M., Lakkundi, C.S., Chimalakonda, S.: SOTagger - towards classifying stack overflow posts through contextual tagging (2019)","DOI":"10.18293\/SEKE2019-067"},{"key":"43_CR8","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-66562-7_15","volume-title":"Advances in Computing","author":"JF Baquero","year":"2017","unstructured":"Baquero, J.F., Camargo, J.E., Restrepo-Calle, F., Aponte, J.H., Gonz\u00e1lez, F.A.: Predicting the programming language: extracting knowledge from stack overflow posts. In: Solano, A., Ordo\u00f1ez, H. (eds.) CCC 2017. CCIS, vol. 735, pp. 199\u2013210. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66562-7_15"},{"key":"43_CR9","unstructured":"Stanley, C.: Predicting tags for stackoverflow posts (2013)"},{"key":"43_CR10","unstructured":"Lakshmi, V., Prabha, V., Udayakumar, P., Swetha, N., Chiranji, L., Chowdhary, C.: Stack overflow tag prediction using deep learning algorithm. Int. J. Sci. Res., 2455\u20136211 (2021)"},{"key":"43_CR11","doi-asserted-by":"publisher","unstructured":"Xu, B., Shirani, R., Lo, D., Alipour, M.: Prediction of relatedness in stack overflow: deep learning vs. SVM: a reproducibility study, pp. 1\u201310 (2018). https:\/\/doi.org\/10.1145\/3239235.3240503","DOI":"10.1145\/3239235.3240503"},{"key":"43_CR12","unstructured":"https:\/\/www.kaggle.com\/stackoverflow\/stacksample"},{"key":"43_CR13","unstructured":"Pascanu, R., Mikolov, T., Bengio, Y.: On the difficulty of training recurrent neural networks. In: 30th International Conference on Machine Learning, ICML 2013 (2013)"},{"key":"43_CR14","unstructured":"Phi, M.: Illustrated guide to LSTM\u2019s and GRU\u2019s: a step by step explanation (2018)"},{"key":"43_CR15","unstructured":"Agarap, A.F.: Deep Learning using Rectified Linear Units (ReLU) (2018)"},{"key":"43_CR16","unstructured":"Ioffe, S., Szegedy, C.: Batch normalization: accelerating deep network training by reducing internal covariate shift (2015). arXiv preprint arXiv:1502.03167"},{"key":"43_CR17","first-page":"1603","volume":"23","author":"R Memisevic","year":"2010","unstructured":"Memisevic, R., Zach, C., Hinton, G., Pollefeys, M.: Gated softmax classification. Neural Inf. Proc. Syst. 23, 1603\u20131611 (2010)","journal-title":"Neural Inf. Proc. Syst."},{"key":"43_CR18","unstructured":"Goldsborough, P.: A tour of tensorflow (2016)"},{"key":"43_CR19","unstructured":"Rosebrock, A.: Keras: multiple outputs and multiple losses (2018)"},{"key":"43_CR20","unstructured":"Kohavi, R.: A study of cross-validation and bootstrap for accuracy estimation and model selection (2001)"}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Systems Design and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27440-4_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T20:47:28Z","timestamp":1685479648000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27440-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031274398","9783031274404"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27440-4_43","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Systems Design and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isda2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mirlabs.net\/isda22\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}