Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Automated Duplicate Bug Report Classification Using Subsequence Matching (CROSBI ID 606187)

Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija

Banerjee, Sean ; Cukić, Bojan ; Adjeroh, Donald A. Automated Duplicate Bug Report Classification Using Subsequence Matching // 14th International IEEE Symposium on High-Assurance Systems Engineering, HASE 2012. New York (NY): Institute of Electrical and Electronics Engineers (IEEE), 2012

Podaci o odgovornosti

Banerjee, Sean ; Cukić, Bojan ; Adjeroh, Donald A.

engleski

Automated Duplicate Bug Report Classification Using Subsequence Matching

The use of open bug tracking repositories like Bugzilla is common in many software applications. They allow developers, testers and users the ability to report problems associated with the system and track resolution status. Open and democratic reporting tools, however, face one major challenge: users can, and often do, submit reports describing the same problem. Research in duplicate report detection has primarily focused on word frequency based similarity measures paying little regard to the context or structure of the reporting language. Thus, in large repositories, reports describing different issues may be marked as duplicates due to the frequent use of common words. In this paper, we present Factor LCS, a methodology which utilizes common sequence matching for duplicate report detection. We demonstrate the approach by analyzing the complete Fire fox bug repository up until March 2012 as well as a smaller subset of Eclipse dataset from January 1, 2008 to December 31, 2008. We achieve a duplicate recall rate above 70% with Fire fox, which exceeds the results reported on smaller subsets of the same repository.

Documentation; Duplicate Bug Reports; Experimentation; String Algorithms; Verification

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o prilogu

2012.

objavljeno

Podaci o matičnoj publikaciji

14th International IEEE Symposium on High-Assurance Systems Engineering, HASE 2012

New York (NY): Institute of Electrical and Electronics Engineers (IEEE)

978-1-4673-4742-6

Podaci o skupu

14th International IEEE Symposium on High-Assurance Systems Engineering, HASE 2012

predavanje

25.10.2012-27.10.2012

Omaha (NE), Sjedinjene Američke Države

Povezanost rada

Računarstvo