<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T14:56:56Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/6439" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/6439</identifier><datestamp>2017-03-21T20:29:05Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9908</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="f7926ddc-ba3f-4d8e-af16-ebbb5ef78887" confidence="600">Kaushik, Nilam</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2012-01-06T21:17:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2012-01-06T21:17:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2012-01-06T21:17:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2011-12-23</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/6439</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Open source projects incorporate bug triagers to help with the task of bug report&#xd;
assignment to developers. One of the tasks of a triager is to identify whether an incoming&#xd;
bug report is a duplicate of a pre-existing report. In order to detect duplicate bug reports,&#xd;
a triager either relies on his memory and experience or on the search capabilties of the bug&#xd;
repository. Both these approaches can be time consuming for the triager and may also&#xd;
lead to the misidentication of duplicates. It has also been suggested that duplicate bug&#xd;
reports are not necessarily harmful, instead they can complement each other to provide&#xd;
additional information for developers to investigate the defect at hand. This motivates the&#xd;
need for automated or semi-automated techniques for duplicate bug detection.&#xd;
In the literature, two main approaches have been proposed to solve this problem. The&#xd;
 first approach is to prevent duplicate reports from reaching developers by automatically&#xd;
 filtering them while the second approach deals with providing the triager a list of top-N&#xd;
similar bug reports, allowing the triager to compare the incoming bug report with the ones&#xd;
provided in the list. Previous works have tried to enhance the quality of the suggested&#xd;
lists, but the approaches either suffered a poor Recall Rate or they incurred additional&#xd;
runtime overhead, making the deployment of a retrieval system impractical. To the extent&#xd;
of our knowledge, there has been little work done to do an exhaustive comparison of&#xd;
the performance of different Information Retrieval Models (especially using more recent&#xd;
techniques such as topic modeling) on this problem and understanding the effectiveness of&#xd;
different heuristics across various application domains.&#xd;
In this thesis, we compare the performance of word based models (derivatives of the&#xd;
Vector Space Model) such as TF-IDF, Log-Entropy with that of topic based models such as&#xd;
Latent Semantic Indexing (LSI), Latent Dirichlet Allocation (LDA) and Random Indexing&#xd;
(RI). We leverage heuristics that incorporate exception stack frames, surface features,&#xd;
summary and long description from the free-form text in the bug report. We perform&#xd;
experiments on subsets of bug reports from Eclipse and Firefox and achieve a recall rate of&#xd;
60% and 58% respectively. We find that word based models, in particular a Log-Entropy&#xd;
based weighting scheme, outperform topic based ones such as LSI and LDA.&#xd;
Using historical bug data from Eclipse and NetBeans, we determine the optimal time&#xd;
frame for a desired level of duplicate bug report coverage. We realize an Online Duplicate&#xd;
Detection Framework that uses a sliding window of a constant time frame as a  first step&#xd;
towards simulating incoming bug reports and recommending duplicates to the end user.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">duplicate</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">bug</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Performance of IR Models on Duplicate Bug Report Detection: A Comparative Study</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Applied Science</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>