A Detection System of Dependent Relationships among Bug Report Threads

カテゴリ: 研究会(論文単位)

論文No: IS11012

グループ名: 【C】電子・情報・システム部門 情報システム研究会

発行日: 2011/04/14

タイトル(英語): A Detection System of Dependent Relationships among Bug Report Threads

著者名: Imanara Yuuki(Osaka University),Itakura Kota(Osaka University),Samejima Masaki(Osaka University),Akiyoshi Masanori(Osaka University)

著者名(英語): Imanara Yuuki(Osaka University),Itakura Kota(Osaka University),Samejima Masaki(Osaka University),Akiyoshi Masanori(Osaka University)

キーワード: Ｂｕｇ　ｔｈｒｅａｄｓ|Ｂｕｇ　ｔｒａｃｋｉｎｇ　ｓｙｓｔｅｍ|Ｄｅｐｅｎｄｅｎｔ　ｒｅｌａｔｉｏｎｓｈｉｐｓ|Ｃｏｓｉｎｅ　ｓｉｍｉｌａｒｉｔｙ|Bug threads|Bug tracking system|Dependent relationships|Cosine similarity

要約(日本語): This paper addresses detecting the dependent relationships among bug report threads in the bug tracking systems. It takes much time for developers to detect dependent relationships of the bug threads in case that many bug threads exist. Because some words are omitted in the bug threads or the degrees of abstraction of the bugs are different, the accuracy of the detection by the existing method is not so good. The proposed system first distributes the input threads to similar dependency graphs by using other bug threads for complementing the omitted words. Since abstractly or specifically written threads often have dependent relationships each other, the proposed method decides the dependent relationships based on similarities weighted by the dependent bug threads. As a result of experiments, 26% dependent bug threads can be detected automatically. Finally, we discuss the future issues based on the result.

要約(英語): This paper addresses detecting the dependent relationships among bug report threads in the bug tracking systems. It takes much time for developers to detect dependent relationships of the bug threads in case that many bug threads exist. Because some words are omitted in the bug threads or the degrees of abstraction of the bugs are different, the accuracy of the detection by the existing method is not so good. The proposed system first distributes the input threads to similar dependency graphs by using other bug threads for complementing the omitted words. Since abstractly or specifically written threads often have dependent relationships each other, the proposed method decides the dependent relationships based on similarities weighted by the dependent bug threads. As a result of experiments, 26% dependent bug threads can be detected automatically. Finally, we discuss the future issues based on the result.

原稿種別: 日本語

PDFファイルサイズ: 629 Kバイト