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...

  • Yu, XiaoWuhan University, CHN; (författare)

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

  • Artikel/kapitelEngelska2020

Förlag, utgivningsår, omfång ...

  • Institute of Electrical and Electronics Engineers Inc.2020
  • printrdacarrier

Nummerbeteckningar

  • LIBRIS-ID:oai:DiVA.org:bth-19344
  • https://urn.kb.se/resolve?urn=urn:nbn:se:bth-19344URI
  • https://doi.org/10.1109/TR.2019.2931559DOI

Kompletterande språkuppgifter

  • Språk:engelska
  • Sammanfattning på:engelska

Ingår i deldatabas

Klassifikation

  • Ämneskategori:ref swepub-contenttype
  • Ämneskategori:art swepub-publicationtype

Anmärkningar

  • 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 och genrebeteckningar

Biuppslag (personer, institutioner, konferenser, titlar ...)

  • Liu, JinCity University of Hong Kong, HKG (författare)
  • Keung, Jacky WaiHong Kong Polytechnic University, HKG (författare)
  • Li, QingHong Kong Polytechnic University, HKG (författare)
  • Bennin, Kwabena Ebo,1987-Blekinge Tekniska Högskola,Institutionen för programvaruteknik(Swepub:bth)ebk (författare)
  • Xu, ZhouWuhan University, HKG (författare)
  • Wang, JunpingChinese Academy of Sciences, CHN (författare)
  • Cui, XiaohuiGuilin University of Electronic Technology, CHN (författare)
  • Wuhan University, CHN;City University of Hong Kong, HKG (creator_code:org_t)

Sammanhörande titlar

  • Ingår i:IEEE Transactions on Reliability: Institute of Electrical and Electronics Engineers Inc.69:1, s. 139-1530018-95291558-1721

Internetlänk

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