{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:32:30Z","timestamp":1767339150500,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T00:00:00Z","timestamp":1605225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,13]]},"DOI":"10.1145\/3416505.3423561","type":"proceedings-article","created":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T23:01:37Z","timestamp":1604703697000},"page":"25-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["TraceSim: a method for calculating stack trace similarity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0281-672X","authenticated-orcid":false,"given":"Roman","family":"Vasiliev","sequence":"first","affiliation":[{"name":"JetBrains, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2632-3193","authenticated-orcid":false,"given":"Dmitrij","family":"Koznov","sequence":"additional","affiliation":[{"name":"Saint-Petersburg State University, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4265-9642","authenticated-orcid":false,"given":"George","family":"Chernishev","sequence":"additional","affiliation":[{"name":"Saint-Petersburg State University, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4852-4669","authenticated-orcid":false,"given":"Aleksandr","family":"Khvorov","sequence":"additional","affiliation":[{"name":"JetBrains, Russia \/ ITMO University, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6332-2360","authenticated-orcid":false,"given":"Dmitry","family":"Luciv","sequence":"additional","affiliation":[{"name":"Saint-Petersburg State University, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4894-0598","authenticated-orcid":false,"given":"Nikita","family":"Povarov","sequence":"additional","affiliation":[{"name":"JetBrains, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,11,13]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","article-title":"Finding Similar Failures Using Callstack Similarity (SysML'08)","author":"Bartz K.","year":"2008","unstructured":"K. Bartz 2008 . Finding Similar Failures Using Callstack Similarity (SysML'08) . USENIX Association , 1 - 6 . http:\/\/dl.acm.org\/citation.cfm?id= 1855895. 1855896 K. Bartz et al. 2008. Finding Similar Failures Using Callstack Similarity (SysML'08). USENIX Association, 1-6. http:\/\/dl.acm.org\/citation.cfm?id= 1855895. 1855896","journal-title":"USENIX Association"},{"key":"e_1_3_2_1_2_1","unstructured":"J. Bergstra R. Bardenet Y. Bengio and B. K\u00e9gl. 2011. Algorithms for HyperParameter Optimization ( NIPS'11). 2546-2554.  J. Bergstra R. Bardenet Y. Bengio and B. K\u00e9gl. 2011. Algorithms for HyperParameter Optimization ( NIPS'11). 2546-2554."},{"key":"e_1_3_2_1_3_1","unstructured":"J. Bergstra D. Yamins and D.D. Cox. 2013. Making a Science of Model Search: Hyperparameter Optimization in Hundreds of Dimensions for Vision Architectures (ICML'13). JMLR.org I-115-I-123.  J. Bergstra D. Yamins and D.D. Cox. 2013. Making a Science of Model Search: Hyperparameter Optimization in Hundreds of Dimensions for Vision Architectures (ICML'13). JMLR.org I-115-I-123."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICAC.2005.49"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2901739.2901766"},{"key":"e_1_3_2_1_6_1","unstructured":"M. Claesen and B. De Moor. 2015. Hyperparameter search in machine learning. arXiv preprint arXiv:1502.02127 ( 2015 ).  M. Claesen and B. De Moor. 2015. Hyperparameter search in machine learning. arXiv preprint arXiv:1502.02127 ( 2015 )."},{"key":"e_1_3_2_1_7_1","first-page":"1084","volume-title":"ReBucket: A Method for Clustering Duplicate Crash Reports Based on Call Stack Similarity (ICSE '12)","author":"Dang Y.","unstructured":"Y. Dang , R. Wu , H. Zhang , D. Zhang , and P. Nobel . 2012 . ReBucket: A Method for Clustering Duplicate Crash Reports Based on Call Stack Similarity (ICSE '12) . IEEE Press , 1084 - 1093 . http:\/\/dl.acm.org\/citation.cfm?id= 2337223. 2337364 Y. Dang, R. Wu, H. Zhang, D. Zhang, and P. Nobel. 2012. ReBucket: A Method for Clustering Duplicate Crash Reports Based on Call Stack Similarity (ICSE '12). IEEE Press, 1084-1093. http:\/\/dl.acm.org\/citation.cfm?id= 2337223. 2337364"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2017.69"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2011.6080800"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.10.010"},{"key":"e_1_3_2_1_11_1","first-page":"199","volume-title":"Cross Platform Bug Correlation Using Stack Traces ( FIT '16)","author":"Ghafoor M. A.","unstructured":"M. A. Ghafoor and J. H. Siddiqui . 2016 . Cross Platform Bug Correlation Using Stack Traces ( FIT '16) . 199 - 204 . M. A. Ghafoor and J. H. Siddiqui. 2016. Cross Platform Bug Correlation Using Stack Traces ( FIT '16). 199-204."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629586"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-018-9643-4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"S. Kim T. Zimmermann and N. Nagappan. 2011. Crash graphs: An aggregated view of multiple crashes to improve crash triage ( DSN '11). 486-493.  S. Kim T. Zimmermann and N. Nagappan. 2011. Crash graphs: An aggregated view of multiple crashes to improve crash triage ( DSN '11). 486-493.","DOI":"10.1109\/DSN.2011.5958261"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSMR.2013.17"},{"key":"e_1_3_2_1_16_1","unstructured":"V. I. Levenshtein. 1966. Binary Codes Capable of Correcting Deletions Insertions and Reversals. Soviet Physics Doklady 10 ( 1966 ) 707-710.  V. I. Levenshtein. 1966. Binary Codes Capable of Correcting Deletions Insertions and Reversals. Soviet Physics Doklady 10 ( 1966 ) 707-710."},{"key":"e_1_3_2_1_17_1","unstructured":"C. X. Ling J. Huang and H. Zhang. [n.d.]. AUC: A Statistically Consistent and More Discriminating Measure Than Accuracy (IJCAI'03). 519-524. http:\/\/dl.acm.org\/citation.cfm?id= 1630659. 1630736  C. X. Ling J. Huang and H. Zhang. [n.d.]. AUC: A Statistically Consistent and More Discriminating Measure Than Accuracy (IJCAI'03). 519-524. http:\/\/dl.acm.org\/citation.cfm?id= 1630659. 1630736"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"C. D. Manning P. Raghavan and H. Sch\u00fctze. 2008. Introduction to Information Retrieval. Cambridge University Press.  C. D. Manning P. Raghavan and H. Sch\u00fctze. 2008. Introduction to Information Retrieval. Cambridge University Press.","DOI":"10.1017\/CBO9780511809071"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2007.4401026"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.18293\/SEKE2017-135"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2017.2755005"},{"key":"e_1_3_2_1_23_1","first-page":"240","volume-title":"DURFEX: A Feature Extraction Technique for Eficient Detection of Duplicate Bug Reports ( ICSQRS '17)","author":"Sabor K. K.","year":"2017","unstructured":"K. K. Sabor 2017 . DURFEX: A Feature Extraction Technique for Eficient Detection of Duplicate Bug Reports ( ICSQRS '17) . 240 - 250 . K. K. Sabor et al. 2017. DURFEX: A Feature Extraction Technique for Eficient Detection of Duplicate Bug Reports ( ICSQRS '17). 240-250."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSR.2010.5463280"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1108\/eb026526"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"C. Sun D. Lo S. Khoo and J. Jiang. 2011. Towards more accurate retrieval of duplicate bug reports ( ASE '11). 253-262.  C. Sun D. Lo S. Khoo and J. Jiang. 2011. Towards more accurate retrieval of duplicate bug reports ( ASE '11). 253-262.","DOI":"10.1109\/ASE.2011.6100061"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"C. Sun D. Lo X. Wang J. Jiang and S. Khoo. 2010. A discriminative model approach for accurate duplicate bug report retrieval ( ICSE '10). 45-54.  C. Sun D. Lo X. Wang J. Jiang and S. Khoo. 2010. A discriminative model approach for accurate duplicate bug report retrieval ( ICSE '10). 45-54.","DOI":"10.1145\/1806799.1806811"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2610384.2610386"}],"event":{"name":"ESEC\/FSE '20: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Virtual USA","acronym":"ESEC\/FSE '20"},"container-title":["Proceedings of the 4th ACM SIGSOFT International Workshop on Machine-Learning Techniques for Software-Quality Evaluation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3416505.3423561","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3416505.3423561","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:21Z","timestamp":1750197681000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3416505.3423561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,13]]},"references-count":28,"alternative-id":["10.1145\/3416505.3423561","10.1145\/3416505"],"URL":"https:\/\/doi.org\/10.1145\/3416505.3423561","relation":{},"subject":[],"published":{"date-parts":[[2020,11,13]]},"assertion":[{"value":"2020-11-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}