Timothy Elvira
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Timothy Elvira has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Omar Ochoa
Department of Electrical Engineering and Computer Science, Embry-Riddle Aeronautical University, Daytona Beach 32114, United States
3 shared publications - Lynn Vonderhaar
Department of Electrical Engineering and Computer Science, Embry-Riddle Aeronautical University, Daytona Beach 32114, United States
2 shared publications Lynn Vonder Haar
1 shared publication
Latest Publications
- 5 March 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Semantic Computing
- Vol. 20 (01) , 135-156
Provenance as a Machine Learning Non–Functional Requirement: Trends and Future Directions
As Machine Learning (ML) becomes ever more ubiquitous, it is critical to increase the rigor of design and testing. In traditional software, this is done using the Requirements Engineering (RE) process, but RE looks different for ML because it is data-centric. There are different Non-Functional Requirements (NFRs) and standard testing techniques do not apply. While there are standards for verifying NFRs in traditional software, there is no standard measurement for ML NFRs, e.g. how is a model verified to meet an explainability NFR? In traditional software, NFRs are decomposed into Functional Requirements (FRs), but without clear measurements for ML NFRs, their decomposition into FRs is nearly impossible. However, recently, research has shown that provenance can help improve model transparency and reproducibility. This work builds on such literature and suggests provenance as a lower-level NFR to connect high-level NFRs, e.g. explainability and transparency, and FRs, thereby enabling concrete model verification based on requirement specifications. This work examines types of ML provenance and their use in decomposing model NFRs into verifiable FRs, thereby better aligning ML development with RE and increasing the rigor of ML testing. This paper aggregates current literature on provenance for ML and provides a method of measurement for otherwise unquantifiable NFRs. This work also analyzes trends in how provenance can decompose various ML NFRs and future directions for the field.
- 5 March 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal of Semantic Computing
- Vol. 20 (01) , 135-156
Provenance as a Machine Learning Non–Functional Requirement: Trends and Future Directions
As Machine Learning (ML) becomes ever more ubiquitous, it is critical to increase the rigor of design and testing. In traditional software, this is done using the Requirements Engineering (RE) process, but RE looks different for ML because it is data-centric. There are different Non-Functional Requirements (NFRs) and standard testing techniques do not apply. While there are standards for verifying NFRs in traditional software, there is no standard measurement for ML NFRs, e.g. how is a model verified to meet an explainability NFR? In traditional software, NFRs are decomposed into Functional Requirements (FRs), but without clear measurements for ML NFRs, their decomposition into FRs is nearly impossible. However, recently, research has shown that provenance can help improve model transparency and reproducibility. This work builds on such literature and suggests provenance as a lower-level NFR to connect high-level NFRs, e.g. explainability and transparency, and FRs, thereby enabling concrete model verification based on requirement specifications. This work examines types of ML provenance and their use in decomposing model NFRs into verifiable FRs, thereby better aligning ML development with RE and increasing the rigor of ML testing. This paper aggregates current literature on provenance for ML and provides a method of measurement for otherwise unquantifiable NFRs. This work also analyzes trends in how provenance can decompose various ML NFRs and future directions for the field.
- 26 February 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal on Artificial Intelligence Tools
- Vol. 35 (02)
Measuring Contextual Reliance of Object Detection Models: A Black Box Explainability Method
While metrics such as precision, recall, and related measures are useful for evaluating object detection models, they provide a limited perspective on model behavior. Even with carefully prepared training data and robust optimization, there is no guarantee regarding what features a model actually learns. In practice, a model may associate certain background elements, i.e., scene-level objects, with the presence of target classes, resulting in unintended contextual dependencies. Conventional performance metrics, however, do not reveal this issue. To address this gap, this paper introduces a black box explainability approach that evaluates object detection models by quantifying the influence of scene-level objects on class identification. By comparing Average Precision (AP) on test data with and without specific scene elements, the method highlights the extent to which those objects contribute to model performance. Three experiments are presented to demonstrate the method’s utility. The findings provide both quantitative and global explanations of model behavior, yielding a more complete picture of object detection performance.
- 26 February 2026
- Published by World Scientific Pub Co Pte Ltd in International Journal on Artificial Intelligence Tools
- Vol. 35 (02)
Measuring Contextual Reliance of Object Detection Models: A Black Box Explainability Method
While metrics such as precision, recall, and related measures are useful for evaluating object detection models, they provide a limited perspective on model behavior. Even with carefully prepared training data and robust optimization, there is no guarantee regarding what features a model actually learns. In practice, a model may associate certain background elements, i.e., scene-level objects, with the presence of target classes, resulting in unintended contextual dependencies. Conventional performance metrics, however, do not reveal this issue. To address this gap, this paper introduces a black box explainability approach that evaluates object detection models by quantifying the influence of scene-level objects on class identification. By comparing Average Precision (AP) on test data with and without specific scene elements, the method highlights the extent to which those objects contribute to model performance. Three experiments are presented to demonstrate the method’s utility. The findings provide both quantitative and global explanations of model behavior, yielding a more complete picture of object detection performance.
- 19 November 2022
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 117
An analysis of explainability methods for convolutional neural networks
- 19 November 2022
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 117
An analysis of explainability methods for convolutional neural networks