<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Collection:</title>
  <link rel="alternate" href="http://localhost:8080/xmlui/handle/123456789/1137" />
  <subtitle />
  <id>http://localhost:8080/xmlui/handle/123456789/1137</id>
  <updated>2026-04-22T21:50:00Z</updated>
  <dc:date>2026-04-22T21:50:00Z</dc:date>
  <entry>
    <title>Software Bug Prediction Using Supervised Machine Learning Algorithms</title>
    <link rel="alternate" href="http://localhost:8080/xmlui/handle/123456789/6644" />
    <author>
      <name>M. Farida Begam</name>
    </author>
    <id>http://localhost:8080/xmlui/handle/123456789/6644</id>
    <updated>2022-10-14T13:48:45Z</updated>
    <published>2019-06-01T00:00:00Z</published>
    <summary type="text">Title: Software Bug Prediction Using Supervised Machine Learning Algorithms
Authors: M. Farida Begam
Abstract: Abstract—Machine Learning algorithms sprawl their application&#xD;
in various fields relentlessly. Software Engineering is not &#xD;
exempted from that. Software bug prediction at the initial stages&#xD;
of software development improves the important aspects such as&#xD;
software quality, reliability, and efficiency and minimizes the&#xD;
development cost. In majority of software projects which are&#xD;
becoming increasingly large and complex programs, bugs are&#xD;
serious challenge for system consistency and efficiency. In our&#xD;
approach, three supervised machine learning algorithms are&#xD;
considered to build the model and predict the occurrence of the&#xD;
software bugs based on historical data by deploying the&#xD;
classifiers Logistic regression, Naïve Bayes, and Decision Tree.&#xD;
Historical data has been used to predict the future software faults&#xD;
by deploying the classifier algorithms and make the models a&#xD;
better choice for predictions using random forest ensemble&#xD;
classifiers and validating the models with K-Fold cross validation&#xD;
technique which results in the model effectively working for all&#xD;
the scenarios.</summary>
    <dc:date>2019-06-01T00:00:00Z</dc:date>
  </entry>
</feed>

