arrow
返回

Interpretable software estimation with graph neural networks and orthogonal array tunning method

delete2024-09-01
delete0
delete
OA
AI
N
Nevena Ranković *
D
Dragica Ranković
M
Mirjana Ivanović
J
Jelena Kaljević
DOI:10.1016/j.ipm.2024.103778delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Software estimation rates are still suboptimal regarding efficiency, runtime, and the accuracy of model predictions. Graph Neural Networks (GNNs) are complex, yet their precise forecasting reduces the gap between expected and actual software development efforts, thereby minimizing associated risks. However, defining optimal hyperparameter configurations remains a challenge. This paper compares state-of-the-art models such as Long -Short -Term -Memory (LSTM), Graph Gated Neural Networks (GGNN), and Graph Gated Sequence Neural Networks (GGSNN), and conducts experiments with various hyperparameter settings to optimize performance. We also aim to gain the most informative feedback from our models by exploring insights using a posthoc agnostic method like Shapley Additive Explanations (SHAP). Our findings indicate that the Taguchi orthogonal array optimization method is the most computationally efficient, yielding notably improved performance metrics. This suggests a compromise between computational efficiency and prediction accuracy while still requiring the lowest number of runnings, with an RMSE of 0.9211 and an MAE of 310.4. For the best -performing model, the GGSNN model, within the Constructive Cost Model (COCOMO), Function Point Analysis (FPA), and Use Case Points (UCP) frameworks, applying the SHAP method leads to a more accurate determination of relevance, as evidenced by the norm reduction in activation vectors. The SHAP method stands out by exhibiting the smallest area under the curve and faster convergence, indicating its efficiency in pinpointing concept relevance.
Keyword:
Software estimation
Graph neural networks
Hyperparameter optimization
SHAP
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

I
Information Processing and Management
IF:
6.9
论文数:
5.2K
被引数:
1.4W

机构

U
University of Novi Sad
学者数:
9.3K
论文数: 6.2K
被引数: 5.0K
T
tilburg university
学者数:
4.8K
论文数: 5.7K
被引数: 4
引用论文

引用论文

err2002-01-01
err0
PREAI
errI. Ya. Aref'eva; A. A. Giryavets
err分享
err收藏
Handling missing data in well-log curves with a gated graph neural network
err2022-12-13
err7
PREAI
errJiang, Chunbi; Zhang, Dongxiao; Chen, Shifeng
err分享
err收藏
A Spatial Interactome Reveals the Protein Organization of the Algal CO2-Concentrating Mechanism
errCell
IF0
err2017-09-01
err0
errOAAI
errLuke C.M. Mackinder; Chris Chen; Ryan D. Leib; Weronika Patena; Sean R. Blum; Matthew Rodman; Silvia Ramundo; Christopher M. Adams; Martin C. Jonikas
err分享
err收藏
Accelerating network layouts using graph neural networks
err2023-03-21
err6
errOAAI
errBoth, Csaba; Dehmamy, Nima; Yu, Rose; Barabasi, Albert-Laszlo
err分享
err收藏
学者 查看更多内容