Optimizing Non-orthogonal Space Distance Using PSO in Software Cost Estimation

Qin Liu, X. Chu, Jiakai Xiao, Hongming Zhu
{"title":"Optimizing Non-orthogonal Space Distance Using PSO in Software Cost Estimation","authors":"Qin Liu, X. Chu, Jiakai Xiao, Hongming Zhu","doi":"10.1109/COMPSAC.2014.9","DOIUrl":null,"url":null,"abstract":"This paper proposes a method to optimize the Nonorthogonal Space Distance (NoSD) based on the Particle Swarm Optimization (PSO) algorithm so as to increase estimation accuracy in analogy-based software cost estimation. NoSD is a measure of projects similarity that uses a matrix defined based on mutual information to take both feature redundancies and feature weights into distance computation. We assumes that such definition based only on mutual information between features can hardly describe real-life software projects accurately, so we proposes this new method and improves NoSD using optimization techniques. In this proposed method, the matrix in NoSD is optimized by the PSO algorithm with the goal of minimizing estimation error at training stage. Based on this optimized matrix, which better fits real-life software projects, the distance definition can measure projects similarity more accurately and thus can greatly improve the estimation accuracy. Experiments have been conducted on two real-life software projects datasets (Desharnais and ISBSG R8) using the proposed method along with several other widely used methods including Euclidean, Manhattan, Minkowski, Mahalanobis, NoSD, and weighted Euclidean distance. Results show that this method brings notable improvements in estimation accuracy based on three widely used evaluation metrics: MMRE, MdMRE, and PRED(0.25).","PeriodicalId":106871,"journal":{"name":"2014 IEEE 38th Annual Computer Software and Applications Conference","volume":"215 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 38th Annual Computer Software and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPSAC.2014.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

This paper proposes a method to optimize the Nonorthogonal Space Distance (NoSD) based on the Particle Swarm Optimization (PSO) algorithm so as to increase estimation accuracy in analogy-based software cost estimation. NoSD is a measure of projects similarity that uses a matrix defined based on mutual information to take both feature redundancies and feature weights into distance computation. We assumes that such definition based only on mutual information between features can hardly describe real-life software projects accurately, so we proposes this new method and improves NoSD using optimization techniques. In this proposed method, the matrix in NoSD is optimized by the PSO algorithm with the goal of minimizing estimation error at training stage. Based on this optimized matrix, which better fits real-life software projects, the distance definition can measure projects similarity more accurately and thus can greatly improve the estimation accuracy. Experiments have been conducted on two real-life software projects datasets (Desharnais and ISBSG R8) using the proposed method along with several other widely used methods including Euclidean, Manhattan, Minkowski, Mahalanobis, NoSD, and weighted Euclidean distance. Results show that this method brings notable improvements in estimation accuracy based on three widely used evaluation metrics: MMRE, MdMRE, and PRED(0.25).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
应用粒子群算法优化软件成本估算中的非正交空间距离
本文提出了一种基于粒子群优化(PSO)算法的非正交空间距离(NoSD)优化方法,以提高基于模拟的软件成本估计的估计精度。NoSD是一种度量项目相似性的方法,它使用基于互信息定义的矩阵将特征冗余度和特征权重都纳入到距离计算中。我们认为这种仅基于特征之间相互信息的定义很难准确地描述实际软件项目,因此我们提出了这种新方法,并使用优化技术提高了NoSD。该方法利用粒子群算法对NoSD中的矩阵进行优化,以最小化训练阶段的估计误差为目标。在此优化矩阵的基础上,距离定义可以更准确地度量项目的相似度,从而大大提高估算精度。在两个实际的软件项目数据集(Desharnais和ISBSG R8)上进行了实验,使用该方法以及其他几种广泛使用的方法,包括欧几里得、曼哈顿、Minkowski、Mahalanobis、NoSD和加权欧几里得距离。结果表明,基于MMRE、MdMRE和PRED(0.25)这三种常用的评价指标,该方法的估计精度得到了显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Power-Saving Mechanism for IEEE 802.11 Clients in a Multicast Multimedia Streaming Network Empirically Based Evolution of a Variability Management Approach at UML Class Level CrowdAdaptor: A Crowd Sourcing Approach toward Adaptive Energy-Efficient Configurations of Virtual Machines Hosting Mobile Applications A Distributed Topic-Based Pub/Sub Method for Exhaust Data Streams towards Scalable Event-Driven Systems Trimming Test Suites with Coincidentally Correct Test Cases for Enhancing Fault Localizations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1