Search

This study presents a comprehensive analysis of enhancing software effort estimation accuracy using a Self-Organizing Migration Algorithm (SOMA)-optimized Constructive Cost Model (COCOMO). By conducting a comparative study of traditional COCOMO models and SOMA-optimized variants across preprocessed datasets (NASA93, NASA63, NASA18, Kemerer, Miyazaki94, and Turkish), our research focuses on crucial evaluation metrics, including Mean Magnitude of Relative Error (MMRE), Prediction at 0.25 (PRED(0.25)), Mean Absolute Error (MAE), and Root Mean Square Error (RMSE). The analysis encompasses various configurations of COCOMO models—basic, intermediate, and post-architecture COCOMO II, supplemented with additional statistical testing and residual analysis for in-depth insights. The results demonstrate that the SOMA-optimized COCOMO models generally surpass traditional models in predictive accuracy, especially notable in metrics such as MMRE where an improvement of up to 12%, PRED(0.25) with an enhancement of 15%, MAE reduction by 18%, and a decrease in RMSE by 20% were observed. However, performance variances were identified in specific scenarios, highlighting areas for further refinement, particularly in large-scale estimations where residual plots suggested the potential for underestimation or overestimation. The study concludes that integrating the SOMA optimization algorithm into COCOMO models significantly enhances the accuracy of software effort estimations, providing valuable insights for future research to optimise estimations for larger projects and advance prediction models. This advancement addresses the technical challenge of parameter accuracy and offers a methodological improvement in model selection and application, underscoring the potential of metaheuristic optimization in software effort estimation.

This study embarks on an in-depth analysis of the performance of various kernel functions, namely uniform, epanechnikov, triangular, and gaussian, in window-based and spectral clustering-based models. Employing seven distinct datasets, our approach evaluated both window sizes (25%, 50%, 75%, and 100%) and clustering clusters (ranging from 1 to 4). The kernel functions served as weighting functions for regression models, leading to the creation of 192 window-based and 192 clustering-based models. Our analysis underscores the dominance of the uniform kernel function. In most models where the Pred(0.25) was maximal and the Mean Absolute Error was minimal, the uniform kernel function was predominantly utilized. Further, our results exhibit varying outcomes between moving windows and spectral clustering across datasets. For instance, in the fpa_china dataset, while moving windows with a 50% size displayed no significant superiority over spectral-clustering with 1 cluster, spectral-clustering (1 cluster) demonstrated a significantly enhanced performance. However, in datasets like fpa_kitchenham, neither approach proved to be significantly better. This comprehensive exploration into the efficiency of kernel functions in moving windows and spectral-clustering models provides valuable insights for future research and applications in data modelling and analysis.

This study focuses on improving the accuracy of effort estimation by employing ensemble, deep learning, and transfer learning techniques. An ensemble approach is utilized, incorporating XGBoost, Random Forest, and Histogram Gradient Boost as generators to enhance predictive capabilities. The performance of the ensemble method is compared against both the deep learning approach and the PFA-IFPUG technique. Statistical criteria including MAE, SA, MMRE, PRED(0.25), MBRE, MIBRE, and relevant information related to MMRE and PRED(0.25) are employed for evaluation. The results demonstrate that combining regression models with Random Forest as the final regressor and XGBoost and Histogram Gradient Boost as prior generators yields more accurate effort estimation than other combinations. Furthermore, the findings highlight the potential of transfer learning in the deep learning method, which exhibits superior performance over the ensemble approach. This approach leverages pre-trained models and continuously improves performance by training on new datasets, providing valuable insights for cross-company and cross-time effort estimation problems. The ISBSG dataset is used to build the pre-trained model, and the inductive transfer learning approach is verified based on the Desharnais, Albrecht, Kitchenham, and China datasets. The study underscores the significance of transfer learning and the integration of domain-specific knowledge from existing models to enhance the performance of new models, thereby improving accuracy, reducing errors, and enhancing predictive capabilities in effort estimation.

