SwePub
Sök i LIBRIS databas

  Utökad sökning

id:"swepub:oai:DiVA.org:bth-19344"
 

Sökning: id:"swepub:oai:DiVA.org:bth-19344" > Improving Ranking-O...

Improving Ranking-Oriented Defect Prediction Using a Cost-Sensitive Ranking SVM

Yu, Xiao (författare)
Wuhan University, CHN;
Liu, Jin (författare)
City University of Hong Kong, HKG
Keung, Jacky Wai (författare)
Hong Kong Polytechnic University, HKG
visa fler...
Li, Qing (författare)
Hong Kong Polytechnic University, HKG
Bennin, Kwabena Ebo, 1987- (författare)
Blekinge Tekniska Högskola,Institutionen för programvaruteknik
Xu, Zhou (författare)
Wuhan University, HKG
Wang, Junping (författare)
Chinese Academy of Sciences, CHN
Cui, Xiaohui (författare)
Guilin University of Electronic Technology, CHN
visa färre...
 (creator_code:org_t)
Institute of Electrical and Electronics Engineers Inc. 2020
2020
Engelska.
Ingår i: IEEE Transactions on Reliability. - : Institute of Electrical and Electronics Engineers Inc.. - 0018-9529 .- 1558-1721. ; 69:1, s. 139-153
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • Context: Ranking-oriented defect prediction (RODP) ranks software modules to allocate limited testing resources to each module according to the predicted number of defects. Most RODP methods overlook that ranking a module with more defects incorrectly makes it difficult to successfully find all of the defects in the module due to fewer testing resources being allocated to the module, which results in much higher costs than incorrectly ranking the modules with fewer defects, and the numbers of defects in software modules are highly imbalanced in defective software datasets. Cost-sensitive learning is an effective technique in handling the cost issue and data imbalance problem for software defect prediction. However, the effectiveness of cost-sensitive learning has not been investigated in RODP models. Aims: In this article, we propose a cost-sensitive ranking support vector machine (SVM) (CSRankSVM) algorithm to improve the performance of RODP models. Method: CSRankSVM modifies the loss function of the ranking SVM algorithm by adding two penalty parameters to address both the cost issue and the data imbalance problem. Additionally, the loss function of the CSRankSVM is optimized using a genetic algorithm. Results: The experimental results for 11 project datasets with 41 releases show that CSRankSVM achieves 1.12%-15.68% higher average fault percentile average (FPA) values than the five existing RODP methods (i.e., decision tree regression, linear regression, Bayesian ridge regression, ranking SVM, and learning-to-rank (LTR)) and 1.08%-15.74% higher average FPA values than the four data imbalance learning methods (i.e., random undersampling and a synthetic minority oversampling technique; two data resampling methods; RankBoost, an ensemble learning method; IRSVM, a CSRankSVM method for information retrieval). Conclusion: CSRankSVM is capable of handling the cost issue and data imbalance problem in RODP methods and achieves better performance. Therefore, CSRankSVM is recommended as an effective method for RODP. © 1963-2012 IEEE.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Programvaruteknik (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Software Engineering (hsv//eng)
NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

Cost-sensitive learning
data imbalance
ranking-oriented defect prediction (RODP)
Decision trees
Defects
Forecasting
Genetic algorithms
Learning systems
Regression analysis
Software testing
Support vector machines
Trees (mathematics)
Decision tree regression
Defect prediction
Fault percentile averages
Random under samplings
Ranking support vector machines (SVM)
Software defect prediction
Synthetic minority over-sampling techniques
Learning to rank

Publikations- och innehållstyp

ref (ämneskategori)
art (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy