<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Assessing the Impact of Untraceable Bugs on the Quality of Software Defect Prediction Datasets</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">G</forename><surname>Mauša</surname></persName>
							<email>gmausa@riteh.hr</email>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">TIHANA GALINAC GRBAC</orgName>
								<orgName type="department" key="dep2">Faculty of Engineering</orgName>
								<orgName type="laboratory">GORAN MAU ŠA</orgName>
								<orgName type="institution">University of Rijeka</orgName>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="department">Faculty of engineering</orgName>
								<address>
									<addrLine>Vukovarska 58</addrLine>
									<postCode>51000</postCode>
									<settlement>Rijeka</settlement>
									<country key="HR">Croatia</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">T</forename><surname>Galinac Grbac</surname></persName>
							<affiliation key="aff1">
								<orgName type="department">Faculty of engineering</orgName>
								<address>
									<addrLine>Vukovarska 58</addrLine>
									<postCode>51000</postCode>
									<settlement>Rijeka</settlement>
									<country key="HR">Croatia</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Assessing the Impact of Untraceable Bugs on the Quality of Software Defect Prediction Datasets</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073)</idno>
					</monogr>
					<idno type="MD5">6750DA6808DA8A808F75D17B29C43250</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T15:32+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>D.2.5 [SOFTWARE ENGINEERING]: Testing and Debugging-Tracing</term>
					<term>D.2.9 [SOFT-WARE ENGINEERING]: Management-Software quality assurance (SQA)</term>
					<term>H.3.3 [INFORMATION STORAGE AND RE-TRIEVAL] Information Search and Retrieval Data quality, untraceable bugs, fault-proneness</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The results of empirical case studies in Software Defect Prediction are dependent on data obtained by mining and linking separate software repositories. These data often suffer from low quality. In order to overcome this problem, we have already investigated all the issues that influence the data collection process, proposed a systematic data collection procedure and evaluated it. The proposed collection procedure is implemented in the Bug-Code Analyzer tool and used on several projects from the Eclipse open source community. In this paper, we perform additional analysis of the collected data quality. We investigate the impact of untraceable bugs on non-fault-prone category of files, which is, to the best of our knowledge, an issue that has never been addressed. Our results reveal this issue should not be an underestimated one and should be reported along with bugs' linking rate as a measure of dataset quality.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">INTRODUCTION</head><p>Software Defect Prediction (SDP) is a widely investigated area in the software engineering research community. Its goal is to find effective prediction models that are able to predict risky software parts, in terms of fault proneness, early enough in the software development process and accordingly enable better focusing of verification efforts. The analyses performed in the environment of large scale industrial software with high focus on reliability show that the faults are distributed within the system according to the Pareto principle <ref type="bibr" target="#b5">[Fenton and Ohlsson 2000;</ref><ref type="bibr" target="#b6">Galinac Grbac et al. 2013]</ref>. Focusing verification efforts on software modules affected by faults could bring significant costs savings. Hence, SDP is becoming an increasingly interesting approach, even more so with the rise of software complexity.</p><p>Empirical case studies are the most important research method in software engineering because they analyse phenomena in their natural surrounding <ref type="bibr" target="#b16">[Runeson and Höst 2009]</ref>. The collection of data is the most important step in an empirical case study. Data collection needs to be planned according to the research goals and it has to be done according to a verifiable, repeatable and precise procedure <ref type="bibr" target="#b2">[Basili and Weiss 1984]</ref>. The collection of data for SDP requires linking of software development repositories that do not share a formal link <ref type="bibr" target="#b3">[D'Ambros et al. 2012]</ref>. This is not an easy task, so the majority of researchers tend to use the publicly available datasets. In such cases, researchers rely on the integrity of data collection procedure that yielded the datasets and focus mainly on prediction algorithms. Many machine learning algorithms are demanding and hence they divert the attention of researchers from the data upon which their research and results are based <ref type="bibr" target="#b17">[Shepperd et al. 2013</ref>]. However, the datasets and their collection procedures often suffer from various quality issues <ref type="bibr" target="#b15">[Rodriguez et al. 2012;</ref><ref type="bibr" target="#b8">Hall et al. 2012]</ref>.</p><p>Our past research was focused on the development of systematic data collection procedure for the SDP research. The following actions had been carried out:</p><p>-We analyzed all the data collection parameters that were addressed in contemporary related work, investigated whether there are unaddressed issues in practice and evaluated their impact on the final dataset <ref type="bibr" target="#b12">[Mauša et al. 2015a</ref>]; -We had evaluated the weaknesses of existing techniques for linking the issue tracking repository with the source code management repository and developed a linking technique that is based on regular expressions to overcome others' limitations <ref type="bibr">[Mauša et al. 2014</ref>]; -We determined all the parameters that define the systematic data collection procedure and performed an extensive comparative study that confirmed its importance for the research community <ref type="bibr" target="#b13">[Mauša et al. 2015b</ref>]; -We developed the Bug-Code Analyzer (BuCo) tool for automated execution of data collection process that implements our systematic data collection procedure <ref type="bibr">[Mauša et al. 2014</ref>].</p><p>So far, data quality was observed mainly in terms of bias that undefined or incorrectly defined data collection parameters could impose to the final dataset. Certain data characteristics affect the quality characteristics. For example, empty commit messages may lead to duplicated bug reports <ref type="bibr">[Bachmann and Bernstein 2010]</ref>. That is why software engineers and project managers should care about the quality of the development process. The data collection process cannot influence these issues but it may analyse to what extent do they influence the quality of the final datasets. For example, empty commit messages may also be the reason why some bug reports remain unlinked. Missing links between bugs and commit messages lead to untraceable bugs. This problem is common in the open source community <ref type="bibr">[Bachmann et al. 2010]</ref>.</p><p>In this paper, we address the issue of data quality with respect to the structure of the final datasets and the problem of untraceable bugs. This paper defines untraceable bugs as the defects that caused a loss of functionality, that are now fixed, and for which we cannot find the bug-fixing commit, i.e. their location in the source code. Our research questions tend to quantify the impact of untraceable bugs on SDP datasets. Giving answer to this question may improve the assessment of SDP datasets' quality and it is the contribution of this paper. Hence, we propose several metrics to estimate the impact of untraceable bugs on the fault-free category of software modules and perform a case study on 35 datasets that represent subsequent releases of 3 major Eclipse projects. The results revealed that the untraceable bugs may impact a significant amount of software modules that are otherwise unlinked to bugs. This confirms our doubts that the traditional approach, which pronounces the files that are unlinked to bugs as fault-free, may be lead to incorrect data.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">BACKGROUND</head><p>Software modules are pronounced as Fault-Prone (FP) if the number of bugs is above a certain threshold. Typically, this threshold is set to zero. The software units that remained unlinked to bugs are typically declared as Non-Fault-Prone (NFP). However, this may not be entirely correct if there exists • 6:49 a certain amount of untraceable bugs. This is especially the case in projects of lower maturity level. No mater which linking technique is used in the process of data collection from open source projects, all the bugs from the issue tracking repository are never linked. Therefore, it is important to report the linking rate, i.e. the proportion of successfully linked bugs, to reveal the quality of the dataset. Linking rate is usually improved with the maturity of the project, but it never reaches 100%. Instead, we can expect to link between 20% and 40% bugs in the earlier releases and up to 80% -90% of bugs in the "more mature", later releases <ref type="bibr" target="#b12">[Mauša et al. 2015a;</ref><ref type="bibr">Mizuno et al. 2007;</ref><ref type="bibr" target="#b7">Gyimothy et al. 2005;</ref><ref type="bibr" target="#b4">Denaro and Pezze 2002]</ref>. Moreover, an Apache developer identified that a certain amount of bugs might even be left out from the issue tracking system <ref type="bibr">[Bachmann et al. 2010</ref>].</p><p>Both of these data issues reveal that there is often a number of untraceable bugs present in the open source projects, i.e. a serious data quality issue. So far, the problem of untraceable bugs was considered only in studies that were developing linking techniques. For example, the ReLink tool was designed with the goal to find the missing links between bugs and commits <ref type="bibr" target="#b18">[Wu et al. 2011</ref>]. However, our simpler linking technique based on regular expressions performed equally good or better than the ReLink tool and it did not yield false links <ref type="bibr">[Mauša et al. 2014;</ref><ref type="bibr" target="#b13">Mauša et al. 2015b</ref>]. The bugs that remained unlinked could actually be present in the software units that remained unliked and, thus, disrupt the correctness of the dataset. Thus, it may be incorrect to declare all the software units not linked to bugs as NFP. To the best of our knowledge, this issue remained unattended so far. Nonetheless, there are indications that lead us to believe that the correctness of SDP datasets that is deteriorated by untraceable bugs can be improved. Khoshgoftaar et al. collected the data for SDP from a a very large legacy telecommunications system and found that more than 99% of the modules that were unchanged from the prior release had no faults <ref type="bibr" target="#b10">[Khoshgoftaar et al. 2002;</ref><ref type="bibr" target="#b9">Khoshgoftaar and Seliya 2004]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">CASE STUDY METHODOLOGY</head><p>We use the GQM (Goal-Question-Metrics) approach to state the precise goals of our case study. Our goal is to obtain high quality of data for SDP research. To achieve this goal, we have already analysed open software development repositories, investigated existing data collection approaches, revealed issues that could introduce bias if left open to interpretation and defined a systematic data collection procedure. The data collection procedure was proven to be of high quality <ref type="bibr" target="#b13">[Mauša et al. 2015b</ref>]. However, a certain amount of untraceable bugs is always present. If such a bug actually belongs to a software module that is otherwise unlinked to the remaining bugs, than it would be incorrect to pronounce such a software module as fault-free.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1">Research questions</head><p>Research questions that drive this paper are related to the issue of untraceable bugs and their impact on the quality of data for SDP research. To accomplish the aforementioned goal, we need to answer the following research questions (RQ):</p><p>(1) How many fixed bugs remain unlinked to commits?</p><p>(2) How many software modules might be affected by the untraceable bugs?</p><p>(3) How important it is to distinguish the unchanged software modules from other modules that remain unlinked to bugs?</p><p>The bug-commit linking is done using the Regex Search linking technique, implemented in the BuCo tool. This technique proved to be better than other existing techniques, like the ReLink tool <ref type="bibr">[Mauša et al. 2014]</ref>, and the collection procedure within the BuCo tool has shown to be more precise than other existing procedures, like the popular SZZ approach <ref type="bibr" target="#b12">[Mauša et al. 2015a</ref> we minimize the amount of bugs that are untraceable. Furthermore, BuCo tool uses the file level of granularity and software modules are regarded as files in the remainder of the paper.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2">Metrics</head><p>We propose several metrics to answer our research questions. The metric for the RQ1 is the linking rate (LR), i.e. the ratio between the number of successfully linked bugs and the total number of relevant bugs from the issue tracking repository. The metrics for the RQ2 and RQ3 are defined using the following categories of software modules:</p><p>-FP -files linked with at least one bug -Unlinked -files not linked to bugs -Changed -files for which at least one of 50 product metrics is changed between two consecutive releases n+1 and n -Removed -files that are present in release n, and do not exist in release n+1 -FP Candidates -Unlinked files that are Changed or Removed -NFP -Unlinked files that are not Changed nor Removed</p><p>The relationship between these categories of files are presented in Figure <ref type="figure">1</ref>. No previously published related research investigated the category of Non-Fault-Prone (NFP) files. It is reasonable to assume they categorized the Unlinked category as NFP. However, the linking rate that is below 100% reveals that there is a certain amount of untraceable bugs and we know that a file might be changed due to an enhancement requirement and\or a bug. Hence, we conclude that some of the Unlinked files that are Changed or Removed might be linked to these untraceable bugs, and categorize them as FP Candidates. The Unlinked files that are not Changed are the ones for which we are more certain that they are indeed Non-Fault-Prone. Thus, we categorize only these files as NFP. This approach is motivated by <ref type="bibr" target="#b10">Khoshgoftaar et al. [Khoshgoftaar et al. 2002;</ref><ref type="bibr" target="#b9">Khoshgoftaar and Seliya 2004]</ref> as explained in section 2. Using the previously defined categories of files, we define the following metrics:</p><formula xml:id="formula_0">C U = F P Candidates/U nlinked (1)</formula><p>The FP Candidates in Unlinked (C U) metric reveals the structure of Unlinked files, i.e. what percentage of Unlinked files is potentially affected by untraceable bugs. This metric enables us give an estimation for our RQ2.</p><p>F pB = F P/Linked bugs (2)</p><p>Assessing the Impact of Untraceable Bugs on the Quality of Software Defect Prediction Datasets</p><p>• 6:51</p><p>The Files per Bug (FpB) metric reveals the average number of different files that are affected by one bug. It should be noted that the bug-file cardinality is many-to-many, meaning that one bug may be linked to more than one file and one file may be linked to more than one bug. Hence, the untraceable bugs could be linked to files that are already FP, but we want to know how many of the Unlinked files they might affect. Therefore, we divide the total number of FP files (neglecting the number of established links per file) with the total number of linked bugs.</p><formula xml:id="formula_1">U b U = F pB * U bugs/U nlinked<label>(3)</label></formula><p>The Untraceable bugs in Unlinked (Ub U) metric estimates the proportion of Unlinked files that are likely to be linked to untraceable bugs, assuming that all the bugs behave according to the FpB metric. This metric enables us give another estimation for our RQ2. It estimates how wrong would it be to pronounce all the Unlinked files as NFP. The greater is the value of metric Ub U, the more wrong is that traditional approach. We must point out that there are also bugs that are not even entered into the BT repository. However, the influence of this category of untraceable bugs cannot be estimated, but it could only increase the value of Ub U.</p><formula xml:id="formula_2">U b C = F pB * U ntraceable bugs/F P Candidates<label>(4)</label></formula><p>The Untraceable bugs in FP Candidates (Ub C) metric estimates the percentage of FP Candidates that are likely to be linked to untraceable bugs (Ub U/C U), assuming that all the bugs behave according to the FpB measure. This metric enables us give an estimation for our RQ3. It estimates how wrong it would be to pronounce all the FP Candidates as NFP. The closer is the value of this metric to 1, the more precisely would it be not to pronounce the FP Candidates as NFP. In other words, the Ub C metric calculates the percentage of files that are likely to be FP among the FP Candidates (Ub U/C U).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3">Data</head><p>The source of data are three major and long lasting open source projects from the Eclipse community: JDT, PDE and BIRT. The bugs that satisfy following criteria are collected from the Bugzilla repository: status -closed, resolution -fixed, severity -minor or above. The whole source code management repositories are collected from the GIT system. Bugs are linked to commits using the BuCo Regex linking technique and afterwards the commits are to files that were changed. The cardinality of the link between bugs and commits is many-to-many, and the duplicated links between bugs and files are counted only once. The file level of granularity is used, test and example files are excluded from final datasets, and the main public class is analyzed in each file. A list of 50 software product metrics is calculated for each file using the LOC Metrics<ref type="foot" target="#foot_0">1</ref> and JHawk<ref type="foot" target="#foot_1">2</ref> tools.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">RESULTS</head><p>Table <ref type="table">I</ref> shows the total number of releases and files we collected; FP, NFP, Changed and Removed files we identified; the total number of relevant bugs from the issue tracking repository; the linking rate obtained by BuCo Regex linking technique; and the total number of commits in the source code management repository. The results of our linking technique are analysed for each project release and presented in Table <ref type="table" target="#tab_2">II</ref>. The LR exhibits a rising trend in each following release and reaches stable and high values (80% -90%) in the "middle" releases. A slight drop in LR is possible in the latest releases.  However, observing the absolute value of bugs in those releases, we notice the difference is less severe. As these releases are still under development, new bugs are being fixed and new commits still arrive so this rates are expected to change. These results show that a considerable amount of bugs is untraceable and indicate that their influence may not be insignificant. The distributions of four file categories are computed for each release of every project and presented in stacked column representations in Figures <ref type="figure">2, 3 and 4</ref>. We confirm that the problem of class imbalance between FP and Unlinked files (Changed, Removed and NFP) is present in all the releases. The percentage of FP files is usually below 20%, on rare occasions it rises up to 40% and in worst case scenarios it drops even below 5%. The trend of FP files is dropping as the project becomes more mature in the later releases. The NFP files are rare in the earlier releases of the projects showing that the projects are evidently rather unstable then. Their percentage is rising with almost every subsequent release and it rises to rates comparable to the FP category in the "middle" releases. The Removed files are a rather insignificant category of files. The Changed files are present in every release and they exhibit a more stable rate than the other categories.</p><p>Tables III, IV and V present the evaluation metrics which we proposed in section 3.2. Metric C U reveals the relative amount of files that are not linked to bugs, but have been changed in the following release. Because of the untraceable bugs, we cannot be certain about their fault proneness. We     notice a significant amount of such data. Metric FpB reveals the average number of distinct files that are changed per bug. The metric is based upon the number of bugs that were successfully linked to commits. Considering that multiple bugs may affect the same files, it is not unusual that one bug on average affects less than 1 distinct file. Later releases have less bugs in total, there is less chance that they affect the same files and there is a slight increase in the value of FpB. The FpB metric is used to estimate the amount of files prone to bugs that were untraceable from the bug tracking repository, expressed in the metric Ub U. The Ub U metric varies between releases, from very significant in earlier releases to rather insignificant in the later releases. The Ub C metric reveals how important would it be to distinguish Changed and Removed files from the NFP files. With its values close to 0%, we expect little bias in the category of NFP files. However, with its greater value, the bias is expected to rise and the necessity to make such a distinction is becoming greater. In several cases, its value exceeds 100%. This only shows that the impact of untraceable bugs is assessed to be even greater than affecting just the FP Candidates. In the case of JDT 3.8 its value is extremely high because this release contains almost none FP Candidates. This metric was developed on our own so we cannot define a significance threshold. Nevertheless, we notice this value to be more emphasized in earlier releases that we described as immature and in later releases that are still under development.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1">Discussion</head><p>Linking rate (LR) enables us to answer our RQ1. We noticed that the LR is very low in the earliest releases of analyzed projects (below 50%). After a couple of releases, the LR can be expected to be between 80% and 90%. We also observe that the distribution of FP files exhibits a decreasing trend as the product evolves through releases. That is why we believe that developer are maturing along with the project and, with time, they become less prone to faults and more consistent in reporting the Bug IDs in the commit titles when fixing bugs. The latest releases are still under development and exhibit extreme levels of data imbalance, with below 1% of FP files. Therefore, these datasets might not be the proper choice for training the predictive models in SDP.</p><p>Our results enable us to give an estimate for the RQ2. The Unlinked files contain a rather significant ratio of files that are FP candidates, spanning from 10% up to 50% for the JDT and BIRT projects and above 50% in several releases of the PDE project. Among the FP candidates, we expect to have a more significant amount of files that are FP due to the untraceable bugs in earlier releases because of low LR. According to the Ub C metric, we may expect that the majority of FP Candidates actually belong to the FP category in the earliest releases. According to the Ub U metric, the untraceable bugs affect a rather insignificant percentage of all the Unlinked files after a couple of releases.</p><p>The metrics we proposed in this paper enable us to answer our RQ3. The difference between the Ub U and Ub C values confirm the importance of classifying the Unlinked files into Changed, Removed and NFP. In the case of high Ub C values (above 80%) it may be prudent to categorize FP Candidates as FP and in the case where Ub C is between 20% and 80% it may be prudent to be cautious and not to use the FP Candidates at all. In the case of high difference between the Ub U and Ub C metrics, we may expect to have enough of NFP files in the whole dataset even if we discard the FP Candidates. This is confirmed in the distribution of NFP files which displays an increasing trend which becomes dominant and rather stable in the "middle" releases.</p><p>The process of data collection and analysis is fully repeatable and verifiable but there are some threats to validity of our exploratory case study. The construction validity is threatened because the data do not come from industry and the external validity is threatened because only one projects come from only one community. However, the chosen projects are large and long lasting ones and provide a good approximation of the projects from the industrial setting and they are widely analyzed in related research. Internal validity is threatened by assumptions that all the bugs affect the same quantity of different files and that Unchanged files are surely NFP.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">CONCLUSION</head><p>The importance of having accurate data is the initial and essential step in any research. This paper is yet another step in achieving that goal in the software engineering area of SDP. We noticed that untraceable bugs are inevitable in data collection from open source projects and that this issue remained unattended by the researchers so far. This exploratory case study revealed that it may be possible to evaluate the impact of untraceable bugs on the files that are unlinked to bugs. The results show that the earliest and the latest releases might not be a good source of data for building predictive models. The earliest releases are more prone to faults (containing higher number of reported bugs), radical changes (containing almost no unchanged files) and suffer from low quality of data (lower linking rate). On the other hand, the latest releases suffer from no previously mentioned issues, but are evidently still under development and the data are not stable.</p><p>The future work plans to investigate the impact of the explored issues and the proposed solutions to the problem of untraceable bugs on the performance of predictive models. Moreover, we plan to expand this study to other communities using our BuCo Analyzer tool.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head></head><label></label><figDesc>Fig. 2. Distribution of files in JDT releases</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_2"><head>Table II .</head><label>II</label><figDesc>Bug Linking Analysis</figDesc><table /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_3"><head></head><label></label><figDesc>Distribution of files in JDT releases</figDesc><table><row><cell>Release</cell><cell>C U</cell><cell>FpB</cell><cell>Ub U</cell><cell>Ub C</cell></row><row><cell>2.0</cell><cell>99.2%</cell><cell>0.54</cell><cell>91.5%</cell><cell>92.2%</cell></row><row><cell>2.1</cell><cell>61.9%</cell><cell>0.73</cell><cell>25.9%</cell><cell>41.8%</cell></row><row><cell>3.0</cell><cell>57.2%</cell><cell>0.55</cell><cell>25.7%</cell><cell>45.0%</cell></row><row><cell>3.1</cell><cell>72.3%</cell><cell>0.60</cell><cell>11.8%</cell><cell>16.3%</cell></row><row><cell>3.2</cell><cell>63.8%</cell><cell>0.89</cell><cell>8.1%</cell><cell>12.6%</cell></row><row><cell>3.3</cell><cell>36.5%</cell><cell>0.97</cell><cell>4.0%</cell><cell>10.9%</cell></row><row><cell>3.4</cell><cell>34.4%</cell><cell>1.03</cell><cell>2.5%</cell><cell>7.4%</cell></row><row><cell>3.5</cell><cell>14.0%</cell><cell>0.90</cell><cell>1.0%</cell><cell>6.9%</cell></row><row><cell>3.6</cell><cell>39.9%</cell><cell>0.99</cell><cell>1.2%</cell><cell>3.0%</cell></row><row><cell>3.7</cell><cell>25.4%</cell><cell>1.07</cell><cell>3.5%</cell><cell>13.7%</cell></row><row><cell>3.8</cell><cell>0.0%</cell><cell>1.14</cell><cell>1.0%</cell><cell>2334.7%</cell></row><row><cell>4.2</cell><cell>9.0%</cell><cell>1.03</cell><cell>0.1%</cell><cell>1.1%</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_4"><head>Table III .</head><label>III</label><figDesc>Evaluation Metrics for JDT</figDesc><table><row><cell></cell><cell></cell><cell>Release</cell><cell>C U</cell><cell>FpB</cell><cell>Ub U</cell><cell>Ub C</cell></row><row><cell>100%</cell><cell></cell><cell>2.0</cell><cell>100.0%</cell><cell>0.92</cell><cell>83.4%</cell><cell>83.4%</cell></row><row><cell>90%</cell><cell></cell><cell>2.1</cell><cell>86.0%</cell><cell>1.20</cell><cell>57.5%</cell><cell>66.8%</cell></row><row><cell>40% 80% 70% 60% 50%</cell><cell>Removed Changed</cell><cell>3.0 3.1 3.2 3.3</cell><cell>69.1% 69.2% 46.9% 73.4%</cell><cell>0.83 0.90 1.66 1.22</cell><cell cols="2">91.0% 131.8% 42.8% 61.8% 37.4% 79.7% 13.1% 17.8%</cell></row><row><cell>30%</cell><cell>NFP</cell><cell>3.4</cell><cell>48.7%</cell><cell>0.79</cell><cell>9.2%</cell><cell>18.9%</cell></row><row><cell>20% 10%</cell><cell>FP</cell><cell>3.5 3.6</cell><cell>14.2% 7.9%</cell><cell>0.98 1.07</cell><cell>7.1% 3.3%</cell><cell>49.7% 42.0%</cell></row><row><cell>0%</cell><cell>1 2 3 4 5 6 7 8 9 10 11 12 Subsequent releases</cell><cell>3.7 3.8 4.2</cell><cell>10.5% 1.1% 48.4%</cell><cell>3.83 1.21 2.30</cell><cell>6.5% 0.5% 1.3%</cell><cell>61.8% 43.4% 2.6%</cell></row><row><cell></cell><cell>Fig. 3. Distribution of files in PDE releases</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_5"><head>Table IV .</head><label>IV</label><figDesc>Evaluation Metrics for PDE</figDesc><table><row><cell>100%</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>90%</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>80%</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>70%</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>60%</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>Removed</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>40% 50%</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>Changed</cell><cell>Release</cell><cell>C U</cell><cell>FpB</cell><cell>Ub U</cell><cell>Ub C</cell></row><row><cell>30%</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>NFP</cell><cell>2.0.0</cell><cell>35.7%</cell><cell>0.92</cell><cell cols="2">62.2% 174.3%</cell></row><row><cell>20% 10%</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>FP</cell><cell>2.1.0 2.2.0</cell><cell>50.2% 25.4%</cell><cell>1.33 1.09</cell><cell cols="2">12.7% 32.2% 126.8% 25.2%</cell></row><row><cell>0%</cell><cell>1</cell><cell>2</cell><cell>3 Subsequent releases 4</cell><cell>5</cell><cell>6</cell><cell>2.3.0 2.5.0 2.6.0</cell><cell>39.1% 23.7% 66.9%</cell><cell>1.19 1.41 1.40</cell><cell>14.3% 3.8% 1.0%</cell><cell>36.6% 16.2% 1.6%</cell></row><row><cell></cell><cell cols="5">Fig. 4. Distribution of files in BIRT releases</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_6"><head>Table V .</head><label>V</label><figDesc>Evaluation Metrics for BIRT</figDesc><table><row><cell>6:54</cell><cell>•</cell><cell>G. Mauša and T. Galinac Grbac</cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">http://www.locmetrics.com/</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_1">http://www.virtualmachinery.com/</note>
		</body>
		<back>

			<div type="funding">
<div xmlns="http://www.tei-c.org/ns/1.0"><p>This work has been supported in part by Croatian Science Foundation's funding of the project UIP-2014-09-7945 and by the University of Rijeka Research Grant 13.09.2.2.16.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">When process data quality affects the number of bugs: Correlations in software engineering datasets</title>
		<author>
			<persName><forename type="first">A</forename><surname>Bachmann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Bernstein</surname></persName>
		</author>
		<idno type="DOI">10.1109/MSR.2010.5463286</idno>
		<idno>DOI:</idno>
		<ptr target="http://dx.doi.org/10.1109/MSR.2010.5463286" />
	</analytic>
	<monogr>
		<title level="m">7th IEEE Working Conference on Mining Software Repositories</title>
				<meeting><address><addrLine>MSR</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2010">2010. 2010. 2010</date>
			<biblScope unit="page" from="62" to="71" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">The Missing Links: Bugs and Bug-fix Commits</title>
		<author>
			<persName><forename type="first">Adrian</forename><surname>Bachmann</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Christian</forename><surname>Bird</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Foyzur</forename><surname>Rahman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Premkumar</forename><surname>Devanbu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Abraham</forename><surname>Bernstein</surname></persName>
		</author>
		<idno type="DOI">10.1145/1882291.1882308</idno>
		<idno>DOI:</idno>
		<ptr target="http://dx.doi.org/10.1145/1882291.1882308" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Eighteenth ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE &apos;10)</title>
				<meeting>the Eighteenth ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE &apos;10)<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2010">2010</date>
			<biblScope unit="page" from="97" to="106" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">A methodology for collecting valid software engineering data</title>
		<author>
			<persName><forename type="first">R</forename><surname>Victor</surname></persName>
		</author>
		<author>
			<persName><forename type="first">David</forename><surname>Basili</surname></persName>
		</author>
		<author>
			<persName><surname>Weiss</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Computer Society Trans. Software Engineering</title>
		<imprint>
			<biblScope unit="volume">10</biblScope>
			<biblScope unit="issue">6</biblScope>
			<biblScope unit="page" from="728" to="738" />
			<date type="published" when="1984">1984. 1984</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Evaluating Defect Prediction Approaches: A Benchmark and an Extensive Comparison</title>
		<author>
			<persName><forename type="first">Michele</forename><surname>Marco D'ambros</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Romain</forename><surname>Lanza</surname></persName>
		</author>
		<author>
			<persName><surname>Robbes</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Empirical Softw. Engg</title>
		<imprint>
			<biblScope unit="volume">17</biblScope>
			<biblScope unit="page" from="531" to="577" />
			<date type="published" when="2012">2012. 2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">An empirical evaluation of fault-proneness models</title>
		<author>
			<persName><forename type="first">Giovanni</forename><surname>Denaro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Mauro</forename><surname>Pezze</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Int&apos;l Conf. on Software Engineering</title>
				<meeting>the Int&apos;l Conf. on Software Engineering</meeting>
		<imprint>
			<date type="published" when="2002">2002</date>
			<biblScope unit="page" from="241" to="251" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Quantitative Analysis of Faults and Failures in a Complex Software System</title>
		<author>
			<persName><forename type="first">Norman</forename><forename type="middle">E</forename><surname>Fenton</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Niclas</forename><surname>Ohlsson</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Trans. Softw. Eng</title>
		<imprint>
			<biblScope unit="volume">26</biblScope>
			<biblScope unit="issue">8</biblScope>
			<biblScope unit="page" from="797" to="814" />
			<date type="published" when="2000">2000. 2000</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">A Second Replicated Quantitative Analysis of Fault Distributions in Complex Software Systems</title>
		<author>
			<persName><forename type="first">Tihana</forename><surname>Galinac Grbac</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Per</forename><surname>Runeson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Darko</forename><surname>Huljenić</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Trans. Softw. Eng</title>
		<imprint>
			<biblScope unit="volume">39</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="462" to="476" />
			<date type="published" when="2013-04">2013. April 2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Empirical Validation of Object-Oriented Metrics on Open Source Software for Fault Prediction</title>
		<author>
			<persName><forename type="first">Tibor</forename><surname>Gyimothy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Rudolf</forename><surname>Ferenc</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Istvan</forename><surname>Siket</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Trans. Softw. Eng</title>
		<imprint>
			<biblScope unit="volume">31</biblScope>
			<biblScope unit="page" from="897" to="910" />
			<date type="published" when="2005-10">2005. Oct. 2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">A Systematic Literature Review on Fault Prediction Performance in Software Engineering</title>
		<author>
			<persName><forename type="first">Tracy</forename><surname>Hall</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Sarah</forename><surname>Beecham</surname></persName>
		</author>
		<author>
			<persName><forename type="first">David</forename><surname>Bowes</surname></persName>
		</author>
		<author>
			<persName><forename type="first">David</forename><surname>Gray</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Steve</forename><surname>Counsell</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Trans. Softw. Eng</title>
		<imprint>
			<biblScope unit="volume">38</biblScope>
			<biblScope unit="issue">6</biblScope>
			<biblScope unit="page" from="1276" to="1304" />
			<date type="published" when="2012">2012. 2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Comparative Assessment of Software Quality Classification Techniques: An Empirical Case Study</title>
		<author>
			<persName><forename type="first">M</forename><surname>Taghi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Naeem</forename><surname>Khoshgoftaar</surname></persName>
		</author>
		<author>
			<persName><surname>Seliya</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Empirical Software Engineering</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page" from="229" to="257" />
			<date type="published" when="2004">2004. 2004</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Uncertain Classification of Fault-Prone Software Modules</title>
		<author>
			<persName><forename type="first">M</forename><surname>Taghi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Xiaojing</forename><surname>Khoshgoftaar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Edward</forename><forename type="middle">B</forename><surname>Yuan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Wendell</forename><forename type="middle">D</forename><surname>Allen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">John</forename><forename type="middle">P</forename><surname>Jones</surname></persName>
		</author>
		<author>
			<persName><surname>Hudepohl</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Empirical Software Engineering</title>
		<imprint>
			<biblScope unit="volume">7</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="295" to="295" />
			<date type="published" when="2002">2002. 2002</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Software Defect Prediction with Bug-Code Analyzer -a Data Collection Tool Demo</title>
		<author>
			<persName><forename type="first">Goran</forename><surname>Mauša</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tihana</forename><surname>Galinac Grbac</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Bojana</forename><surname>Dalbelo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Bašić</forename></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. of SoftCOM &apos;14</title>
				<meeting>of SoftCOM &apos;14</meeting>
		<imprint>
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Data Collection for Software Defect Prediction an Exploratory Case Study of Open Source Software Projects</title>
		<author>
			<persName><forename type="first">Goran</forename><surname>Mauša</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tihana</forename><surname>Galinac Grbac</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Bojana</forename><surname>Dalbelo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Bašić</forename></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of MIPRO &apos;14</title>
				<meeting>MIPRO &apos;14<address><addrLine>Opatija, Croatia</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2015">2015a</date>
			<biblScope unit="page" from="513" to="519" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<monogr>
		<title level="m" type="main">A Systemathic Data Collection Procedure for Software Defect Prediction</title>
		<author>
			<persName><forename type="first">Goran</forename><surname>Mauša</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tihana</forename><surname>Galinac Grbac</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Bojana</forename><surname>Dalbelo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Bašić</forename></persName>
		</author>
		<imprint>
			<date type="published" when="2015">2015b. 2015</date>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="page">4</biblScope>
		</imprint>
	</monogr>
	<note>to be published</note>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Techniques for Bug-Code Linking</title>
		<author>
			<persName><forename type="first">Goran</forename><surname>Mauša</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Paolo</forename><surname>Perković</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Tihana</forename><surname>Galinac Grbac</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Ivan</forename><surname>Štajduhar</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Spam Filter Based Approach for Finding Fault-Prone Software Modules</title>
				<editor>
			<persName><forename type="first">G</forename><surname>Mauša</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">T</forename><surname>Galinac Grbac Osamu Mizuno</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Shiro</forename><surname>Ikami</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Shuya</forename><surname>Nakaichi</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">Tohru</forename><surname>Kikuno</surname></persName>
		</editor>
		<imprint>
			<date type="published" when="2007">2014. 2007</date>
			<biblScope unit="page" from="47" to="55" />
		</imprint>
	</monogr>
	<note>Proc. of SQAMIA &apos;14. In MSR. 4</note>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">On software engineering repositories and their open problems</title>
		<author>
			<persName><forename type="first">D</forename><surname>Rodriguez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Herraiz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Harrison</surname></persName>
		</author>
		<idno type="DOI">10.1109/RAISE.2012.6227971</idno>
		<idno>DOI:</idno>
		<ptr target="http://dx.doi.org/10.1109/RAISE.2012.6227971" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of RAISE &apos;12</title>
				<meeting>RAISE &apos;12</meeting>
		<imprint>
			<date type="published" when="2012">2012</date>
			<biblScope unit="page" from="52" to="56" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Guidelines for Conducting and Reporting Case Study Research in Software Engineering</title>
		<author>
			<persName><forename type="first">Per</forename><surname>Runeson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Martin</forename><surname>Höst</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10664-008-9102-8</idno>
		<idno>DOI:</idno>
		<ptr target="http://dx.doi.org/10.1007/s10664-008-9102-8" />
	</analytic>
	<monogr>
		<title level="j">Empirical Softw. Engg</title>
		<imprint>
			<biblScope unit="volume">14</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="131" to="164" />
			<date type="published" when="2009-04">2009. April 2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Data Quality: Some Comments on the NASA Software Defect Datasets</title>
		<author>
			<persName><forename type="first">Martin</forename><forename type="middle">J</forename><surname>Shepperd</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Qinbao</forename><surname>Song</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Zhongbin</forename><surname>Sun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Carolyn</forename><surname>Mair</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Trans. Software Eng</title>
		<imprint>
			<biblScope unit="volume">39</biblScope>
			<biblScope unit="issue">9</biblScope>
			<biblScope unit="page" from="1208" to="1215" />
			<date type="published" when="2013">2013. 2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">ReLink: Recovering Links Between Bugs and Changes</title>
		<author>
			<persName><forename type="first">Rongxin</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Hongyu</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Sunghun</forename><surname>Kim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Shing-Chi</forename><surname>Cheung</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of ESEC/FSE &apos;11</title>
				<meeting>ESEC/FSE &apos;11<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2011">2011</date>
			<biblScope unit="page" from="15" to="25" />
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
