{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T15:15:21Z","timestamp":1781622921748,"version":"3.54.5"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,10,13]],"date-time":"2015-10-13T00:00:00Z","timestamp":1444694400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004083","name":"Ministry of Science ICT and Future Planning (KR)","doi-asserted-by":"publisher","award":["10041244"],"award-info":[{"award-number":["10041244"]}],"id":[{"id":"10.13039\/501100004083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10115-015-0893-9","type":"journal-article","created":{"date-parts":[[2015,10,13]],"date-time":"2015-10-13T18:43:15Z","timestamp":1444761795000},"page":"679-705","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Cost-aware triage ranking algorithms for bug reporting systems"],"prefix":"10.1007","volume":"48","author":[{"given":"Jin-woo","family":"Park","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mu-Woong","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinhan","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seung-won","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sunghun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,10,13]]},"reference":[{"key":"893_CR1","doi-asserted-by":"crossref","unstructured":"Park J, Lee M-W, Kim J, Hwang S, Kim S (2011) Costriage: a cost-aware triage algorithm for bug reporting systems. In: AAAI","DOI":"10.1609\/aaai.v25i1.7839"},{"key":"893_CR2","unstructured":"Anvik J (2007) Assisting bug report triage through recommendation. PhD thesis, University of British Columbia"},{"key":"893_CR3","doi-asserted-by":"crossref","unstructured":"Jeong G, Kim S, Zimmermann T (2009) Improving bug triage with bug tossing graphs. In: ESEC\/FSE","DOI":"10.1145\/1595696.1595715"},{"key":"893_CR4","doi-asserted-by":"crossref","unstructured":"Guo PJ, Zimmermann T, Nagappan N, Murphy B (2010) Characterizing and predicting which bugs get fixed: an empirical study of microsoft windows. In: ICSE","DOI":"10.1145\/1806799.1806871"},{"key":"893_CR5","doi-asserted-by":"crossref","unstructured":"Anvik J, Hiew L, Murphy GC (2006) Who should fix this bug? In: ICSE","DOI":"10.1145\/1134285.1134336"},{"key":"893_CR6","doi-asserted-by":"crossref","unstructured":"Anvik J, Murphy GC (2011) Reducing the effort of bug report triage: recommenders for development-oriented decisions. ACM Trans Softw Eng Methodol 20(3):10","DOI":"10.1145\/2000791.2000794"},{"key":"893_CR7","unstructured":"\u010cubrani\u0107 D (2004) Automatic bug triage using text categorization. In: SEKE"},{"key":"893_CR8","doi-asserted-by":"crossref","unstructured":"Canfora G, Cerulo L (2006) Supporting change request assignment in open source development. In: Proceedings of the 2006 ACM symposium on applied computing","DOI":"10.1145\/1141277.1141693"},{"key":"893_CR9","unstructured":"Canfora G, Cerulo L (2005) How software repositories can help in resolving a new change request. In: Workshop on empirical studies in reverse engineering"},{"key":"893_CR10","doi-asserted-by":"crossref","unstructured":"di Lucca G (2002) An approach to classify software maintenance requests. In: ICSM","DOI":"10.1109\/ICSM.2002.1167756"},{"key":"893_CR11","doi-asserted-by":"crossref","unstructured":"Matter D, Kuhn A, Nierstrasz O (2009) Assigning bug reports using a vocabulary-based expertise model of developers. In: MSR","DOI":"10.1109\/MSR.2009.5069491"},{"key":"893_CR12","doi-asserted-by":"crossref","unstructured":"Tamrawi A, Nguyen TT, Al-Kofahi JM, Nguyen TN (2011) Fuzzy set and cache-based approach for bug triaging. In: ESEC\/FSE","DOI":"10.1145\/2025113.2025163"},{"key":"893_CR13","doi-asserted-by":"crossref","unstructured":"Kim S, Whitehead EJ Jr (2006) How long did it take to fix bugs? In: MSR","DOI":"10.1145\/1137983.1138027"},{"key":"893_CR14","doi-asserted-by":"crossref","unstructured":"Weiss C, Premraj R, Zimmermann T, Zeller A (2007) How long will it take to fix this bug? In: MSR","DOI":"10.1109\/MSR.2007.13"},{"key":"893_CR15","doi-asserted-by":"crossref","unstructured":"Rahman MM, Ruhe G, Zimmermann T (2009) Optimized assignment of developers for fixing bugs an initial evaluation for eclipse projects. In: ESEM","DOI":"10.1109\/ESEM.2009.5316025"},{"key":"893_CR16","unstructured":"Blei DM, Ng AY, Jordan MI (2003) Latent dirichlet allocation. J Mach Learn Res 3:993\u20131022"},{"key":"893_CR17","doi-asserted-by":"crossref","unstructured":"Bettenburg N, Premraj R, Zimmermann T, Kim Sunghun (2008) Duplicate bug reports considered harmful... really? In: ICSM","DOI":"10.1109\/ICSM.2008.4658082"},{"key":"893_CR18","doi-asserted-by":"crossref","unstructured":"Chen L, Wang X, Liu C (2011) An approach to improving bug assignment with bug tossing graphs and bug similarities. J Softw 6(3):421\u2013427","DOI":"10.4304\/jsw.6.3.421-427"},{"key":"893_CR19","unstructured":"Xuan J, Jiang H, Ren Z, Yan J, Luo Z (2010) Automatic bug triage using semi-supervised text classification. In: SEKE"},{"key":"893_CR20","doi-asserted-by":"crossref","unstructured":"Bhattacharya P, Neamtiu I (2010) Fine-grained incremental learning and multi-feature tossing graphs to improve bug triaging. In: ICSM","DOI":"10.1109\/ICSM.2010.5609736"},{"key":"893_CR21","doi-asserted-by":"crossref","unstructured":"Lin Z, Shu F, Yang Y, Hu C, Wang Q (2009) An empirical study on bug assignment automation using chinese bug data. In: ESEM","DOI":"10.1109\/ESEM.2009.5315994"},{"key":"893_CR22","doi-asserted-by":"crossref","unstructured":"Kim J, Lee S, Hwang S, Kim S (2009) Adding examples into java documents. In: ASE","DOI":"10.1109\/ASE.2009.39"},{"key":"893_CR23","doi-asserted-by":"crossref","unstructured":"Kim J, Lee S, Hwang S, Kim S (2010) Towards an intelligent code search engine. In: AAAI","DOI":"10.1609\/aaai.v24i1.7503"},{"key":"893_CR24","doi-asserted-by":"crossref","unstructured":"Kim J, Lee S, Hwang S, Kim S (2013) Enriching documents with examples: a corpus mining approach. ACM Trans Inf Syst 31(1):1","DOI":"10.1145\/2414782.2414783"},{"key":"893_CR25","doi-asserted-by":"crossref","unstructured":"Lee M-W, Roh J-W, Hwang S, Kim S (2010) Instant code clone search. In: FSE","DOI":"10.1145\/1882291.1882317"},{"key":"893_CR26","doi-asserted-by":"crossref","unstructured":"Park J, Lee M-W, Roh J-W, Hwang S, Kim S (2014) Surfacing code in the dark: an instant clone search approach. Knowl Inf Syst 41(3):727\u2013759","DOI":"10.1007\/s10115-013-0677-z"},{"key":"893_CR27","unstructured":"Melville P, Mooney RJ, Nagarajan R (2002) Content-boosted collaborative filtering for improved recommendations. In: AAAI"},{"key":"893_CR28","doi-asserted-by":"crossref","unstructured":"Arun R, Suresh V, Veni Madhavan CE, Narasimha Murthy MN (2010) On finding the natural number of topics with latent dirichlet allocation: some observations. In: PAKDD","DOI":"10.1007\/978-3-642-13657-3_43"},{"key":"893_CR29","doi-asserted-by":"crossref","unstructured":"Cao J, Xia T, Li J, Zhang Y, Tang S (2009) A density-based method for adaptive lda model selection. Neurocomputing 72(7\u20139):1775\u20131781","DOI":"10.1016\/j.neucom.2008.06.011"},{"key":"893_CR30","doi-asserted-by":"crossref","unstructured":"Zavitsanos E, Petridis S, Paliouras G, Vouros GA (2008) Determining automatically the size of learned ontologies. In: ECAI","DOI":"10.3233\/978-1-58603-891-5-775"},{"key":"893_CR31","doi-asserted-by":"crossref","unstructured":"Herlocker J, Konstan JA, Riedl J (2002) An empirical analysis of design choices in neighborhood-based collaborative filtering algorithms. Inf Retr 5(4):287\u2013310","DOI":"10.1023\/A:1020443909834"},{"key":"893_CR32","doi-asserted-by":"crossref","unstructured":"Ma H, King I, Lyu MR (2007) Effective missing data prediction for collaborative filtering. In: SIGIR","DOI":"10.1145\/1277741.1277751"},{"key":"893_CR33","doi-asserted-by":"crossref","unstructured":"Allan J (1996) Incremental relevance feedback for information filtering. In: SIGIR","DOI":"10.1145\/243199.243274"},{"key":"893_CR34","unstructured":"Chen Z, Jiang Y, Zhao Y (2010) A collaborative filtering recommendation algorithm based on user interest change and trust evaluation. In: JDCTA"},{"key":"893_CR35","doi-asserted-by":"crossref","unstructured":"Lathia N, Hailes S, Capra L, Amatriain X (2010) Temporal diversity in recommender systems. In: SIGIR","DOI":"10.1145\/1835449.1835486"},{"key":"893_CR36","unstructured":"Cavnar WB, Trenkle JM (1994) N-gram-based text categorization. In: SDAIR"},{"key":"893_CR37","doi-asserted-by":"crossref","unstructured":"Bettenburg N, Premraj R, Zimmermann T, Kim S (2008) Extracting structural information from bug reports. In: MSR","DOI":"10.1145\/1370750.1370757"},{"key":"893_CR38","unstructured":"Microsoft (2010) Windows error reporting: getting started. http:\/\/www.microsoft.com\/whdc\/winlogo\/maintain\/StartWER.mspx"},{"key":"893_CR39","unstructured":"Mozilla (2010) Crash stats. http:\/\/crash-stats.mozilla.com"},{"key":"893_CR40","unstructured":"Apple (2010) Technical note TN2123: CrashReporter"},{"key":"893_CR41","doi-asserted-by":"crossref","unstructured":"Tai K-C (1979) The tree-to-tree correction problem. J Assoc Comput Mach","DOI":"10.1145\/322139.322143"},{"key":"893_CR42","doi-asserted-by":"crossref","unstructured":"Chen W (2001) New algorithm for ordered tree-to-tree correction problem. J Algorithms 40(2):135\u2013158","DOI":"10.1006\/jagm.2001.1170"},{"key":"893_CR43","doi-asserted-by":"crossref","unstructured":"Demaine ED, Mozes S, Rossman B, Weimann O (2009) An optimal decomposition algorithm for tree edit distance. ACM Trans Algorithms 6(1):2","DOI":"10.1145\/1644015.1644017"},{"key":"893_CR44","doi-asserted-by":"crossref","unstructured":"Dulucq S, Touzet H (2003) Analysis of tree edit distance algorithms. In: CPM","DOI":"10.1007\/3-540-44888-8_7"},{"key":"893_CR45","doi-asserted-by":"crossref","unstructured":"Klein PN (1998) Computing the edit-distance between unrooted ordered trees. In: Proceedings of the 6th annual European symposium on algorithms","DOI":"10.1007\/3-540-68530-8_8"},{"key":"893_CR46","doi-asserted-by":"crossref","unstructured":"Zhang K, Shasha D (1989) Simple fast algorithms for the editing distance between trees and related problems. SIAM J Comput 18(6):1245\u20131262","DOI":"10.1137\/0218082"},{"key":"893_CR47","doi-asserted-by":"crossref","unstructured":"Bremner D, Demaine E, Erickson J, Iacono J, Langerman S, Morin P, Toussaint G (2005) Output-sensitive algorithms for computing nearest-neighbour decision boundaries. In: Algorithms and Data Structures. Proceedings of 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30-August 1,2003. Springer, Heidelberg, pp 451\u2013461","DOI":"10.1007\/s00454-004-1152-0"},{"key":"893_CR48","doi-asserted-by":"crossref","unstructured":"Coomans D, Massart DL (1982) Alternative k-nearest neighbour rules in supervised pattern recognition: Part 1. k-Nearest neighbour classification by using alternative voting rules. Anal Chim Acta","DOI":"10.1016\/S0003-2670(01)85299-5"},{"key":"893_CR49","doi-asserted-by":"crossref","unstructured":"Cover T, Hart P (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13(1):21\u201327","DOI":"10.1109\/TIT.1967.1053964"},{"key":"893_CR50","volume-title":"Smoothing, forecasting and prediction of discrete time series","author":"RG Brown","year":"1963","unstructured":"Brown RG (1963) Smoothing, forecasting and prediction of discrete time series. Prentice-Hall, Englewood Cliffs"},{"key":"893_CR51","doi-asserted-by":"crossref","unstructured":"Weron R, Weron K, Weron A (1999) A conditionally exponential decay approach to scaling in finance. Phys A Stat Theor Phys 264(3\u20134):551\u2013561","DOI":"10.1016\/S0378-4371(98)00547-0"},{"key":"893_CR52","unstructured":"Han J, Kamber M (2006) Data mining: concepts and techniques"},{"key":"893_CR53","doi-asserted-by":"crossref","unstructured":"Jiang L, Misherghi G, Su Z, Glondu S (2007) Deckard: scalable and accurate tree-based detection of code clones. In: ICSE","DOI":"10.1109\/ICSE.2007.30"},{"key":"893_CR54","doi-asserted-by":"crossref","unstructured":"Bettenburg N, Just S, Schr\u00f6ter A, Weiss C, Premraj R, Zimmermann T (2008) What makes a good bug report? In: SIGSOFT FSE","DOI":"10.1145\/1453101.1453146"},{"key":"893_CR55","doi-asserted-by":"crossref","unstructured":"Hooimeijer P, Weimer W (2007) Modeling bug report quality. In: ASE","DOI":"10.1145\/1321631.1321639"},{"key":"893_CR56","doi-asserted-by":"crossref","unstructured":"Aranda J, Venolia G (2009) The secret life of bugs: going past the errors and omissions in software repositories. In: ICSE","DOI":"10.1109\/ICSE.2009.5070530"},{"key":"893_CR57","doi-asserted-by":"crossref","unstructured":"Giger E, Pinzger M, Gall H (2010) Predicting the fix time of bugs. In: RSSE","DOI":"10.1145\/1808920.1808933"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0893-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0893-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0893-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T00:51:46Z","timestamp":1748652706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0893-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,13]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["893"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0893-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,13]]}}}