Context: Effort estimation is one of the essential phases that must be accurately predicted in the early stage of software project development. Currently, solving problems that affect the estimation accuracy of Use Case Points-based methods is still a challenge to be addressed. Objective: This paper proposes a parametric software effort estimation model based on Optimizing Correction Factors and Multiple Regression Models to minimize the estimation error and the influence of unsystematic noise, which has not been considered in previous studies. The proposed method takes advantage of the Least Squared Regression models and Multiple Linear Regression models on the Use Case Points-based elements. Method: We have conducted experimental research to evaluate the estimation accuracy of the proposed method and compare it with three previous related methods, i.e., 1) the baseline estimation method – Use Case Points, 2) Optimizing Correction Factors, and 3) Algorithmic Optimization Method. Experiments were performed on datasets (Dataset D1, Dataset D2, and Dataset D3). The estimation accuracy of the methods was analysed by applying various unbiased evaluation criteria and statistical tests. Results: The results proved that the proposed method outperformed the other methods in improving estimation accuracy. Statistically, the results proved to be significantly superior to the three compared methods based on all tested datasets. Conclusion: Based on our obtained results, the proposed method has a high estimation capability and is considered a helpful method for project managers during the estimation phase. The correction factors are considered in the estimation process.

Introduction: The precise estimation of software effort is a significant difficulty that project managers encounter during software development. Inaccurate forecasting leads to either overestimating or underestimating software effort, which can be detrimental for stakeholders. The International Function Point Users Group’s Function Point Analysis (FPA) method is one of the most critical methods for software effort estimation. However, the practice of using the FPA method in the same fashion across all software areas needs to be reexamined. Aim: We propose a model for evaluating the influence of data clustering on software development effort estimation and then finding the best clustering method. We call this model the effort estimation using machine learning applied to the clusters (EEAC) model. Method: We cluster the dataset according to the clustering method and then apply the FPA and EEAC methods to these clusters for effort estimation. The clustering methods we use in this study include five categorical variable criteria (Development Platform, Industrial Sector, Language Type, Organization Type, and Relative Size) and the k-means clustering algorithm. Results: The experimental results show that the estimation accuracy obtaining with clustering consistently outperforms the accuracy without clustering for both the FPA and EEAC methods. Significantly, using the FPA method, the average improvement rate from using clustering as opposed to non-clustered was highest at 58.06%, according to the RMSE. With the EEAC method, this number reached 65.53%. The Industry Sector categorical variable achieves the best accuracy estimation compared to the other clustering criteria and k-means clustering. The improvement in accuracy in terms of the RMSE when applying this criterion is 63.68% for the FPA method and 72.02% for the EEAC method. Conclusion: Better results are obtained through dataset clustering compared to no clustering for both the FPA and EEAC methods. The Industry Sector is the most suitable clustering method among the tested clustering methods.

This study compares the performance of Pytorch-based Deep Learning, Multiple Perceptron Neural Networks with Multiple Linear Regression in terms of software effort estimations based on function point analysis. This study investigates Adjusted Function Points, Function Point Categories, Industry Sector, and Relative Size. The ISBSG dataset (version 2020/R1) is used as the historical dataset. The effort estimation performance is compared among multiple models by evaluating a prediction level of 0.30 and standardized accuracy. According to the findings, the Multiple Perceptron Neural Network based on Adjusted Function Points combined with Industry Sector predictors yielded 53% and 61% in terms of standardized accuracy and a prediction level of 0.30, respectively. The findings of Pytorch-based Deep Learning are similar to Multiple Perceptron Neural Networks, with even better results than that, with standardized accuracy and a prediction level of 0.30, 72% and 72%, respectively. The results reveal that both the Pytorch-based Deep Learning and Multiple Perceptron model outperformed Multiple Linear Regression and baseline models using the experimental dataset. Furthermore, in the studied dataset, Adjusted Function Points may not contribute to higher accuracy than Function Point Categories.

The prediction level at x (PRED(x)) and mean magnitude of relative error (MMRE) are measured based on the magnitude of relative error between real and predicted values. They are the standard metrics that evaluate accurate effort estimates. However, these values might not reveal the magnitude of over-/under-estimation. This study aims to define additional information associated with the PRED(x) and MMRE to help practitioners better interpret those values. We propose the formulas associated with the PRED(x) and MMRE to express the level of scatters of predictive values versus actual values on the left (sigLeft), on the right (sigRight), and on the mean of the scatters (sig). We depict the benefit of the formulas with three use case points datasets. The proposed formulas might contribute to enriching the value of the PRED(x) and MMRE in validating the effort estimation.

Over the last few years, more and more people have been using YouTube videos to experience virtual reality travel. Many individuals utilize comments to voice their ideas or criticize a subject on YouTube. The number of replies to 360-degree and unidirectional videos is enormous and might differ between the two kinds of videos. This presents the problem of efficiently evaluating user opinions with respect to which type of video will be more appealing to viewers, positive comments, or interest. This paper aims to study SentiStrength-SE and SenticNet7 techniques for sentiment analysis. The findings demonstrate that the sentiment analysis obtained from SenticNet7 outperforms that from SentiStrength-SE. It is revealed through the sentiment analysis that sentiment disparity among the viewers of 360-degree and unidirectional videos is low and insignificant. Furthermore, the study shows that unidirectional videos garnered the most traffic during COVID-19 induced global travel bans. The study elaborates on the capacity of unidirectional videos on travel and the implications for industry and academia. The second aim of this paper also employs a Convolutional Neural Network and Random Forest for sentiment analysis of YouTube viewers’ comments, where the sentiment analysis output by SenticNet7 is used as actual values. Cross-validation with 10-folds is employed in the proposed models. The findings demonstrate that the max-voting technique outperforms compared with an individual fold.

This paper proposes a new software development effort estimation model. The new model's design is based on the function point analysis, categorical variable segmentation (CVS), and stepwise regression. The stepwise regression method is used for the creation of the unique estimation model of each segment. The estimation accuracy of the proposed model is compared to clustering-based models and the international function point user group model. It is shown that the proposed model increases estimation accuracy when compared to baseline methods: non-clustered functional point analysis and clustering-based models. The new CVS model achieves a significantly higher accuracy than the baseline methods.

Function point analysis is a widely used metric in the software industry for development effort estimation. It was proposed in the 1970s, and then standardized by the International Function Point Users Group, as accepted by many organizations worldwide. While the software industry has grown rapidly, the weight values specified for the standard function point counting have remained the same since its inception. Another problem is that software development in different industry sectors is peculiar, but basic rules apply to all. These raise important questions about the validity of weight values in practical applications. In this study, we propose an algorithm for calibrating the standardized functional complexity weights, aiming to estimate a more accurate software size that fits specific software applications, reflects software industry trends, and improves the effort estimation of software projects. The results show that the proposed algorithms improve effort estimation accuracy against the baseline method.

Software development effort estimation is essential for software project planning and management. In this study, we present a spectral clustering algorithm based on symmetric matrixes as an option for data processing. It is expected that constructing an estimation model on more similar data can increase the estimation accuracy. The research methods employ symmetrical data processing and experimentation. Four experimental models based on function point analysis, stepwise regression, spectral clustering, and categorical variables have been conducted. The results indicate that the most advantageous variant is a combination of stepwise regression and spectral clustering. The proposed method provides the most accurate estimates compared to the baseline method and other tested variants.

This paper presents a new size estimation method that can be used to estimate size level for software engineering projects. The Algorithmic Optimisation Method is based on Use Case Points and on Multiple Least Square Regression. The method is derived into three phases. The first phase deals with calculation Use Case Points and correction coefficients values. Correction coefficients are obtained by using Multiple Least Square Regression. New project is estimated in the second and third phase. In the second phase Use Case Points parameters for new estimation are set up and in the third phase project estimation is performed. Final estimation is obtained by using newly developed estimation equation, which used two correction coefficients. The Algorithmic Optimisation Method performs approximately 43% better than the Use Case Points method, based on their magnitude of relative error score. All results were evaluated by standard approach: visual inspection, goodness of fit measure and statistical significance.