paper-with-me

홈 › Papers

An ensemble meta-estimator to predict source code testability

2022-08-20 · Morteza Zakeri-Nasrabadi, Saeed Parsa

Unlike most other software quality attributes, testability cannot be evaluated solely based on the characteristics of the source code. The effectiveness of the test suite and the budget assigned to the test highly impact the testability of the code under test. The size of a test suite determines the test effort and cost, while the coverage measure indicates the test effectiveness. Therefore, testability can be measured based on the coverage and number of test cases provided by a test suite, considering the test budget. This paper offers a new equation to estimate testability regarding the size and coverage of a given test suite. The equation has been used to label 23,000 classes belonging to 110 Java projects with their testability measure. The labeled classes were vectorized using 262 metrics. The labeled vectors were fed into a family of supervised machine learning algorithms, regression, to predict testability in terms of the source code metrics. Regression models predicted testability with an R2 of 0.68 and a mean squared error of 0.03, suitable in practice. Fifteen software metrics highly affecting testability prediction were identified using a feature importance analysis technique on the learned model. The proposed models have improved mean absolute error by 38% due to utilizing new criteria, metrics, and data compared with the relevant study on predicting branch coverage as a test criterion. As an application of testability prediction, it is demonstrated that automated refactoring of 42 smelly Java classes targeted at improving the 15 influential software metrics could elevate their testability by an average of 86.87%.

📄 PDF Abstract BibTeX arXiv:2208.09614

Code (1)

m-zakeri/adafest 공식 구현

Tasks

Feature Importanceregression

Methods 이 논문이 사용한 방법론

Test 설명 없음

Similar Papers 제목 키워드 기반

MLRS-PDS: A Meta-learning recommendation of dynamic ensemble selection pipelines

2024-07-10 · Hesam Jalalian, Rafael M. O. Cruz

Dynamic Selection (DS), where base classifiers are chosen from a classifier's pool for each new instance at test time, has shown to be highly effective in pattern recognition. However, instability and redundancy in the c…

Computational EfficiencyMeta-Learning

Ranking and combining multiple predictors without labeled data

2013-03-13 · Fabio Parisi, Francesco Strino, Boaz Nadler, Yuval Kluger

In a broad range of classification and decision making problems, one is given the advice or predictions of several classifiers, of unknown reliability, over multiple questions or queries. This scenario is different from …

Decision Making

MetaDelta: A Meta-Learning System for Few-shot Image Classification

2021-02-22 · Yudong Chen, Chaoyu Guan, Zhikun Wei, Xin Wang 외

Meta-learning aims at learning quickly on novel tasks with limited data by transferring generic experience learned from previous tasks. Naturally, few-shot learning has been one of the most popular applications for meta-…

ClassificationDecoderFew-Shot Image ClassificationFew-Shot Learning+4

Unsupervised Ensemble Learning with Dependent Classifiers

2015-10-20 · Ariel Jaffe, Ethan Fetaya, Boaz Nadler, Tingting Jiang 외

In unsupervised ensemble learning, one obtains predictions from multiple sources or classifiers, yet without knowing the reliability and expertise of each source, and with no labeled data to assess it. The task is to com…

DiversityEnsemble Learning

SurvBETA: Ensemble-Based Survival Models Using Beran Estimators and Several Attention Mechanisms

2024-12-10 · Lev V. Utkin, Semen P. Khomets, Vlada A. Efremenko, Andrei V. Konstantinov

Many ensemble-based models have been proposed to solve machine learning problems in the survival analysis framework, including random survival forests, the gradient boosting machine with weak survival models, ensembles o…

FormSurvival Analysis