z-logo
open-access-imgOpen Access
A cross‐project defect prediction method based on multi‐adaptation and nuclear norm
Author(s) -
Huang Qingan,
Ma Le,
Jiang Siyu,
Wu Guobin,
Song Hengjie,
Jiang Libiao,
Zheng Chunyun
Publication year - 2022
Publication title -
iet software
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.305
H-Index - 43
eISSN - 1751-8814
pISSN - 1751-8806
DOI - 10.1049/sfw2.12053
Subject(s) - computer science , norm (philosophy) , domain adaptation , adaptation (eye) , artificial intelligence , kernel (algebra) , software , source code , sample (material) , data mining , machine learning , mathematics , programming language , physics , optics , combinatorics , political science , classifier (uml) , law , chemistry , chromatography
Cross‐project defect prediction (CPDP) is an important research direction in software defect prediction. Traditional CPDP methods based on hand‐crafted features ignore the semantic information in the source code. Existing CPDP methods based on the deep learning model may not fully consider the differences among projects. Additionally, these methods may not accurately classify the samples near the classification boundary. To solve these problems, the authors propose a model based on multi‐adaptation and nuclear norm (MANN) to deal with samples in projects. The feature of samples were embedded into the multi‐core Hilbert space for distribution and the multi‐kernel maximum mean discrepancy method was utilised to reduce differences among projects. More importantly, the nuclear norm module was constructed, which improved the discriminability and diversity of the target sample by calculating and maximizing the nuclear norm of the target sample in the process of domain adaptation, thus improving the performance of MANN. Finally, extensive experiments were conducted on 11 sizeable open‐source projects. The results indicate that the proposed method exceeds the state of the art under the widely used metrics.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here