Explainable Validation and Feature Reduction in Machine Learning

Published

May 18, 2026

Author(s)

Fenrir Badorf, Francis Durso, Callie Walker, Megan Olsen, M S Raunak, D. Richard Kuhn

Abstract

Although there are many available approaches for designing machine learning models and experiments, not all of these approaches are explainable or interpretable. Combination frequency differencing (CFD) provides information on the relationship between feature values and predicted class in the form of distinguishing combinations. In this paper we investigate how distinguishing combinations in the training and validation datasets may affect the effectiveness of the trained model. We also investigate how distinguishing combinations can be used for a more explainable approach to feature reduction. Notably, results showed that CFD performed comparably to principal component analysis, an established method for reducing features, while providing better explainability. Thus CFD shows promise for providing a unified, interpretable framework for dataset construction, model validation, and feature reduction.

Proceedings Title

International Conference on Software Testing (ICST)

Conference Dates

May 18-22, 2026

Conference Location

Daejeon, KR

Conference Title

International Conference on Software Testing

Pub Type

Conferences

Download Paper

Local Download

Keywords

combinatorial analysis, machine learning, validation, feature reduction, explainability

Citation

Badorf, F. , Durso, F. , Walker, C. , Olsen, M. , Raunak, M. and Kuhn, D. (2026), Explainable Validation and Feature Reduction in Machine Learning, International Conference on Software Testing (ICST), Daejeon, KR, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=962007 (Accessed September 9, 2026)

Additional citation formats