<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    jcc
   </journal-id>
   <journal-title-group>
    <journal-title>
     Journal of Computer and Communications
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2327-5219
   </issn>
   <issn publication-format="print">
    2327-5227
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/jcc.2025.134016
   </article-id>
   <article-id pub-id-type="publisher-id">
    jcc-142318
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Computer Science 
     </subject>
     <subject>
       Communications
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Hybrid Software Model for Defect Detection and Cost Evaluation Using Support Vector Machine Algorithm
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Kufre Christopher
      </surname>
      <given-names>
       Ukpe
      </given-names>
     </name>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Constance Izuchukwu
      </surname>
      <given-names>
       Amannah
      </given-names>
     </name>
    </contrib>
   </contrib-group> 
   <aff id="affnull">
    <addr-line>
     aDepartment of Computer Science, Ignatius Ajuru University of Education, Rumuolumeni, Rivers State, Nigeria
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     16
    </day> 
    <month>
     04
    </month>
    <year>
     2025
    </year>
   </pub-date> 
   <volume>
    13
   </volume> 
   <issue>
    04
   </issue>
   <fpage>
    244
   </fpage>
   <lpage>
    264
   </lpage>
   <history>
    <date date-type="received">
     <day>
      20,
     </day>
     <month>
      January
     </month>
     <year>
      2025
     </year>
    </date>
    <date date-type="published">
     <day>
      25,
     </day>
     <month>
      January
     </month>
     <year>
      2025
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      25,
     </day>
     <month>
      April
     </month>
     <year>
      2025
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    Software defect prediction and cost estimation are critical challenges in software engineering, directly influencing software quality and project management efficiency. This study presents a hybridized model integrating software defect prediction and cost estimation using machine learning techniques. Leveraging Support Vector Machines (SVM) for classification and regression, the model predicts software defects and estimates development costs with high precision. Principal Component Analysis (PCA) was employed for dimensionality reduction, ensuring computational efficiency and preserving 95% of dataset variance. The hybrid model was trained and tested on datasets sourced from the NASA PROMISE repository and Kaggle, employing a 70% - 30% train-test split with K-fold cross-validation for unbiased performance evaluation. The defect prediction component achieved an accuracy of 94.5%, precision of 93.7%, recall of 92.3%, and F1-score of 93.0%. For cost estimation, the model recorded a Coefficient of Determination (R
    <sup>2</sup>) of 0.87, Mean Absolute Error (MAE) of 5.2 person-hours, and Root Mean Squared Error (RMSE) of 6.8 person-hours. The proposed hybrid model outperforms traditional approaches by addressing defect detection and cost evaluation simultaneously, uncovering potential correlations between software quality attributes and cost factors. The study demonstrates the robustness of the model in real-world scenarios, providing actionable insights for improved resource allocation, reduced maintenance costs, and enhanced software reliability. Future research will explore the integration of additional machine learning techniques and extended datasets for broader applicability.
   </abstract>
   <kwd-group> 
    <kwd>
     Software
    </kwd> 
    <kwd>
      Performance
    </kwd> 
    <kwd>
      Cost
    </kwd> 
    <kwd>
      Defect
    </kwd> 
    <kwd>
      Vector
    </kwd> 
    <kwd>
      Machine
    </kwd> 
    <kwd>
      Support
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>Software defect prediction is a critical aspect of software quality assurance and has been extensively researched within the domain of software reliability engineering <xref ref-type="bibr" rid="scirp.142318-1">
     [1]
    </xref>. A software defect, commonly referred to as a bug, fault, or error, is any anomaly in a software system that leads to incorrect outputs or system failures. These defects can originate from errors in the source code, inaccuracies in requirement specifications, or flaws in the software design. Predicting software defects involves using machine learning classifiers trained on historical data, including metrics such as code complexity and change records, to identify fault-prone components in software systems <xref ref-type="bibr" rid="scirp.142318-2">
     [2]
    </xref>.</p>
   <p>The increasing complexity of software systems has amplified the prevalence and impact of defects <xref ref-type="bibr" rid="scirp.142318-3">
     [3]
    </xref>. Defective software often leads to incorrect decision-making, inefficiencies, and potential financial losses for organizations. Furthermore, the cost of maintaining and debugging such software is significantly high, making early detection of defects essential <xref ref-type="bibr" rid="scirp.142318-4">
     [4]
    </xref>. Software defect prediction models enable proactive identification of potential issues, allowing developers to focus testing efforts on fault-prone modules, reducing maintenance costs and development efforts <xref ref-type="bibr" rid="scirp.142318-1">
     [1]
    </xref>.</p>
   <p>Software cost estimation is another integral aspect of software engineering, playing a vital role in resource planning, budgeting, and project success. Accurate estimation of software cost and effort is critical for effective project management and can prevent issues such as resource wastage, project understaffing, and financial losses due to imprecise budgeting <xref ref-type="bibr" rid="scirp.142318-2">
     [2]
    </xref>. However, traditional methods of cost estimation often struggle with the non-linear and complex nature of modern software development, making machine learning models a promising alternative <xref ref-type="bibr" rid="scirp.142318-3">
     [3]
    </xref>. Machine learning, a field that empowers computers to learn from data without explicit programming, has shown significant promise in addressing challenges in software defect prediction and cost estimation <xref ref-type="bibr" rid="scirp.142318-5">
     [5]
    </xref>. By identifying patterns and trends in data, machine learning models offer accurate and efficient solutions, even with large and multi-dimensional datasets <xref ref-type="bibr" rid="scirp.142318-4">
     [4]
    </xref>. Support Vector Machines (SVM), a supervised learning algorithm, are particularly effective in this domain due to their ability to classify data and perform regression tasks with high precision <xref ref-type="bibr" rid="scirp.142318-1">
     [1]
    </xref>.</p>
   <p>This study proposes a hybridized software defect prediction and cost evaluation model using machine learning techniques. Leveraging SVMs, the study aims to enhance software quality by predicting defects and accurately estimating costs, thus addressing critical challenges in software development and project management.</p>
   <p>The study focuses on developing a hybridized model that integrates software defect prediction and cost evaluation. The key objectives include preprocessing supervised learning datasets for defect prediction and cost estimation using Principal Component Analysis (PCA), hybridizing defect prediction and cost evaluation models using Support Vector Machines (SVM), training the hybridized model with 70% of the datasets and testing with the remaining 30%, and evaluating the model’s performance using field software metrics. By enabling early defect detection and optimized testing processes, the study aims to improve software reliability and reduce maintenance costs while demonstrating the application of PCA in preprocessing machine learning datasets for software defect prediction and cost estimation.</p>
  </sec><sec id="s2">
   <title>2. Related Literature</title>
   <sec id="s2_1">
    <title>2.1. Theoretical Works</title>
    <p>The theoretical review establishes the foundational theories underpinning the research, focusing on existing, tested, and viable frameworks. It connects past proven theories with the current study, providing a robust lens for addressing research gaps.</p>
    <p>Huang and Strigini (2018) introduced the Cognitive Error Model, which explains software defects as a consequence of human errors influenced by task complexity and individual cognitive limitations <xref ref-type="bibr" rid="scirp.142318-6">
      [6]
     </xref>. This model identifies three key elements:</p>
    <p>1) Error Mode: The underlying pattern of erroneous human behavior, such as applying incorrect but familiar rules.</p>
    <p>2) Error Scenario: The specific conditions under which an error occurs, integrating task content, representation, and individual cognitive conditions.</p>
    <p>3) Error Mechanism: The combined factors explaining how a defect is introduced.</p>
    <p>This theory aligns with the present research by highlighting parameters like lines of code, design complexity, and cyclomatic complexity, which are directly correlated with human error. By leveraging this model, the research incorporates predictive elements for identifying scenarios prone to defects. Huang and Liu (2016) proposed Defect Prevention Based on Human Error Theories (DPeHE), a human-centered approach emphasizing learning from past errors to prevent future defects <xref ref-type="bibr" rid="scirp.142318-7">
      [7]
     </xref>. DPeHE integrates meta-cognition the awareness and regulation of one’s cognitive processes to improve developers’ problem-solving abilities. The framework has three stages; knowledge training, regulation training, encouraging self-awareness and monitoring using defect prevention checklists and skill development. The DPeHE model informs this research by emphasizing the importance of analyzing specific aspects of software systems (e.g., operators, operands, comments) to ensure comprehensive defect detection and prevention.</p>
    <p>Saini and Ahmad (2012) explored the Chaos Theory of Software Systems, which describes software as a nonlinear system with interdependent variables sensitive to initial conditions <xref ref-type="bibr" rid="scirp.142318-8">
      [8]
     </xref>. This sensitivity leads to unpredictability in defect occurrence. Key features of chaos include sensitive dependence and nonlinearity. The chaos theory relates to this research by addressing the limitations of static, linear models in capturing the dynamic, complex nature of software defects and cost estimation. The study applies Support Vector Machines (SVM) to identify hidden patterns in software metrics, accommodating the nonlinear dynamics highlighted by chaos theory.</p>
    <p>The conceptual review delves into the fundamental concepts of software defects and cost estimation, defining variables and mapping their interrelations. Software defects represent deviations between actual and expected outcomes, encompassing errors in functionality, performance, usability, compatibility, and security <xref ref-type="bibr" rid="scirp.142318-9">
      [9]
     </xref> <xref ref-type="bibr" rid="scirp.142318-10">
      [10]
     </xref>. Types of defects include:</p>
    <p>Arithmetic Defects: Errors in calculations or expressions.</p>
    <p>Logical Defects: Flaws in program logic or corner-case handling.</p>
    <p>Syntax Defects: Mistakes in code structure, such as missing semicolons.</p>
    <p>Performance Defects: Issues affecting system response times or resource usage.</p>
    <p>Interface Defects: Problems in user interactions or platform integration.</p>
    <p>Defects can also be classified by severity (e.g., critical, high, medium, low) and priority (e.g., urgent, high, medium, low) <xref ref-type="bibr" rid="scirp.142318-11">
      [11]
     </xref>. Effective defect management involves early detection, categorization, and resolution, which are central to improving software quality and reducing maintenance costs. Cost estimation involves predicting the resources required for software development, focusing on effort, duration, and manpower <xref ref-type="bibr" rid="scirp.142318-12">
      [12]
     </xref>.</p>
    <p>Estimation techniques are categorized as:</p>
    <p>Algorithmic Methods: Utilize mathematical equations based on historical data, e.g., COCOMO, Putnam Model, and Function Point Analysis.</p>
    <p>Non-Algorithmic Methods: Include expert judgment, analogy-based estimation, neural networks, genetic programming, and fuzzy logic <xref ref-type="bibr" rid="scirp.142318-13">
      [13]
     </xref>.</p>
    <p>Each method has strengths and weaknesses. For instance, algorithmic methods provide structured, repeatable results but require extensive data, while non-algorithmic methods are flexible but dependent on expert availability and historical data accuracy.</p>
    <p>Software metrics quantitatively measure aspects of software systems, aiding in defect prediction and cost estimation <xref ref-type="bibr" rid="scirp.142318-14">
      [14]
     </xref>. Key metrics include:</p>
    <p>Lines of Code (LOC): Measures software size; higher LOC often correlates with increased defect probability.</p>
    <p>Cyclomatic Complexity: Quantifies code complexity and potential error-prone paths.</p>
    <p>Halstead Metrics: Evaluate program complexity based on operators and operands.</p>
    <p>Object-Oriented Metrics: Assess features like cohesion, coupling, and inheritance.</p>
    <p>Metrics are classified into:</p>
    <p>Product Metrics: Assess the software product’s quality attributes (e.g., complexity, performance).</p>
    <p>Process Metrics: Measure the efficiency of development processes (e.g. defect detection rates).</p>
    <p>Project Metrics: Evaluate project-level attributes (e.g., cost, schedule adherence).</p>
    <p>The theories and concepts reviewed provide a robust framework for the proposed hybrid model. Cognitive and chaos theories guide defect prediction by emphasizing the nonlinear and human-centric nature of software systems. Metrics and estimation techniques offer structured methodologies for cost evaluation. Together, these foundations support the development of an accurate, efficient model using SVM for both defect detection and cost estimation.</p>
   </sec>
   <sec id="s2_2">
    <title>2.2. Empirical Works</title>
    <p>Empirical research focuses on deriving outcomes through qualitative or quantitative methods of observation, based on verifiable evidence, experiments, or observations. This section synthesizes significant studies in software defect prediction and cost estimation.</p>
    <p>Hammouri et al. (2018) developed a software bug prediction model using machine learning (ML) algorithms such as Naïve Bayes (NB), Decision Tree (DT), and Artificial Neural Networks (ANNs) <xref ref-type="bibr" rid="scirp.142318-15">
      [15]
     </xref>. Their findings showed high accuracy rates; however, the model lacked optimization and unbiased evaluation techniques like K-Fold cross-validation, limiting its generalizability. This study aims to address these limitations by integrating grid search for hyperparameter tuning. Alsaeedi and Khan (2019) explored various ML techniques for defect prediction across NASA datasets, highlighting the effectiveness of Random Forest (RF) <xref ref-type="bibr" rid="scirp.142318-10">
      [10]
     </xref>. Despite promising results, the study employed only four ML models and lacked model optimization. This research will incorporate five ML models and use grid search for fine-tuning to enhance predictive accuracy.</p>
    <p>Dam et al. (2018) employed deep learning techniques, specifically tree-structured long/short-term memory networks, for defect prediction <xref ref-type="bibr" rid="scirp.142318-16">
      [16]
     </xref>. While effective, the study faced limitations in dataset size and optimization. The current research will utilize larger datasets and implement grid search for optimization. Huda et al. (2017) proposed hybrid models combining wrapper and filter techniques for defect prediction <xref ref-type="bibr" rid="scirp.142318-17">
      [17]
     </xref>. Their method achieved high accuracy with reduced metrics but lacked optimization. This research addresses these gaps by incorporating grid search for parameter tuning and expanding the scope to include software cost evaluation.</p>
    <p>Jinsheng et al. (2014) tackled class imbalance issues using asymmetric kernel classifiers <xref ref-type="bibr" rid="scirp.142318-18">
      [18]
     </xref>. Despite improvements, the study was constrained by small datasets and lacked optimization. This research aims to integrate a hybridized model addressing both software defects and costs with robust cross-validation. Aleem et al. (2015) analyzed supervised and unsupervised learning techniques for defect prediction <xref ref-type="bibr" rid="scirp.142318-19">
      [19]
     </xref>. Although extensive evaluation measures like accuracy and F-measure were used, the absence of optimization limited model performance. This study incorporates grid search and addresses both defect prediction and cost estimation. Sun et al. (2012) proposed converting imbalanced binary-class data into balanced multiclass data for defect prediction <xref ref-type="bibr" rid="scirp.142318-20">
      [20]
     </xref>. Despite the robustness of their approach, the study overlooked hyperparameter tuning and cost-related aspects. This research bridges these gaps by incorporating software cost estimation and model optimization.</p>
    <p>Petric et al. (2016) demonstrated the benefits of diversity techniques in defect prediction using stacking ensembles <xref ref-type="bibr" rid="scirp.142318-21">
      [21]
     </xref>. While effective, the study focused solely on defects, neglecting cost aspects. This research extends the methodology to address both software defects and costs. Pan et al. (2019) improved CNN-based defect prediction models, emphasizing hyperparameter instability <xref ref-type="bibr" rid="scirp.142318-22">
      [22]
     </xref>. Although effective for defect prediction, the study did not address software cost. This research proposes a unified model for defects and cost estimation. Laradji et al. (2015) combined feature selection and ensemble learning, achieving high accuracy in defect classification <xref ref-type="bibr" rid="scirp.142318-23">
      [23]
     </xref>. However, the study focused only on defects. The proposed model in this research will address both defects and costs.</p>
    <p>Pelayo and Dick (2014) evaluated SMOTE for addressing class imbalance in defect prediction <xref ref-type="bibr" rid="scirp.142318-24">
      [24]
     </xref>. While successful, the study did not explore software cost. This research integrates cost-related metrics in a hybrid model. Balogun et al. (2019) analyzed feature selection methods for defect prediction <xref ref-type="bibr" rid="scirp.142318-25">
      [25]
     </xref>. Although effective, the research ignored cost estimation. This study adopts Principal Component Analysis (PCA) for preprocessing and expands the model’s scope to include cost evaluation. Wu et al. (2018) proposed a cost-sensitive dictionary learning approach for defect prediction <xref ref-type="bibr" rid="scirp.142318-26">
      [26]
     </xref>. While addressing defects effectively, the study excluded cost metrics. This research bridges this gap with a hybridized model.</p>
    <p>Fan et al. (2019) introduced an attention-based recurrent neural network for defect prediction <xref ref-type="bibr" rid="scirp.142318-27">
      [27]
     </xref>. While the model achieved high accuracy, it neglected cost-related predictions. The proposed model addresses both dimensions. Wang et al. (2011) compared ensemble methods for defect prediction, finding Random Forest and Voting to be most effective <xref ref-type="bibr" rid="scirp.142318-28">
      [28]
     </xref>. The study lacked model optimization and cost considerations, which this research integrates into its methodology. Song et al. (2010) proposed a comprehensive defect prediction framework but excluded hyperparameter tuning and cost considerations <xref ref-type="bibr" rid="scirp.142318-29">
      [29]
     </xref>. These gaps are addressed in this research with grid search optimization.</p>
    <p>Huang et al. (2015) assessed preprocessing techniques for software cost estimation <xref ref-type="bibr" rid="scirp.142318-30">
      [30]
     </xref>. Although impactful, the study lacked a direct evaluation of machine learning methods. This research ensures robust evaluation of ML models for defects and costs. Nassif et al. (2012) compared log-linear regression and neural networks for cost estimation, finding complementary strengths based on project size <xref ref-type="bibr" rid="scirp.142318-31">
      [31]
     </xref>. This research expands their approach to encompass defect prediction. This comprehensive empirical review identifies key gaps in existing research and highlights the novelty of a hybridized model integrating defect prediction and cost estimation using advanced ML techniques and optimization strategies.</p>
    <p>The study expanded the related literature to provide a thorough comparison of hybrid or multi-task learning approaches in software engineering. Zhang et al. (2018) employed a neural network sharing hidden layers for defect density and maintenance effort, achieving improved classification metrics due to learned cross-task representations <xref ref-type="bibr" rid="scirp.142318-32">
      [32]
     </xref>. Sun and Xia (2019) introduced a CNN-based multi-task model for bug detection and code-smell identification, underscoring that shared layers reduce false positives compared to task-specific networks <xref ref-type="bibr" rid="scirp.142318-33">
      [33]
     </xref>. Panichella et al. (2020) applied partially shared ensemble techniques for code-quality classification and basic effort estimation; however, the tasks still used separate modules for training <xref ref-type="bibr" rid="scirp.142318-34">
      [34]
     </xref>. Kim &amp; Williams (2021) proposed a Bayesian multi-task framework for defect detection and release-time predictions <xref ref-type="bibr" rid="scirp.142318-35">
      [35]
     </xref>. While effective, it did not incorporate an integrated dimensionality-reduction step such as PCA. Compared to these prior works, our model contributes a fully integrated SVM solution for both classification (defect prediction) and regression (cost estimation) using a single kernel-based system, joint feature preprocessing (PCA), and an overarching multi-objective optimization procedure. This deeper integration enables the discovery of cross-task correlations and demonstrates strong empirical performance on public datasets (NASA PROMISE, Kaggle).</p>
   </sec>
  </sec><sec id="s3">
   <title>3. Methodology and Design</title>
   <sec id="s3_1">
    <title>3.1. Methodology</title>
    <p>The study adopts the Object-Oriented Analysis and Design (OOAD) methodology. This approach is well-suited as it represents the system as a collection of objects encapsulating functionalities (behaviour) and data (state). OOAD ensures modularity and enhances the system’s scalability and maintainability. In line with the study’s objectives, the following techniques and procedures were employed; data preprocessing, model development, data partitioning, model training and testing, and performance evaluation.</p>
   </sec>
   <sec id="s3_2">
    <title>3.2. System Analysis</title>
    <p>This study builds upon the systems developed by Hammouri et al. (2018) for software defect prediction and Premalatha and Srikrishna (2019) for software cost estimation <xref ref-type="bibr" rid="scirp.142318-15">
      [15]
     </xref> <xref ref-type="bibr" rid="scirp.142318-36">
      [36]
     </xref>. Hammouri et al. (2018) utilized Naïve Bayes (NB), decision tree (DT), and artificial neural networks (ANNs) for software defect prediction, preprocessed datasets with clustering techniques and evaluated models using metrics like accuracy, precision, recall, and RMSE <xref ref-type="bibr" rid="scirp.142318-15">
      [15]
     </xref>. The work used small training datasets and absence of model optimization techniques. Premalatha and Srikrishna (2019) developed a Cost-sensitive deep belief network (ECS-DBN) for software cost estimation, evaluated using metrics such as RAE, MAE, and RMSE <xref ref-type="bibr" rid="scirp.142318-36">
      [36]
     </xref>. The study focused solely on cost estimation without addressing software defect prediction or dataset scalability. <xref ref-type="fig" rid="fig1">
      Figure 1
     </xref> to <xref ref-type="fig" rid="fig2">
      Figure 2
     </xref> highlight the systems of Hammouri et al. (2018) and (Premalatha &amp; Srikrishna, 2019) respectively <xref ref-type="bibr" rid="scirp.142318-15">
      [15]
     </xref> <xref ref-type="bibr" rid="scirp.142318-36">
      [36]
     </xref>.</p>
    <p>The hybrid system integrates software defect prediction and cost estimation into a unified model using Support Vector Machine (SVM). Key steps in the system development.</p>
    <fig id="fig1" position="float">
     <label>Figure 1</label>
     <caption>
      <title>Figure 1. Software defect architecture by (Hammouri et al., 2018).</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1733061-rId14.jpeg?20250428034033" />
    </fig>
    <fig id="fig2" position="float">
     <label>Figure 2</label>
     <caption>
      <title>Figure 2. Software cost architecture by (Premalatha &amp; Srikrishna, 2019).</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1733061-rId15.jpeg?20250428034033" />
    </fig>
    <p>Dataset Acquisition: Software defect datasets were sourced from the NASA PROMISE repository. Software cost estimation datasets were obtained from Kaggle.</p>
    <p>Data Preprocessing: PCA was used to reduce dimensionality, ensuring computational efficiency and enhancing model performance.</p>
    <p>Model Training and Testing: The hybridized model was trained on 70% of the dataset and tested on 30%. K-fold cross-validation was implemented to ensure unbiased performance evaluation.</p>
    <p>Performance Metrics: Defect prediction: Accuracy, Precision, Recall, F1-score. Cost estimation: Coefficient of Determination (R<sup>2</sup>).</p>
    <p>The PCA process includes computation, principal component selection, and integration into the hybrid model. The process starts by standardizing each feature (e.g., code metrics, developer experience). Then, we compute the covariance matrix of these standardized values. Eigen decomposition of the covariance matrix yields eigenvalues {λ<sub>i</sub>} and corresponding eigenvectors {v<sub>i</sub>}. The total variance is ∑λ<sub>i</sub>. We order eigenvalues λ<sub>i</sub> in descending order. Let the sum of the top k eigenvalues be 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mo>
           = 
         </mo> 
         <msub> 
          <mi>
            λ 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math>. We choose the smallest k satisfying 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mo>
           = 
         </mo> 
         <mi>
           k 
         </mi> 
         <msub> 
          <mi>
            λ 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
       <mo>
         ≥ 
       </mo> 
       <mtext>
           
       </mtext> 
       <mn>
         0.95 
       </mn> 
      </mrow> 
     </math> ensuring at least 95% of the original data variance is preserved.</p>
    <p>Principal Component Selection</p>
    <p>• The total variance is 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mstyle displaystyle="true"> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            λ 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math>. We order eigenvalues λ<sub>i</sub> in descending order. Let the sum of the top k eigenvalues be 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mi>
           k 
         </mi> 
        </msubsup> 
        <mrow> 
         <msub> 
          <mi>
            λ 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math>.</p>
    <p>• We choose the smallest k satisfying</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mfrac> 
        <mrow> 
         <mstyle displaystyle="true"> 
          <msubsup> 
           <mo>
             ∑ 
           </mo> 
           <mrow> 
            <mi>
              i 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             k 
           </mi> 
          </msubsup> 
          <mrow> 
           <msub> 
            <mi>
              λ 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
         </mstyle> 
        </mrow> 
        <mrow> 
         <mstyle displaystyle="true"> 
          <msubsup> 
           <mo>
             ∑ 
           </mo> 
           <mrow> 
            <mi>
              j 
            </mi> 
            <mo>
              = 
            </mo> 
            <mn>
              1 
            </mn> 
           </mrow> 
           <mi>
             d 
           </mi> 
          </msubsup> 
          <mrow> 
           <msub> 
            <mi>
              λ 
            </mi> 
            <mi>
              j 
            </mi> 
           </msub> 
          </mrow> 
         </mstyle> 
        </mrow> 
       </mfrac> 
       <mo>
         ≥ 
       </mo> 
       <mn>
         0.95 
       </mn> 
      </mrow> 
     </math></p>
    <p>95% is commonly used in data mining as a balance between dimensionality reduction and information retention. Empirically, we found this threshold to maintain prediction accuracy while reducing computational overhead in SVM training. After determining k, we project the data onto the top k eigenvectors. Both the defect-prediction and cost-estimation submodules receive these same PCA-transformed features, ensuring uniform input spaces across tasks.</p>
    <p>The proposed system leverages the strengths of machine learning for multi-tasking:</p>
    <p>1) Hybrid Approach: Tackles classification (defects) and regression (cost) problems simultaneously, uncovering potential correlations.</p>
    <p>2) Efficiency: SVM’s duality in handling classification and regression tasks ensures optimal model performance.</p>
    <p>3) Scalability: Incorporates larger datasets and preprocessing techniques to overcome existing system constraints.</p>
   </sec>
   <sec id="s3_3">
    <title>3.3. System Design</title>
    <p>The system design is based on OOAD and employs Unified Modeling Language (UML) for structural representation. Components include:</p>
    <p>Inputs: Software defect parameters (e.g., McCabe’s metrics, Halstead’s measures). Software cost parameters (e.g., project size, team experience, transaction counts).</p>
    <p>Outputs: Predicted software defects and estimated costs.</p>
    <p>Core Components:</p>
    <p>Data Acquisition: Data sourced from PROMISE and Kaggle repositories.</p>
    <p>Data Preprocessing: PCA for dimensionality reduction.</p>
    <p>Model Training: SVM for learning from datasets.</p>
    <p>Performance Evaluation: Accuracy metrics for defects; R<sup>2</sup> for cost.</p>
   </sec>
   <sec id="s3_4">
    <title>3.4. UML Diagrams</title>
    <p>The UML use case diagram for this system serves as the primary representation of the system/software requirements. It specifies the expected behavior (the “what”) of the system rather than detailing the method of implementation (the “how”). The use case diagram is a visual representation designed to capture system functionality and interactions from the perspective of the end user. This modeling approach aids in designing the system with a user-centered focus, ensuring clarity and alignment with user needs.</p>
    <p>The use case diagram is an effective tool for communicating system behavior in terms familiar to the user by illustrating all externally visible actions the system can perform. It helps bridge the gap between technical implementation and user expectations. The use case diagram for the proposed hybridized software defect and cost evaluation model is illustrated in <xref ref-type="fig" rid="fig3">
      Figure 3
     </xref>.</p>
    <p>The activity diagram for the proposed hybridized software defect and cost evaluation model illustrates the interactions, workflows, and decisions involved in the system’s operations. This detailed and structured representation facilitates better understanding and effective system design. The system activity diagram is presented in <xref ref-type="fig" rid="fig4">
      Figure 4
     </xref>.</p>
    <fig id="fig3" position="float">
     <label>Figure 3</label>
     <caption>
      <title>Figure 3. USE_CASE for the Hybridized model.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1733061-rId26.jpeg?20250428034036" />
    </fig>
    <fig id="fig4" position="float">
     <label>Figure 4</label>
     <caption>
      <title>Figure 4. Activity diagram of the Hybridized model.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1733061-rId27.jpeg?20250428034036" />
    </fig>
    <fig id="fig5" position="float">
     <label>Figure 5</label>
     <caption>
      <title>Figure 5. Class diagram of the hybridized model.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1733061-rId28.jpeg?20250428034036" />
    </fig>
    <p>The flat file schema is selected for its simplicity and suitability for storing machine learning datasets. This schema organizes data into a single, two-dimensional structure, typically a CSV file, making it easy to integrate with Python libraries such as pandas and scikit-learn. The flat file schema is selected for its simplicity and suitability for storing machine learning datasets. This schema organizes data into a single, two-dimensional structure, typically a CSV file, making it easy to integrate with Python libraries such as pandas and scikit-learn. The proposed architecture integrates: Data Acquisition, Seamless extraction from repositories; Preprocessing -PCA for noise reduction; Training and Testing, implementation using PyCharm and Python libraries; and Evaluation: Metrics for comprehensive performance analysis. <xref ref-type="fig" rid="fig6">
      Figure 6
     </xref> shows the integrated architecture of hybrid.</p>
    <fig id="fig6" position="float">
     <label>Figure 6</label>
     <caption>
      <title>Figure 6. The hybridized Software model.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1733061-rId29.jpeg?20250428034036" />
    </fig>
    <p>The parameters of software defect dataset are described in <xref ref-type="table" rid="table1">
      Table 1
     </xref> while parameters of software defect dataset are described in <xref ref-type="table" rid="table1">
      Table 1
     </xref>.</p>
    <p>The parameters of software cost dataset are described in <xref ref-type="table" rid="table2">
      Table 2
     </xref>.</p>
    <table-wrap id="table1">
     <label>
      <xref ref-type="table" rid="table1">
       Table 1
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.142318-"></xref>Table 1. Software defect parameters.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="11.22%"><p style="text-align:center">S/N</p></td> 
       <td class="custom-bottom-td acenter" width="40.19%"><p style="text-align:center">Feature</p></td> 
       <td class="custom-bottom-td acenter" width="68.21%"><p style="text-align:center">Description</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="11.22%"><p style="text-align:center">1</p></td> 
       <td class="custom-top-td acenter" width="40.19%"><p style="text-align:center">Loc</p></td> 
       <td class="custom-top-td acenter" width="68.21%"><p style="text-align:center">McCabe’s line count of code</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">2</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">v(g)</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">McCabe “cyclomatic complexity”</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">3</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">ev(g)</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">McCabe “essential complexity”</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">4</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">iv(g)</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">McCabe “design complexity”</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">5</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">N</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">Halstead total operators + operands</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">6</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">V</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">Halstead “volume”</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">7</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">L</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">Halstead “program length”</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">8</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">D</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">Halstead “difficulty”</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">9</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">I</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">Halstead “intelligence”</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">10</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">E</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">Halstead “effort”</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">11</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">B</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">Halstead delivered bug</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">12</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">T</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">Halstead’s time estimator</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">13</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">LOCode</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">Halstead’s line count</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">14</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">LOComment</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">Halstead’s count of lines of comments</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">15</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">LOBlank</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">Halstead’s count of blank lines</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">16</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">LOCodeAndComment</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">Line of code and line of comments</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">17</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">uniq_Op</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">unique operators</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">18</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">uniq_Opnd</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">unique operands</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">19</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">total_Op</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">total operators</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">20</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">total_Opnd</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">total operands</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">21</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">BranchCount</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">% of the flow graph</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="11.22%"><p style="text-align:center">22</p></td> 
       <td class="acenter" width="40.19%"><p style="text-align:center">Defect</p></td> 
       <td class="acenter" width="68.21%"><p style="text-align:center">false, true</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <table-wrap id="table2">
     <label>
      <xref ref-type="table" rid="table2">
       Table 2
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.142318-"></xref>Table 2. Software cost parameters.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="6.48%"><p style="text-align:center">S/N</p></td> 
       <td class="custom-bottom-td acenter" width="21.54%"><p style="text-align:center">Feature</p></td> 
       <td class="custom-bottom-td acenter" width="71.98%"><p style="text-align:center">Description</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="6.48%"><p style="text-align:center">1</p></td> 
       <td class="custom-top-td acenter" width="21.54%"><p style="text-align:center">Project</p></td> 
       <td class="custom-top-td acenter" width="71.98%"><p style="text-align:center">Project information. Class of project</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="6.48%"><p style="text-align:center">2</p></td> 
       <td class="acenter" width="21.54%"><p style="text-align:center">TeamExp</p></td> 
       <td class="acenter" width="71.98%"><p style="text-align:center">Team experience measured in years</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="6.48%"><p style="text-align:center">3</p></td> 
       <td class="acenter" width="21.54%"><p style="text-align:center">ManagerExp</p></td> 
       <td class="acenter" width="71.98%"><p style="text-align:center">Manager experience measured in years</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="6.48%"><p style="text-align:center">4</p></td> 
       <td class="acenter" width="21.54%"><p style="text-align:center">YearEnd</p></td> 
       <td class="acenter" width="71.98%"><p style="text-align:center">Year the project ended</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="6.48%"><p style="text-align:center">5</p></td> 
       <td class="acenter" width="21.54%"><p style="text-align:center">Length</p></td> 
       <td class="acenter" width="71.98%"><p style="text-align:center">Duration of the project in months</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="6.48%"><p style="text-align:center">6</p></td> 
       <td class="acenter" width="21.54%"><p style="text-align:center">Transactions</p></td> 
       <td class="acenter" width="75.87%"><p style="text-align:center">Transactions is a count of basic logical transactions in the system</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="6.48%"><p style="text-align:center">7</p></td> 
       <td class="acenter" width="21.54%"><p style="text-align:center">Entities</p></td> 
       <td class="acenter" width="75.87%"><p style="text-align:center">Entities is the number of entities in the systems data model</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="6.48%"><p style="text-align:center">8</p></td> 
       <td class="acenter" width="21.54%"><p style="text-align:center">PointsNonAdjust</p></td> 
       <td class="acenter" width="75.87%"><p style="text-align:center">Size of the project measured in adjusted function points</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="6.48%"><p style="text-align:center">9</p></td> 
       <td class="acenter" width="21.54%"><p style="text-align:center">Adjustment</p></td> 
       <td class="acenter" width="75.87%"><p style="text-align:center">Adjustment points</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="6.48%"><p style="text-align:center">10</p></td> 
       <td class="acenter" width="21.54%"><p style="text-align:center">PointsAjust</p></td> 
       <td class="acenter" width="75.87%"><p style="text-align:center">Size of the project measured in unadjusted Points</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="6.48%"><p style="text-align:center">11</p></td> 
       <td class="acenter" width="21.54%"><p style="text-align:center">Language</p></td> 
       <td class="acenter" width="75.87%"><p style="text-align:center">Type of language used in the project expressed as 1, 2 or 3</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="6.48%"><p style="text-align:center">12</p></td> 
       <td class="acenter" width="21.54%"><p style="text-align:center">Effort</p></td> 
       <td class="acenter" width="75.87%"><p style="text-align:center">Actual Effort is measured in person-hours</p></td> 
      </tr> 
     </table>
    </table-wrap>
   </sec>
   <sec id="s3_5">
    <title>3.5. Mathematical Hybrid Model</title>
    <p>The state equation for each of the independent variables in the dataset are:</p>
    <p>Line of Code,</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         L 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         c 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mi>
           L 
         </mi> 
         <mi>
           o 
         </mi> 
         <msub> 
          <mi>
            c 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (1)</p>
    <p>Cyclomatic complexity,</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         v 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          g 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         E 
       </mi> 
       <mo>
         − 
       </mo> 
       <mi>
         N 
       </mi> 
       <mo>
         + 
       </mo> 
       <mn>
         2 
       </mn> 
       <mo>
         × 
       </mo> 
       <mi>
         P 
       </mi> 
      </mrow> 
     </math> (2)</p>
    <p>where E = Number of Edges in the flow graph.</p>
    <p>N = Number of Nodes in the flow graph.</p>
    <p>P = Number of Nodes that have exit point.</p>
    <p>Essential complexity</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         e 
       </mi> 
       <mi>
         v 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          g 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         E 
       </mi> 
       <mi>
         P 
       </mi> 
       <mo>
         + 
       </mo> 
       <mi>
         T 
       </mi> 
       <mi>
         P 
       </mi> 
       <mo>
         + 
       </mo> 
       <mi>
         N 
       </mi> 
       <mi>
         D 
       </mi> 
      </mrow> 
     </math> (3)</p>
    <p>where EP = Entry Points.</p>
    <p>TP = Termination points.</p>
    <p>ND = Non Deducible nodes.</p>
    <p>Design complexity,</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         i 
       </mi> 
       <mi>
         v 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          g 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mo> 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           v 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mi>
             g 
           </mi> 
           <mi>
             i 
           </mi> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (4)</p>
    <p>Program length (Total Operators + Operands),</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         N 
       </mi> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          N 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          N 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
      </mrow> 
     </math> (5)</p>
    <p>Program difficulty,</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         D 
       </mi> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
        </mrow> 
        <mn>
          2 
        </mn> 
       </mfrac> 
       <mo>
         × 
       </mo> 
       <mfrac> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math> (6)</p>
    <p>where n<sub>1</sub> = Unique Operators.</p>
    <p>n<sub>2</sub> = Unique Operands.</p>
    <p>N<sub>2</sub> = Count of Operands.</p>
    <p>Program volume V is the product of program length and the logarithm of vocabulary size (n).</p>
    <p>i.e.</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         V 
       </mi> 
       <mo>
         = 
       </mo> 
       <mi>
         N 
       </mi> 
       <mo>
         × 
       </mo> 
       <mi>
         log 
       </mi> 
       <mn>
         2 
       </mn> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          n 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> (7)</p>
    <p>Program Intelligence,</p>
    <p>1 = 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mfrac> 
        <mi>
          V 
        </mi> 
        <mi>
          D 
        </mi> 
       </mfrac> 
      </mrow> 
     </math> (8)</p>
    <p>where V is the program volume.</p>
    <p>And D in program difficulty.</p>
    <p>Program Effort, E is the product of program volume and program difficulty,</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         E 
       </mi> 
       <mo>
         = 
       </mo> 
       <mi>
         V 
       </mi> 
       <mo>
         × 
       </mo> 
       <mi>
         D 
       </mi> 
      </mrow> 
     </math> (9)</p>
    <p>Halstead Delivered Bug,</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         B 
       </mi> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mrow> 
         <msup> 
          <mi>
            E 
          </mi> 
          <mrow> 
           <mrow> 
            <mn>
              2 
            </mn> 
            <mo>
              / 
            </mo> 
            <mn>
              3 
            </mn> 
           </mrow> 
          </mrow> 
         </msup> 
        </mrow> 
        <mrow> 
         <mn>
           3000 
         </mn> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math> (10)</p>
    <p>Halstead Time Estimation,</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         T 
       </mi> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mi>
          E 
        </mi> 
        <mrow> 
         <mi>
           F 
         </mi> 
         <mo>
           × 
         </mo> 
         <mi>
           S 
         </mi> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math> (11)</p>
    <p>where E is program effort, f is the seconds to minutes factor and S in stoud number.</p>
    <p>Line of comment,</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         L 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         c 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         m 
       </mi> 
       <mi>
         m 
       </mi> 
       <mi>
         e 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         t 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mi>
           L 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           c 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           m 
         </mi> 
         <mi>
           m 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           n 
         </mi> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (12)</p>
    <p>Halstead’s count of blank lines,</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         L 
       </mi> 
       <mi>
         O 
       </mi> 
       <mi>
         B 
       </mi> 
       <mi>
         l 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         k 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mi>
           L 
         </mi> 
         <mi>
           O 
         </mi> 
         <mi>
           B 
         </mi> 
         <mi>
           l 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           n 
         </mi> 
         <msub> 
          <mi>
            k 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (13)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         U 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         i 
       </mi> 
       <mi>
         q 
       </mi> 
       <mi>
         u 
       </mi> 
       <mi>
         e 
       </mi> 
       <mtext> 
       </mtext> 
       <mi>
         o 
       </mi> 
       <mi>
         p 
       </mi> 
       <mi>
         e 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         t 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         s 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mi>
           U 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           q 
         </mi> 
         <mtext>
             
         </mtext> 
         <mi>
           o 
         </mi> 
         <msub> 
          <mi>
            p 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (14)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         U 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         i 
       </mi> 
       <mi>
         q 
       </mi> 
       <mi>
         u 
       </mi> 
       <mi>
         e 
       </mi> 
       <mtext> 
       </mtext> 
       <mi>
         o 
       </mi> 
       <mi>
         p 
       </mi> 
       <mi>
         e 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         d 
       </mi> 
       <mi>
         s 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mi>
           U 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           q 
         </mi> 
         <mtext>
             
         </mtext> 
         <mi>
           o 
         </mi> 
         <mi>
           p 
         </mi> 
         <mi>
           n 
         </mi> 
         <msub> 
          <mi>
            d 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (15)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         T 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         t 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         l 
       </mi> 
       <mtext> 
       </mtext> 
       <mi>
         o 
       </mi> 
       <mi>
         p 
       </mi> 
       <mi>
         e 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         t 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         s 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mi>
           o 
         </mi> 
         <msub> 
          <mi>
            P 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (16)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         T 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         t 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         l 
       </mi> 
       <mtext> 
       </mtext> 
       <mi>
         o 
       </mi> 
       <mi>
         p 
       </mi> 
       <mi>
         e 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         d 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mi>
           o 
         </mi> 
         <mi>
           p 
         </mi> 
         <mi>
           n 
         </mi> 
         <msub> 
          <mi>
            d 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (17)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         B 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         c 
       </mi> 
       <mi>
         h 
       </mi> 
       <mtext> 
       </mtext> 
       <mi>
         c 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         u 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         t 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mi>
           b 
         </mi> 
         <msub> 
          <mi>
            c 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (18)</p>
    <p>The relationship between the dependent variable and the independent variables was derived as follows;</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
       <mtr> 
        <mtd> 
         <mi>
           S 
         </mi> 
         <msub> 
          <mi>
            D 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mo>
           = 
         </mo> 
         <mi>
           α 
         </mi> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            β 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <mi>
           L 
         </mi> 
         <mi>
           o 
         </mi> 
         <msub> 
          <mi>
            c 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo> 
         </mo> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            β 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            g 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            β 
          </mi> 
          <mn>
            3 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <mi>
           e 
         </mi> 
         <msub> 
          <mi>
            v 
          </mi> 
          <mn>
            3 
          </mn> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            g 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            β 
          </mi> 
          <mn>
            4 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <mi>
           i 
         </mi> 
         <msub> 
          <mi>
            v 
          </mi> 
          <mn>
            4 
          </mn> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mi>
            g 
          </mi> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            β 
          </mi> 
          <mn>
            5 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            5 
          </mn> 
         </msub> 
        </mtd> 
       </mtr> 
       <mtr> 
        <mtd> 
         <mtext>
             
         </mtext> 
         <mtext>
             
         </mtext> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            β 
          </mi> 
          <mn>
            6 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            V 
          </mi> 
          <mn>
            6 
          </mn> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            β 
          </mi> 
          <mn>
            7 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            l 
          </mi> 
          <mn>
            7 
          </mn> 
         </msub> 
         <mo>
           + 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            β 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mtext>
             
         </mtext> 
         <mi>
           b 
         </mi> 
         <mi>
           r 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           c 
         </mi> 
         <mi>
           h 
         </mi> 
         <mtext>
             
         </mtext> 
         <mi>
           c 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           n 
         </mi> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <mi>
           ℰ 
         </mi> 
        </mtd> 
       </mtr> 
      </mtable> 
     </math> (19)</p>
    <p>where</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         S 
       </mi> 
       <msub> 
        <mi>
          D 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> is the dependent variable (software defect), 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        α 
      </mi> 
     </math> is the intercept, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        β 
      </mi> 
     </math> is the coefficient (effect of the independent variable on the dependent variables), Loc, V(g), ev(g), iv(g), n, V, I … are the independent variables as presented in the software dataset used in the research, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        ℰ 
      </mi> 
     </math> is the residual (error term), Let X represent all the independent variables.</p>
    <p>Therefore</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         S 
       </mi> 
       <msub> 
        <mi>
          D 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mi>
         α 
       </mi> 
       <mo>
         + 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <msub> 
          <mi>
            β 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <msub> 
          <mi>
            X 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mo> 
         </mo> 
        </mrow> 
       </mstyle> 
       <mo>
         + 
       </mo> 
       <mi>
         ℰ 
       </mi> 
      </mrow> 
     </math> (20)</p>
    <p>We state the equation for each of the independent variables in the dataset as follows;</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         P 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         j 
       </mi> 
       <mi>
         e 
       </mi> 
       <mi>
         c 
       </mi> 
       <mi>
         t 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <msub> 
          <mi>
            p 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (21)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         T 
       </mi> 
       <mi>
         e 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         m 
       </mi> 
       <mtext> 
       </mtext> 
       <mi>
         E 
       </mi> 
       <mi>
         x 
       </mi> 
       <mi>
         p 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mi>
           T 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           m 
         </mi> 
         <mi>
           E 
         </mi> 
         <mi>
           x 
         </mi> 
         <msub> 
          <mi>
            P 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (22)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         M 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         g 
       </mi> 
       <mi>
         e 
       </mi> 
       <mi>
         r 
       </mi> 
       <mtext> 
       </mtext> 
       <mi>
         E 
       </mi> 
       <mi>
         x 
       </mi> 
       <mi>
         p 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mi>
           M 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           g 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           r 
         </mi> 
         <mi>
           E 
         </mi> 
         <mi>
           x 
         </mi> 
         <msub> 
          <mi>
            P 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (23)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         L 
       </mi> 
       <mi>
         e 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         g 
       </mi> 
       <mi>
         t 
       </mi> 
       <mi>
         h 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <msub> 
          <mi>
            L 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (24)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         T 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         s 
       </mi> 
       <mi>
         a 
       </mi> 
       <mi>
         c 
       </mi> 
       <mi>
         t 
       </mi> 
       <mi>
         i 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         n 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <mi>
           f 
         </mi> 
         <mi>
           p 
         </mi> 
         <mi>
           c 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           t 
         </mi> 
         <msub> 
          <mi>
            T 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (25)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         E 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         t 
       </mi> 
       <mi>
         i 
       </mi> 
       <mi>
         t 
       </mi> 
       <mi>
         i 
       </mi> 
       <mi>
         e 
       </mi> 
       <mi>
         s 
       </mi> 
       <mo>
         = 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <msub> 
          <mi>
            E 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
      </mrow> 
     </math> (26)</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
       <mtr> 
        <mtd> 
         <mi>
           P 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           t 
         </mi> 
         <mtext> 
         </mtext> 
         <mi>
           N 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           n 
         </mi> 
         <mtext> 
         </mtext> 
         <mi>
           a 
         </mi> 
         <mi>
           d 
         </mi> 
         <mi>
           j 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           s 
         </mi> 
         <mi>
           t 
         </mi> 
         <mo>
           = 
         </mo> 
         <mi>
           f 
         </mi> 
         <mi>
           p 
         </mi> 
         <mi>
           c 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           t 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mi>
             I 
           </mi> 
           <mi>
             L 
           </mi> 
           <mi>
             F 
           </mi> 
           <mi>
             s 
           </mi> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           + 
         </mo> 
         <mi>
           f 
         </mi> 
         <mi>
           p 
         </mi> 
         <mi>
           c 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           t 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mi>
             E 
           </mi> 
           <mi>
             I 
           </mi> 
           <msub> 
            <mi>
              F 
            </mi> 
            <mi>
              s 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           + 
         </mo> 
         <mi>
           f 
         </mi> 
         <mi>
           p 
         </mi> 
         <mi>
           c 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           t 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mi>
             E 
           </mi> 
           <msub> 
            <mi>
              I 
            </mi> 
            <mi>
              s 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mtd> 
       </mtr> 
       <mtr> 
        <mtd> 
         <mtext>
             
         </mtext> 
         <mtext>
             
         </mtext> 
         <mo>
           + 
         </mo> 
         <mi>
           f 
         </mi> 
         <mi>
           p 
         </mi> 
         <mi>
           c 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           t 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mi>
             E 
           </mi> 
           <msub> 
            <mi>
              O 
            </mi> 
            <mi>
              s 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           + 
         </mo> 
         <mi>
           f 
         </mi> 
         <mi>
           p 
         </mi> 
         <mi>
           c 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           t 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mi>
             E 
           </mi> 
           <msub> 
            <mi>
              Q 
            </mi> 
            <mi>
              s 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mtd> 
       </mtr> 
      </mtable> 
     </math> (27)</p>
    <p>where</p>
    <p>ILF is Internal Logical File.</p>
    <p>EIF is External Interface File.</p>
    <p>EI is External Input.</p>
    <p>EO is External Output.</p>
    <p>EQ is External Inquiries.</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         P 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         i 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         t 
       </mi> 
       <mtext> 
       </mtext> 
       <mi>
         a 
       </mi> 
       <mi>
         d 
       </mi> 
       <mi>
         j 
       </mi> 
       <mi>
         u 
       </mi> 
       <mi>
         s 
       </mi> 
       <mi>
         t 
       </mi> 
       <mo>
         = 
       </mo> 
       <mi>
         N 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         n 
       </mi> 
       <mtext>
         - 
       </mtext> 
       <mi>
         a 
       </mi> 
       <mi>
         d 
       </mi> 
       <mi>
         j 
       </mi> 
       <mi>
         u 
       </mi> 
       <mi>
         s 
       </mi> 
       <mi>
         t 
       </mi> 
       <mi>
         e 
       </mi> 
       <mi>
         d 
       </mi> 
       <mtext> 
       </mtext> 
       <mi>
         F 
       </mi> 
       <mi>
         P 
       </mi> 
       <mi>
         C 
       </mi> 
       <mo>
         × 
       </mo> 
       <mi>
         V 
       </mi> 
       <mi>
         A 
       </mi> 
       <mi>
         F 
       </mi> 
      </mrow> 
     </math> (28)</p>
    <p>where</p>
    <p>VAF is the Value Adjustment Factor.</p>
    <p>The relationship between the dependent variable and the independent variable is derived as follows</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
       <mtr> 
        <mtd> 
         <mi>
           C 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           s 
         </mi> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mi>
            K 
          </mi> 
         </msub> 
         <mo>
           = 
         </mo> 
         <mi>
           θ 
         </mi> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            δ 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <mi>
           p 
         </mi> 
         <mi>
           r 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           j 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           c 
         </mi> 
         <msub> 
          <mi>
            t 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            δ 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <mi>
           t 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           m 
         </mi> 
         <mi>
           E 
         </mi> 
         <mi>
           x 
         </mi> 
         <msub> 
          <mi>
            p 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            δ 
          </mi> 
          <mn>
            3 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <mi>
           m 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           g 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           r 
         </mi> 
         <mi>
           E 
         </mi> 
         <mi>
           x 
         </mi> 
         <msub> 
          <mi>
            p 
          </mi> 
          <mn>
            3 
          </mn> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            δ 
          </mi> 
          <mn>
            4 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <mi>
           y 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           r 
         </mi> 
         <mi>
           E 
         </mi> 
         <mi>
           n 
         </mi> 
         <msub> 
          <mi>
            d 
          </mi> 
          <mn>
            4 
          </mn> 
         </msub> 
        </mtd> 
       </mtr> 
       <mtr> 
        <mtd> 
         <mtext>
             
         </mtext> 
         <mtext>
             
         </mtext> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            δ 
          </mi> 
          <mn>
            5 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <mi>
           l 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           g 
         </mi> 
         <mi>
           t 
         </mi> 
         <msub> 
          <mi>
            h 
          </mi> 
          <mn>
            5 
          </mn> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            δ 
          </mi> 
          <mn>
            6 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <mi>
           t 
         </mi> 
         <mi>
           r 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           s 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           c 
         </mi> 
         <mi>
           t 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           o 
         </mi> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            6 
          </mn> 
         </msub> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            δ 
          </mi> 
          <mn>
            7 
          </mn> 
         </msub> 
         <mtext>
             
         </mtext> 
         <mi>
           e 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           t 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           t 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           e 
         </mi> 
         <msub> 
          <mi>
            s 
          </mi> 
          <mn>
            7 
          </mn> 
         </msub> 
         <mo>
           + 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           + 
         </mo> 
         <msub> 
          <mi>
            δ 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
         <mtext>
             
         </mtext> 
         <mi>
           l 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           n 
         </mi> 
         <mi>
           g 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           g 
         </mi> 
         <msub> 
          <mi>
            e 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
         <mo>
           + 
         </mo> 
         <mi>
           ℰ 
         </mi> 
        </mtd> 
       </mtr> 
      </mtable> 
     </math> (29)</p>
    <p>where</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        θ 
      </mi> 
     </math> is the intercept.</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        δ 
      </mi> 
     </math> is the coefficient.</p>
    <p>Project<sub>1</sub>, teamExp<sub>2</sub>, ManagerExp<sub>3</sub>, yearEnd<sub>4</sub>, length<sub>5</sub>, transactions<sub>6</sub>, entities<sub>7</sub>, PointNonAdjusts<sub>8</sub>, PointAdjust<sub>9</sub>, Language<sub>10</sub> are the independent variables.</p>
    <p>Let P represent all the independent variables,</p>
    <p>Therefore,</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         C 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         s 
       </mi> 
       <msub> 
        <mi>
          t 
        </mi> 
        <mi>
          k 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mi>
         θ 
       </mi> 
       <mo>
         + 
       </mo> 
       <mstyle displaystyle="true"> 
        <msubsup> 
         <mo>
           ∑ 
         </mo> 
         <mrow> 
          <mi>
            k 
          </mi> 
          <mo>
            = 
          </mo> 
          <mi>
            i 
          </mi> 
         </mrow> 
         <mi>
           n 
         </mi> 
        </msubsup> 
        <mrow> 
         <msub> 
          <mi>
            δ 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
         <msub> 
          <mi>
            P 
          </mi> 
          <mi>
            k 
          </mi> 
         </msub> 
        </mrow> 
       </mstyle> 
       <mo>
         + 
       </mo> 
       <mi>
         ℰ 
       </mi> 
      </mrow> 
     </math> (30)</p>
    <p>To hybridize Equations (3.20) and (3.30), we need them merge them into a single equation that incorporates elements from both equations. Since both equations represent different aspects of software development (defect and cost), we create a unified model that accounts for both factors. One way to achieve this is by incorporating both defects and cost components into a single equation as shown in Equation (31).</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         S 
       </mi> 
       <msub> 
        <mi>
          D 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          β 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <msub> 
        <mi>
          X 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          δ 
        </mi> 
        <mi>
          k 
        </mi> 
       </msub> 
       <msub> 
        <mi>
          P 
        </mi> 
        <mi>
          k 
        </mi> 
       </msub> 
       <mo>
         + 
       </mo> 
       <msub> 
        <mi>
          ℰ 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> (31)</p>
    <p>where</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         S 
       </mi> 
       <msub> 
        <mi>
          D 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> represents the dependent variable for software defect and cost, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          β 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> is the coefficient representing the effect of the independent variables related to defect, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          X 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> represents the independent variables related to defect, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          δ 
        </mi> 
        <mi>
          k 
        </mi> 
       </msub> 
      </mrow> 
     </math> is the coefficient representing the effect of the independent variables related to cost, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          P 
        </mi> 
        <mi>
          k 
        </mi> 
       </msub> 
      </mrow> 
     </math> represents the independent variables related to cost, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          ℰ 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> is the residual error term.</p>
    <p>The hybridized equation combines aspects of both the software defect model and the software cost model into a single equation allowing for the simultaneous considerations of both the defect and cost factors in the evaluation.</p>
    <p>Equation (31) formalizes a joint objective combining classification and regression losses within the same SVM framework:</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <munder> 
        <mrow> 
         <mi>
           min 
         </mi> 
        </mrow> 
        <mrow> 
         <msub> 
          <mstyle mathvariant="bold" mathsize="normal"> 
           <mi>
             w 
           </mi> 
          </mstyle> 
          <mi>
            d 
          </mi> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mstyle mathvariant="bold" mathsize="normal"> 
           <mi>
             w 
           </mi> 
          </mstyle> 
          <mi>
            c 
          </mi> 
         </msub> 
        </mrow> 
       </munder> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mi>
           α 
         </mi> 
         <msub> 
          <mi>
            L 
          </mi> 
          <mrow> 
           <mtext>
             defect 
           </mtext> 
          </mrow> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mstyle mathvariant="bold" mathsize="normal"> 
             <mi>
               w 
             </mi> 
            </mstyle> 
            <mi>
              d 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           + 
         </mo> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <mi>
             α 
           </mi> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <msub> 
          <mi>
            L 
          </mi> 
          <mrow> 
           <mtext>
             cost 
           </mtext> 
          </mrow> 
         </msub> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mstyle mathvariant="bold" mathsize="normal"> 
             <mi>
               w 
             </mi> 
            </mstyle> 
            <mi>
              c 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         + 
       </mo> 
       <mi>
         Ω 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mstyle mathvariant="bold" mathsize="normal"> 
           <mi>
             w 
           </mi> 
          </mstyle> 
          <mi>
            d 
          </mi> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mstyle mathvariant="bold" mathsize="normal"> 
           <mi>
             w 
           </mi> 
          </mstyle> 
          <mi>
            c 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
      </mrow> 
     </math></p>
    <p>where</p>
    <p>• 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mstyle mathvariant="bold" mathsize="normal"> 
         <mi>
           w 
         </mi> 
        </mstyle> 
        <mi>
          d 
        </mi> 
       </msub> 
      </mrow> 
     </math> are weights for defect prediction (classification),</p>
    <p>• 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mstyle mathvariant="bold" mathsize="normal"> 
         <mi>
           w 
         </mi> 
        </mstyle> 
        <mi>
          c 
        </mi> 
       </msub> 
      </mrow> 
     </math> are weights for cost estimation (regression),</p>
    <p>• 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          L 
        </mi> 
        <mrow> 
         <mtext>
           defect 
         </mtext> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> typically denotes a hinge loss or other classification loss,</p>
    <p>• 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          L 
        </mi> 
        <mrow> 
         <mtext>
           cost 
         </mtext> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> denotes an ε-insensitive or squared error regression loss,</p>
    <p>• 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         α 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
      </mrow> 
     </math> balances the two tasks,</p>
    <p>• Ω is a regularization term (e.g., L<sub>2</sub> norm) preventing overfitting.</p>
    <p>The PCA-transformed features feed into both defect (SVM classifier) and cost (SVM regressor), enabling them to learn from a consistent representation. We apply a unified kernel (e.g., RBF or polynomial) for both tasks, ensuring the same non-linear feature mapping in the SVM. The classifier and regressor maintain separate decision functions within this shared space. This unified approach allows cost predictions to be influenced by knowledge from defect patterns and vice versa, uncovering relationships like “higher complexity → higher defect risk → potentially higher cost,” within one integrated learning procedure.</p>
    <p>The outputs of this system include the predicted software defects and estimated software development costs, where the cost is quantified as the actual effort measured in person-hours. These outputs are displayed in both numeric and graphical formats for better interpretability and decision-making. The outputs are visualized through the computer’s display unit, ensuring user-friendly presentation and comprehensive insights. The high-level output model of this system is depicted in <xref ref-type="fig" rid="fig7">
      Figure 7
     </xref>.</p>
    <fig id="fig7" position="float">
     <label>Figure 7</label>
     <caption>
      <title>Figure 7. Output Design of the Hybrid model.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1733061-rId128.jpeg?20250428034038" />
    </fig>
   </sec>
  </sec><sec id="s4">
   <title>4. Results and Discussion</title>
   <p>The results of the study highlight the performance and effectiveness of the proposed hybrid model in software defect prediction and cost evaluation. The findings are categorized into key metrics and their implications.</p>
   <sec id="s4_1">
    <title>4.1. Defect Prediction Results</title>
    <p>The performance results of the defect prediction feature of the hybrid model are outlined in <xref ref-type="table" rid="table3">
      Table 3
     </xref>.</p>
    <table-wrap id="table3">
     <label>
      <xref ref-type="table" rid="table3">
       Table 3
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.142318-"></xref>Table 3. Defect prediction results.</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="45.99%"><p style="text-align:center">Metric</p></td> 
       <td class="custom-bottom-td acenter" width="44.47%"><p style="text-align:center">Value (%)</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="45.99%"><p style="text-align:center">Accuracy</p></td> 
       <td class="custom-top-td acenter" width="44.47%"><p style="text-align:center">94.5</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="45.99%"><p style="text-align:center">Precision</p></td> 
       <td class="acenter" width="44.47%"><p style="text-align:center">93.7</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="45.99%"><p style="text-align:center">Recall</p></td> 
       <td class="acenter" width="44.47%"><p style="text-align:center">92.3</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="45.99%"><p style="text-align:center">F1-Score</p></td> 
       <td class="acenter" width="44.47%"><p style="text-align:center">93.0</p></td> 
      </tr> 
     </table>
    </table-wrap>
   </sec>
   <sec id="s4_2">
    <title>4.2. Cost Estimation Results</title>
    <p>The Coefficient of Determination (R<sup>2</sup>) of the cost estimation prediction is 0.87, the Mean Absolute Error (MAE) is 5.2 persons per hour, and the Root Mean Squared Error (RMSE) is 6.8 persons per hour. <xref ref-type="fig" rid="fig8">
      Figure 8
     </xref> shows the performance graph of the Defect Prediction Results.</p>
    <fig id="fig8" position="float">
     <label>Figure 8</label>
     <caption>
      <title>Figure 8. Performance graph of the defect prediction results.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1733061-rId129.jpeg?20250428034040" />
    </fig>
   </sec>
   <sec id="s4_3">
    <title>4.3. Model Performance</title>
    <p>The model performance is highlighted in three measurements, namely;</p>
    <p>1) Hybrid Model Synergy: By combining defect prediction and cost evaluation, the hybrid model exhibited improved efficiency compared to separate models. The integrated approach allowed for insights into correlations between defects and cost.</p>
    <p>2) Principal Component Analysis (PCA): PCA effectively reduced dimensionality, retaining 95% of the dataset’s variance, which enhanced computational efficiency without compromising prediction accuracy.</p>
    <p>3) K-Fold Cross-Validation: The model maintained consistent performance across all folds, confirming its generalizability.</p>
   </sec>
   <sec id="s4_4">
    <title>4.4. Discussion</title>
    <p>The accuracy (94.5%) of the hybrid model demonstrates high reliability in identifying defect-prone components in software systems. A high precision (93.7%) indicates that the model minimizes false positives, which is critical for ensuring trust in defect predictions. The recall (92.3%) reveals that the model effectively identifies most actual defects, reducing the risk of undetected bugs. The F1-Score (93.0%) suggests a balanced performance between precision and recall, ensuring robustness in real-world applications.</p>
    <p>Similarly, Coefficient of Determination (R<sup>2</sup>): The model achieved an R<sup>2</sup> value of 0.87, demonstrating its strong ability to explain variance in software development costs. Mean Absolute Error (MAE): The MAE was 5.2 person-hours, indicating minimal deviation between predicted and actual cost values. Root Mean Squared Error (RMSE): The RMSE was 6.8 person-hours, further validating the accuracy of the cost estimation.</p>
    <p>The study validated the dual capability of SVM in classification (defect prediction) and regression (cost estimation). Its ability to handle high-dimensional datasets and separate classes with a maximum-margin hyperplane contributed to the model’s effectiveness.</p>
    <p>The hybrid model outperforms traditional models (e.g., Naïve Bayes, Decision Tree) used by Hammouri et al. (2018) for defect prediction and Premalatha and Srikrishna (2019) for cost estimation <xref ref-type="bibr" rid="scirp.142318-15">
      [15]
     </xref> <xref ref-type="bibr" rid="scirp.142318-36">
      [36]
     </xref>. Unlike existing models, the hybridized approach integrates defect prediction and cost estimation, providing a unified solution. The application of Principal Component Analysis (PCA) for dimensionality reduction enhanced computational efficiency and reduced overfitting. K-fold cross-validation ensured unbiased performance evaluation, strengthening the reliability of the results.</p>
    <p>Combining classification (defects) and regression (costs) tasks uncovers potential correlations between software quality attributes and cost factors. The hybrid model leverages larger datasets and advanced preprocessing techniques, making it adaptable to real-world scenarios. SVM’s duality in handling diverse tasks (classification and regression) ensures optimized performance across both domains. The contribution to Software Engineering therefore includes; Defect Prediction, Cost Estimation, and Correlation Insights.</p>
    <p>In contrast to training two separate, optimized models, the proposed hybrid model integrates defect prediction (classification) and cost estimation (regression) into a unified framework. Empirical evidence (Caruana, 1997) indicates that multi-task learning can exploit overlapping data patterns. For instance, complexity metrics, team experience, and code churn often influence both defect proneness and cost. A single model capitalizes on these shared features rather than duplicating efforts in two disjoint models. Multi-task learning commonly acts as a natural regularizer, preventing the model from overfitting to just one objective. By simultaneously learning defects and cost, the model is forced to find parameter configurations that explain both tasks, often leading to better generalization. A single hybrid model simplifies deployment pipelines (e.g., continuous integration setups) by producing both defect predictions and cost estimates from one codebase. This streamlines updates, monitoring, and resource allocation compared to maintaining two separate ML models. The hybrid approach yields competitive or even superior performance metrics (F1, MAE) compared to specialized single-task models. Notably, it also reveals potential correlations such as how modules with higher defect risk often correlate with elevated cost/effort. Hence, by combining both tasks, our study advances the state of software analytics, offering holistic insights that can enhance project management strategies more effectively than disjoint, specialized models.</p>
   </sec>
  </sec><sec id="s5">
   <title>5. Summary</title>
   <p>Across NASA PROMISE and Kaggle datasets, the hybrid SVM consistently outperformed or matched specialized single-task systems, confirming the value of multi-task synergy. The study achieved 94.5% accuracy, 93.7% precision, 92.3% recall, and 93.0% F1 marking a notable improvement over baseline defect classifiers on the same datasets (Hammouri et al., 2018; Alsaeedi &amp; Khan, 2019). The regression submodule recorded R<sup>2</sup> = 0.87, MAE = 5.2 person-hours, and RMSE = 6.8 person-hours. These results suggest that harnessing defect-related insights can enhance cost predictions. PCA’s 95% variance retention struck a favorable balance between compactness and predictive power. As a result, training was faster and less prone to overfitting, confirming the efficacy of dimensionality reduction for large, heterogeneous software metrics. By jointly modeling defects and costs, project managers can prioritize modules needing both immediate bug resolution and higher budget allocations, enabling targeted resource planning. The synergy also suggests that reducing complexity (to mitigate bugs) may consequently reduce costs, a relationship that becomes clearer through multi-task analysis. We plan to integrate other advanced machine learning methods (e.g., XGBoost, deep multi-task networks) and explore expanded datasets or real-time data streams to validate the model’s scalability and robustness in broader contexts.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.142318-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kalaivani, A. and Beena, R. (2018) Machine Learning-Based Software Defect Prediction: A Survey. International Journal of Pure and Applied Mathematics, 118, 121-135.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Azzeh, M., Nassif, A.B. and Bannai, Y. (2018) Software Fault Prediction Using Ensemble Learning: A Comprehensive Review. Journal of Software Engineering Re-search and Development, 6, 1-23.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Silhavy, R., Silhavy, P. and Prokopova, Z. (2017) Analysis and Evaluation of Software Defect Prediction Using Machine Learning Models. Information and Software Technology, 92, 102-116.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Lopez-Martin, M., Carro, B. and Sanchez, M. (2006) Fault Prediction in Software Modules Using Support Vector Machines. Neurocomputing, 69, 1298-1307.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Samuel, A.L. (1959) Some Studies in Machine Learning Using the Game of Checkers. IBM Journal of Research and Development, 3, 210-229. &gt;https://doi.org/10.1147/rd.33.0210
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Huang, L. and Strigini, L. (2018) Cognitive Error Model: Understanding Human Errors in Software Development. Journal of Software Engineering Research and Development, 6, 15-28.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Huang, L. and Liu, J. (2016) Defect Prevention based on Human Error Theories: A Meta-Cognition Approach. Journal of Systems and Software, 120, 36-47.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Saini, R. and Ahmad, M. (2012) Chaos Theory of Software Systems: A Nonlinear Dynamics Approach. International Journal of Computer Applications, 45, 25-30.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bowes, D., Hall, T. and Petric, J. (2017) Software Defect Prediction: Do Different Datasets Make a Difference? Information and Software Technology, 87, 1-18.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Alsaeedi, M. and Khan, M. (2019) A Study on Machine Learning Algorithms for Software Defect Prediction. International Journal of Advanced Computer Science and Applications, 10, 366-373.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Sidorova, N. (2020) Classification of Software Defects by Severity and Priority. Journal of Software: Evolution and Process, 32, e2265.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Suwanjang, S. and Prompoon, N. (2012) Software Cost Estimation: A Comparative Study of Algorithmic and Non-Algorithmic Models. Proceedings of the International Conference on Software Engineering and Knowledge Engineering, San Francisco, 1-3 July 2012, 343-349.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ukpe, K.C. and Amannah, C.I. (2022) Comparative Analysis of Supervised and Un-supervised Learning Techniques for Defect Prediction. Journal of Computing and Applied Research, 5, 45-60.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Jayanthi, S., et al. (2017) Machine Learning Metrics in Software Defect Prediction. International Journal of Advanced Computer Science and Applications, 8, 224-231
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hammouri, A., Hammad, M., Alnabhan, M. and Alsarayrah, F. (2018) Software Bug Prediction Using Machine Learning Approach. International Journal of Advanced Computer Science and Applications, 9, 78-83. &gt;https://doi.org/10.14569/ijacsa.2018.090212
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Dam, H.K., Tran, T. and Pham, B. (2018) A Deep Learning Approach for Software Defect Prediction Using Tree-Structured LSTM. Empirical Software Engineering, 23, 3240-3265.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Huda, S., Alyahya, S. and Khan, S. (2017) Hybrid Wrapper-Filter Approach for Software Defect Prediction. IEEE Access, 5, 26953-26967.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Jinsheng, Z., Xiaoyan, L. and Yuxin, L. (2014) Asymmetric Kernel Classifiers for Imbalanced Data. Journal of Computers, 9, 2565-2572. 
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Aleem, S., Capretz, L.F. and Ahmed, F. (2015) Benchmarking Machine Learning Techniques for Software Defect Detection. International Journal of Software Engineering&amp;Applications, 6, 11-23. &gt;https://doi.org/10.5121/ijsea.2015.6302
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref20">
    <label>20</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Sun, Y., Wong, A.K.C. and Kamel, M.S. (2009) Classification of Imbalanced Data: A Review. International Journal of Pattern Recognition and Artificial Intelligence, 23, 687-719. &gt;https://doi.org/10.1142/s0218001409007326
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref21">
    <label>21</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Petric, J., Bozdoc, M. and Petric, T. (2016) Diversity Techniques in Stacking Ensemble for Software Defect Prediction. Informatica, 40, 383-390.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref22">
    <label>22</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Pan, Y., Zhang, H. and Lin, Y. (2019) Improved Convolutional Neural Networks for Defect Prediction in Software. Expert Systems with Applications, 123, 279-292.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref23">
    <label>23</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Laradji, I.H., Babic, D. and Valdivia Garcia, J. (2015) Ensemble Learning and Feature Selection for Software Defect Prediction. Information and Software Technology, 61, 110-121.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref24">
    <label>24</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Pelayo, L. and Dick, S. (2014) Addressing Class Imbalance in Software Defect Prediction with SMOTE. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 44, 50-61.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref25">
    <label>25</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Balogun, A.O., Ghani, A.A.A. and Babatunde, O.H. (2019) Analysis of Feature Se-lection Techniques for Software Defect Prediction: A Comparative Study. IEEE Access, 7, 111344-111364.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref26">
    <label>26</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wu, Y., Li, H. and Sun, J. (2018) A Cost-Sensitive Dictionary Learning Approach for Software Defect Prediction. Applied Soft Computing, 73, 413-424.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref27">
    <label>27</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Fan, Z., Xia, X., Lo, D. and Li, S. (2019) Attention-Based Recurrent Neural Network for Software Defect Prediction. Journal of Systems and Software, 147, 213-224. 
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref28">
    <label>28</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wang, S., Yu, Z. and Xu, Y. (2011) Ensemble Methods for Software Defect Prediction: An Empirical Study. Journal of Systems and Software, 84, 2361-2372.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref29">
    <label>29</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Song, Q., Jia, Z., Shepperd, M., Ying, S. and Liu, J. (2011) A General Software Defect-Proneness Prediction Framework. IEEE Transactions on Software Engineering, 37, 356-370. &gt;https://doi.org/10.1109/tse.2010.90
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref30">
    <label>30</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Huang, X., Wu, J. and Tang, Y. (2015) Preprocessing Techniques for Improving Software Cost Estimation Models. Journal of Systems and Software, 102, 31-41.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref31">
    <label>31</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Nassif, A.B., Ho, D. and Capretz, L.F. (2013) Towards an Early Software Estimation Using Log-Linear Regression and a Multilayer Perceptron Model. Journal of Systems and Software, 86, 144-160. &gt;https://doi.org/10.1016/j.jss.2012.07.050
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref32">
    <label>32</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zhang, H., Li, X. and Sun, J. (2018) Multi-Task Learning for Software Defect Prediction. Proceedings of the 40th International Conference on Software Engineering, Gothenburg, 27 May-3 June 2018, 27-37.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref33">
    <label>33</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Sun, Y. and Xia, X. (2019) Multi-Task Convolutional Neural Network for Software Defect Prediction and Code Smell Detection. IEEE Transactions on Software Engineering, 47, 489-506.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref34">
    <label>34</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Panichella, S., et al. (2020) Combined Approaches for Defect Classification and Effort Forecasting. Software Quality Journal, 28, 561-583.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref35">
    <label>35</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kim, D. and Williams, L. (2021) Bayesian Multi-Task Learning for Software Analytics. Journal of Systems and Software, 175, Article ID: 110916.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref36">
    <label>36</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Premalatha, A. and Srikrishna, S. (2019) A Cost-Sensitive Deep Belief Network Model for Software Cost Estimation. International Journal of Applied Engineering Research, 14, 60-67.
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref37">
    <label>37</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Caruana, R. (1997) Multitask Learning. Machine Learning, 28, 41-75. &gt;https://doi.org/10.1023/a:1007379606734
    </mixed-citation>
   </ref>
   <ref id="scirp.142318-ref38">
    <label>38</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hammouri, A.I., Alshayeb, M. and Mahmood, S. (2018) Software Defect Prediction Using Supervised Machine Learning and Unsupervised Clustering. Arabian Journal for Science and Engineering, 43, 7965-7975.
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>