Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/274054
Title: | Bug Summarization Severity Classification and Assignment for Automated Bug Resolution Process |
Researcher: | Ashima |
Guide(s): | Kumar, Yugal and Mohana, Rajni |
Keywords: | Ant Colony Optimization Bug Report Summarization Engineering and Technology,Computer Science,Computer Science Cybernetics Naïve Bayes Particle Swarm Optimization Random Forest Software Engineering Support Vector Machine |
University: | Jaypee University of Information Technology, Solan |
Completed Date: | 2019 |
Abstract: | Bug resolution process is an important aspect of the software development life cycle(SDLC). The aim of bug resolution process (BRP) is to determine the bugs in software and fix it. These software bugs are introduced in software s during the different phases of SDLC process. The different strategies and mechanisms are considered during the evolution of software to overcome the propagation of bugs. A significant amount of time, cost and effort is put on the identification of bugs. It is observed that some bugs are not identified during the software evolution. These bugs can lead to failure of software s and unexpected behavior. So, prior to delivery of software s, every company ensure that the software is bug free and meets it expectation. Hence, to address and manage the bugs, bug tracking or reporting system are designed such as Mozilla, Eclipse etc. These bug tracking systems store the information related to bugs, called bug repositories. The valuable information regarding for fixing the bugs are described in repositories. This information can be used to automate the BRP and also help developers in terms of reduced time and effort. The BRP is described in terms of report summarization, severity classification and assignment. This thesis addresses the issues associated with bug report summarization, bug severity classification and bug assignment. Bug report summarization is the process of generating the short description of lengthy bugs. To resolve the bug, initially developer analyses and understands the content of bug report and make a summary set. This process is time consuming and tedious as large number of bugs are deposited in repositories per day. In turn, bug fixing time can be increased. Therefore, to automate and improve the accuracy rate of summarization task, a new summary subset selection technique is proposed to determine optimal summary subsets. This proposed technique is based particle swarm optimization (PSO) and ant colony optimization (ACO). The aim of proposed technique is to address data re |
Pagination: | xi, 113p. |
URI: | http://hdl.handle.net/10603/274054 |
Appears in Departments: | Department of Computer Science Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 379.95 kB | Adobe PDF | View/Open |
02_certificate; declaration; acknowledgement.pdf | 1.25 MB | Adobe PDF | View/Open | |
03_table of contents; list of tables & figures; abstract.pdf | 1.5 MB | Adobe PDF | View/Open | |
04_chapter 1.pdf | 476.96 kB | Adobe PDF | View/Open | |
05_chapter 2.pdf | 563.68 kB | Adobe PDF | View/Open | |
06_chapter 3.pdf | 1.1 MB | Adobe PDF | View/Open | |
07_chapter 4.pdf | 820.61 kB | Adobe PDF | View/Open | |
08_chapter 5.pdf | 1.02 MB | Adobe PDF | View/Open | |
09_chapter 6.pdf | 186.97 kB | Adobe PDF | View/Open | |
10_references.pdf | 378.33 kB | Adobe PDF | View/Open | |
11_list of publication.pdf | 185.34 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: