A multiclass classification model to estimate Agile user stories

Yuvna Ramchurreetoo, V. Hurbungs
{"title":"A multiclass classification model to estimate Agile user stories","authors":"Yuvna Ramchurreetoo, V. Hurbungs","doi":"10.1109/NextComp55567.2022.9932190","DOIUrl":null,"url":null,"abstract":"Effort estimation in Agile projects is extremely important in order to prevent schedule overrun, late product delivery and over-budgeting among others. These estimations are usually performed manually by making use of estimation techniques such as planning poker and expert judgment. However, there are several constraints associated with these techniques since estimation requires the presence of the whole project team and there might be divergence of opinions. The main objective of this study was to estimate Agile user stories using multiclass classification techniques. Three classifiers (Naïve Bayes, Decision Tree and Support Vector Machine) have been applied to user stories to estimate effort in terms of Story Points. Three machine learning models were generated and evaluated to determine the best algorithm by comparing metrics such as accuracy, error rate, precision, recall and f-measure. Using a single train:test sample in the ratio of 100:25, Naïve Bayes, Decision Tree and Support Vector Machine gave an accuracy of 64%, 80% and 100% respectively. Experiments performed showed that the accuracy of Support Vector Machine was better than the other two algorithms in estimating user stories.","PeriodicalId":422085,"journal":{"name":"2022 3rd International Conference on Next Generation Computing Applications (NextComp)","volume":"173 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 3rd International Conference on Next Generation Computing Applications (NextComp)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NextComp55567.2022.9932190","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Effort estimation in Agile projects is extremely important in order to prevent schedule overrun, late product delivery and over-budgeting among others. These estimations are usually performed manually by making use of estimation techniques such as planning poker and expert judgment. However, there are several constraints associated with these techniques since estimation requires the presence of the whole project team and there might be divergence of opinions. The main objective of this study was to estimate Agile user stories using multiclass classification techniques. Three classifiers (Naïve Bayes, Decision Tree and Support Vector Machine) have been applied to user stories to estimate effort in terms of Story Points. Three machine learning models were generated and evaluated to determine the best algorithm by comparing metrics such as accuracy, error rate, precision, recall and f-measure. Using a single train:test sample in the ratio of 100:25, Naïve Bayes, Decision Tree and Support Vector Machine gave an accuracy of 64%, 80% and 100% respectively. Experiments performed showed that the accuracy of Support Vector Machine was better than the other two algorithms in estimating user stories.
一个用于估计敏捷用户故事的多类分类模型
在敏捷项目中,为了防止进度超出、产品交付延迟和预算超支等问题,工作量评估是极其重要的。这些评估通常是通过使用诸如计划扑克和专家判断之类的评估技术手动执行的。然而,由于评估需要整个项目团队的参与,并且可能存在意见分歧,因此与这些技术相关的约束条件有很多。本研究的主要目的是使用多类分类技术来评估敏捷用户故事。三种分类器(Naïve贝叶斯,决策树和支持向量机)已经应用于用户故事,以根据故事点估计工作量。生成并评估了三个机器学习模型,通过比较准确度、错误率、精度、召回率和f-measure等指标来确定最佳算法。使用单个训练:测试样本的比例为100:25,Naïve贝叶斯、决策树和支持向量机的准确率分别为64%、80%和100%。实验结果表明,支持向量机在用户故事估计方面的准确率优于其他两种算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信