{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T03:40:26Z","timestamp":1760499626528,"version":"build-2065373602"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T00:00:00Z","timestamp":1752624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T00:00:00Z","timestamp":1752624000000},"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":["Innovations Syst Softw Eng"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11334-025-00612-6","type":"journal-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T07:08:45Z","timestamp":1752649725000},"page":"1399-1432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing developer assignments in software bug repositories"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3081-1085","authenticated-orcid":false,"given":"Neetu","family":"Singh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2781-8684","authenticated-orcid":false,"given":"Sandeep Kumar","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"612_CR1","doi-asserted-by":"publisher","unstructured":"[Singh, 21] Singh N, Singh SK (2021) MABTriage: multi armed bandit triaging model approach. ACM Int Conf Proceeding Ser, pp. 457\u2013460. https:\/\/doi.org\/10.1145\/3474124.3474194.","DOI":"10.1145\/3474124.3474194"},{"key":"612_CR2","doi-asserted-by":"crossref","unstructured":"[Zaidi, 22] Zaidi SFA, Woo H, Lee CG (2022) Toward an effective bug triage system using transformers to add new developers. Journal of Sensors 2022.","DOI":"10.1155\/2022\/4347004"},{"issue":"4","key":"612_CR3","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/s10664-022-10133-6","volume":"27","author":"A Tagra","year":"2022","unstructured":"Tagra A et al (2022) Revisiting reopened bugs in open source software systems. Empir Softw Eng 27(4):92","journal-title":"Empir Softw Eng"},{"key":"612_CR4","doi-asserted-by":"publisher","unstructured":"[Singh, 1] Singh N, Singh SK. An empirical assessment of the performance of multi-armed bandits and contextual multi-armed bandits in handling cold-start bugs. vol. 1, no. 1. Association for Computing Machinery. https:\/\/doi.org\/10.1145\/3607947.3608094.","DOI":"10.1145\/3607947.3608094"},{"key":"612_CR5","unstructured":"[Besbes, 14] Besbes O, Gur Y, Zeevi A (2014) Stochastic multi-armed-bandit problem with non-stationary rewards, Advances in neural information processing systems 27."},{"key":"612_CR6","unstructured":"[Farajtabar, 18] Farajtabar M, Chow Y, Ghavamzadeh M (2018) More robust doubly robust off-policy evaluation. In: 35th International Conference on Machine Learning. ICML. vol. 4, pp. 2342\u20132371."},{"key":"612_CR7","doi-asserted-by":"crossref","unstructured":"[Gupta, 11] Gupta, N., Granmo, O.-C., Agrawala, A.: Thompson sampling for dynamic multi-armed bandits, 2011 10th International Conference on Machine Learning and Applications and Workshops, Vol. 1. IEEE, 2011.","DOI":"10.1109\/ICMLA.2011.144"},{"key":"612_CR8","unstructured":"[[van Emden, 18] van Emden R, Kaptein M (2018) Contextual: evaluating contextual multi-armed bandit problems in R. [Online]. Available: http:\/\/arxiv.org\/abs\/1811.01926."},{"issue":"7","key":"612_CR9","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1080\/08839514.2021.1883855","volume":"35","author":"A Pilani","year":"2021","unstructured":"Pilani A et al (2021) Contextual bandit approach-based recommendation system for personalized web-based services. Appl Artif Intell 35(7):489\u2013504","journal-title":"Appl Artif Intell"},{"key":"612_CR10","unstructured":"[Valko, 13] Valko M et al. (2013) Finite-time analysis of kernelised contextual bandits, arXiv preprint arXiv:1309.6869."},{"key":"612_CR11","doi-asserted-by":"publisher","unstructured":"[Li, 10] Li L, Chu W, Langford J, Schapire RE (2010) A contextual-bandit approach to personalized news article recommendation, https:\/\/doi.org\/10.1145\/1772690.1772758","DOI":"10.1145\/1772690.1772758"},{"key":"612_CR12","unstructured":"[Agrawal, 16] Agrawal S, Devanur N (2016) Linear contextual bandits with knapsacks. Advances in Neural Information Processing Systems 29."},{"key":"612_CR13","unstructured":"[Agarwal, 14] Agarwal A et al. (2014) Taming the monster: a fast and simple algorithm for contextual bandits. International Conference on Machine Learning. PMLR."},{"key":"612_CR14","doi-asserted-by":"crossref","unstructured":"[Bouneffouf, 14] Bouneffouf D, et al. (2014) Contextual Bandit for Active Learning: Active Thompson Sampling. [Online]. Available: https:\/\/hal.archives-ouvertes.fr\/hal-01069802","DOI":"10.1007\/978-3-319-12637-1_51"},{"key":"612_CR15","unstructured":"https:\/\/bugzilla.mozilla.org\/buglist.cgi?cmdtype=dorem&remaction=run&namedcmd=Bugs%20Filed%20Today&sharer_id=1&list_id=17258195"},{"key":"612_CR16","doi-asserted-by":"crossref","unstructured":"[Singh, 24] Singh N, Singh SK (2024) Navigating bug cold start with contextual multi-armed bandits: an enhanced approach to developer assignment in software bug repositories. Manuscript under publication.","DOI":"10.1007\/s10515-025-00508-6"},{"key":"612_CR17","unstructured":"[Zhang, 19] Zhang C et al. (2019) Warm-starting contextual bandits: robustly combining supervised and bandit feedback. arXiv preprint arXiv:1901.00301."},{"key":"612_CR18","doi-asserted-by":"crossref","unstructured":"[Al-Taani, 22] Al-Taani AT, Al-Sayadi SH (2022) Extractive text summarization of Arabic multi-document using fuzzy C-means and Latent Dirichlet Allocation. International Journal of System Assurance Engineering and Management. 1\u201314.","DOI":"10.1007\/s13198-022-01783-2"},{"key":"612_CR19","doi-asserted-by":"publisher","unstructured":"[Zaidi, 22] Zaidi SFA, Woo H, Lee CG (2022) Toward an effective bug triage system using transformers to add new developers, J. Sensors. vol. 2022. https:\/\/doi.org\/10.1155\/2022\/4347004.","DOI":"10.1155\/2022\/4347004"},{"key":"612_CR20","unstructured":"[Kveton, 19] Kveton, B., et al.: Garbage in, reward out: Bootstrapping exploration in multi-armed bandits. International Conference on Machine Learning. PMLR, 2019."},{"issue":"4","key":"612_CR21","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1109\/TLT.2012.11","volume":"5","author":"K Verbert","year":"2012","unstructured":"Verbert K et al (2012) Context-aware recommender systems for learning: A survey and future challenges. IEEE Trans Learn Technol 5(4):318\u2013335. https:\/\/doi.org\/10.1109\/TLT.2012.11","journal-title":"IEEE Trans Learn Technol"},{"key":"612_CR22","doi-asserted-by":"publisher","unstructured":"[Revathy, 19] Revathy VR, Anitha SP (2019) Cold start problem in social recommender systems: State-of-the-art review, vol. 759. Springer Singapore. https:\/\/doi.org\/10.1007\/978-981-13-0341-8_10.","DOI":"10.1007\/978-981-13-0341-8_10"},{"key":"612_CR23","doi-asserted-by":"crossref","unstructured":"[Bouneffouf, 17] Bouneffouf D, Rish I, Cecchi GA, Feraud R (2017) Context attentive bandits: contextual bandit with restricted context. [Online]. Available: http:\/\/arxiv.org\/abs\/1705.03821","DOI":"10.24963\/ijcai.2017\/203"},{"key":"612_CR24","unstructured":"[Wu, 19] Wu Q, Liu Y, Miao C, Zhao Y, Guan L, Tang H (2019) Recent advances in diversified recommendation. [Online]. Available: http:\/\/arxiv.org\/abs\/1905.06589"},{"key":"612_CR25","doi-asserted-by":"publisher","unstructured":"[Wang, 17] Wang L, Wang C, Wang K, He X (2017) BiUCB: a contextual bandit algorithm for cold-start and diversified recommendation. In: Proceedings-2017 IEEE International Conference on Big Knowledge, ICBK 2017. pp. 248\u2013253. https:\/\/doi.org\/10.1109\/ICBK.2017.49.","DOI":"10.1109\/ICBK.2017.49"},{"key":"612_CR26","unstructured":"[Zhou, 15] Zhou L (2015) A Survey on Contextual Multi-armed Bandits. [Online]. Available: http:\/\/arxiv.org\/abs\/1508.03326"},{"key":"612_CR27","doi-asserted-by":"crossref","unstructured":"[Fel\u00edcio, 17] Fel\u00edcio CZ et al. (2017) A multi-armed bandit model selection for cold-start user recommendation. Proceedings of the 25th Conference on User Modeling, Adaptation and Personalization.","DOI":"10.1145\/3079628.3079681"},{"key":"612_CR28","doi-asserted-by":"publisher","unstructured":"[Fel\u00edcio, 17] Fel\u00edcio CZ, Paix\u00e3o KVR, Barcelos CAZ, Preux P (2017) A multi-Armed bandit model selection for cold-start user recommendation, UMAP 2017-Proc 25th Conf User Model Adapt Pers. pp. 32\u201340. https:\/\/doi.org\/10.1145\/3079628.3079681.","DOI":"10.1145\/3079628.3079681"},{"key":"612_CR29","unstructured":"[Lovato, 13] Lovato P (2013) Multi-armed bandit problem and its applications in reinforcement learning. Profs Sci Univr It. pp. 1\u201325, [Online]. Available: http:\/\/profs.sci.univr.it\/~farinelli\/courses\/ddrMAS\/slides\/Bandit.pdf"},{"key":"612_CR30","unstructured":"[Rao, 20] Rao D Jagdish (2020) Contextual Bandits for adapting to changing User preferences over time"},{"issue":"2","key":"612_CR31","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1287\/ijoc.1080.0305","volume":"21","author":"A Gosavi","year":"2009","unstructured":"Gosavi A (2009) Reinforcement learning: a tutorial survey and recent advances. Informs J Comput 21(2):178\u2013192. https:\/\/doi.org\/10.1287\/ijoc.1080.0305","journal-title":"Informs J Comput"},{"key":"612_CR32","doi-asserted-by":"publisher","unstructured":"[Morales, 11] Morales EF, Zaragoza JH (2011) An introduction to reinforcement learning, Decis Theory Model Appl Artif Intell Concepts Solut, pp. 63\u201380. https:\/\/doi.org\/10.4018\/978-1-60960-165-2.ch004.","DOI":"10.4018\/978-1-60960-165-2.ch004"},{"key":"612_CR33","unstructured":"[Emden, 18] Emden R, van Kaptein M (2018) Contextual: evaluating contextual multi-armed bandit problems in R. arXiv preprint arXiv:1811.01926"},{"key":"612_CR34","unstructured":"[Dudik, 11] Dudik M, Langford J, Li H (2011) Doubly robust policy evaluation and learning. Proc 28th Int Conf Mach Learn ICML. pp. 1097\u20131104."},{"key":"612_CR35","unstructured":"Barocas S, Hardt M, and Narayanan A (2019) Fairness and machine learning."},{"key":"612_CR36","unstructured":"[Bietti, 21] Bietti A, Agarwal A, Langford J (2021) A contextual bandit bake-off. J Mach Learn Res. vol. 22. [Online]. Available: http:\/\/arxiv.org\/abs\/1802.04064."},{"issue":"4","key":"612_CR37","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/stsy.2019.0033","volume":"9","author":"O Besbes","year":"2019","unstructured":"Besbes O, Gur Y, Zeevi A (2019) Optimal exploration-exploitation in a multi-armed bandit problem with non-stationary rewards. Stoch Syst 9(4):319\u2013337. https:\/\/doi.org\/10.1287\/stsy.2019.0033","journal-title":"Stoch Syst"},{"key":"612_CR38","doi-asserted-by":"publisher","unstructured":"[Guo, 20] Guo D, et al. (2020) Deep Bayesian bandits: exploring in online personalized recommendations. In: RecSys 2020-14th ACM Conference on Recommender Systems. pp. 456\u2013461. https:\/\/doi.org\/10.1145\/3383313.3412214.","DOI":"10.1145\/3383313.3412214"},{"key":"612_CR39","doi-asserted-by":"crossref","unstructured":"[Tufano, 22] Tufano R, Scalabrino S, Pascarella L, Aghajani E, Oliveto R, Bavota G (2022) Using reinforcement learning for load testing of video games. [Online]. Available: http:\/\/arxiv.org\/abs\/2201.06865.","DOI":"10.1145\/3510003.3510625"},{"key":"612_CR40","first-page":"1225","volume":"12","author":"DM Blei","year":"2017","unstructured":"Blei DM, Koller D, McAuliffe JD (2017) Variational inference for a nonconjugate Dirichlet process. J Mach Learn Res 12:1225\u20131257","journal-title":"J Mach Learn Res"},{"key":"612_CR41","first-page":"1","volume":"20","author":"R Feldman","year":"2019","unstructured":"Feldman R, Dagan I (2019) Beyond the bag-of-words: the importance of contextual information in text classification. J Mach Learn Res 20:1\u201340","journal-title":"J Mach Learn Res"},{"issue":"3","key":"612_CR42","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1145\/230538.230561","volume":"14","author":"B Friedman","year":"1996","unstructured":"Friedman B, Nissenbaum H (1996) Bias in computer systems. ACM Trans Inf Syst 14(3):330\u2013347","journal-title":"ACM Trans Inf Syst"},{"issue":"8","key":"612_CR43","first-page":"45","volume":"43","author":"A Kobsa","year":"2001","unstructured":"Kobsa A (2001) Personalization in electronic commerce and its relationship with privacy. Commun ACM 43(8):45\u201348","journal-title":"Commun ACM"},{"key":"612_CR44","doi-asserted-by":"crossref","unstructured":"[Wei, 18] Wei L, Srivatsva V (2018) On abruptly-changing and slowly-varying multiarmed bandit problems. 2018 Annual American Control Conference (ACC). IEEE","DOI":"10.23919\/ACC.2018.8431265"},{"key":"612_CR45","unstructured":"[Dutta, 19] Dutta P, et al. (2019) AutoML for Contextual Bandits, arXiv preprint arXiv:1909.03212"},{"key":"612_CR46","doi-asserted-by":"crossref","unstructured":"[He, 20] He X, et al. 2020 Contextual user browsing bandits for large-scale online mobile recommendation. Proceedings of the 14th ACM Conference on Recommender Systems.","DOI":"10.1145\/3383313.3412234"},{"key":"612_CR47","unstructured":"https:\/\/bugzilla.mozilla.org\/buglist.cgi?quicksearch=mozilla"},{"issue":"1-2","key":"612_CR48","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0004-3702(98)00002-2","volume":"100","author":"P Tadepalli","year":"1998","unstructured":"Tadepalli P, Ok D (1998) Model-based average reward reinforcement learning. Artif Intell 100(1\u20132):177\u2013224","journal-title":"Artif Intell"},{"key":"612_CR49","unstructured":"[VowpalWabbit, 2024] Vowpal Wabbit Documentation: Contextual Bandits and Vowpal Wabbit in Python (2024). https:\/\/vowpalwabbit.org\/docs\/vowpal_wabbit\/python\/latest\/tutorials\/python_Contextual_bandits_and_Vowpal_Wabbit.html"}],"container-title":["Innovations in Systems and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-025-00612-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11334-025-00612-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-025-00612-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T03:04:31Z","timestamp":1760497471000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11334-025-00612-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["612"],"URL":"https:\/\/doi.org\/10.1007\/s11334-025-00612-6","relation":{},"ISSN":["1614-5046","1614-5054"],"issn-type":[{"type":"print","value":"1614-5046"},{"type":"electronic","value":"1614-5054"}],"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"5 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2025","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 relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This study does not involve any human\/animal participants.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}},{"value":"This study does not involve any human\/animal participants, as a result no consent is needed.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}