Fault Detection Effectiveness of Metamorphic Relations Developed for Testing Supervised Classifiers

被引:14
作者
Saha, Prashanta [1 ]
Kanewala, Upulee [1 ]
机构
[1] Montana State Univ, Sch Comp, Bozeman, MT 59717 USA
来源
2019 IEEE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE TESTING (AITEST) | 2019年
基金
美国国家科学基金会;
关键词
Metamorphic testing; Random testing; Supervised classifiers; Metamorphic Relations; Mutation Analysis; Machine Learning; MUTATION; SOFTWARE;
D O I
10.1109/AITest.2019.00019
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In machine learning, supervised classifiers are used to obtain predictions for unlabeled data by inferring prediction functions using labeled data. Supervised classifiers are widely applied in domains such as computational biology, computational physics and healthcare to make critical decisions. However, it is often hard to test supervised classifiers since the expected answers are unknown. This is commonly known as the oracle problem and metamorphic testing (MT) has been used to test such programs. In MT, metamorphic relations (MRs) are developed from intrinsic characteristics of the software under test (SUT). These MRs are used to generate test data and to verify the correctness of the test results without the presence of a test oracle. Effectiveness of MT heavily depends on the MRs used for testing. In this paper we have conducted an extensive empirical study to evaluate the fault detection effectiveness of MRs that have been used in multiple previous studies to test supervised classifiers. Our study uses a total of 709 reachable mutants generated by multiple mutation engines and uses data sets with varying characteristics to test the SUT. Our results reveal that only 14.8% of these mutants are detected using the MRs and that the fault detection effectiveness of these MRs do not scale with the increased number of mutants when compared to what was reported in previous studies.
引用
收藏
页码:157 / 164
页数:8
相关论文
共 28 条
  • [1] Is mutation an appropriate tool for testing experiments?
    Andrews, JH
    Briand, LC
    Labiche, Y
    [J]. ICSE 05: 27TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, PROCEEDINGS, 2005, : 402 - 411
  • [2] [Anonymous], 2005, DATA MINING PRACTICA
  • [3] [Anonymous], 2014, P 2014 INT S SOFTWAR
  • [4] Asrafi M., 2011, Proceedings of the 2011 Fifth International Conference on Secure Software Integration and Reliability Improvement (SSIRI 2011), P147, DOI 10.1109/SSIRI.2011.21
  • [5] Novel Applications of Machine Learning in Software Testing
    Briand, Lionel C.
    [J]. QSIC 2008: PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON QUALITY SOFTWARE, 2008, : 3 - 10
  • [6] Metamorphic Testing: A Review of Challenges and Opportunities
    Chen, Tsong Yueh
    Kuo, Fei-Ching
    Liu, Huai
    Poon, Pak-Lok
    Towey, Dave
    Tse, T. H.
    Zhou, Zhi Quan
    [J]. ACM COMPUTING SURVEYS, 2018, 51 (01)
  • [7] Metamorphic Testing: A Simple Method for Alleviating the Test Oracle Problem
    Chen, Tsong Yueh
    [J]. 10TH INTERNATIONAL WORKSHOP ON AUTOMATION OF SOFTWARE TEST AST 2015, 2015, : 53 - 54
  • [8] Metamorphic Testing: Applications and Integration with Other Methods
    Chen, Tsong Yueh
    Kuo, Fei-Ching
    Towey, Dave
    Zhou, Zhi Quan
    [J]. 2012 12TH INTERNATIONAL CONFERENCE ON QUALITY SOFTWARE (QSIC), 2012, : 285 - 288
  • [9] Fault-based testing without the need of oracles
    Chen, TY
    Tse, TH
    Zhou, ZQ
    [J]. INFORMATION AND SOFTWARE TECHNOLOGY, 2003, 45 (01) : 1 - 9
  • [10] NEAREST NEIGHBOR PATTERN CLASSIFICATION
    COVER, TM
    HART, PE
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) : 21 - +