Incremental permutation feature importance (iPFI): towards online explanations on data streams
نویسندگان
چکیده
Abstract Explainable artificial intelligence has mainly focused on static learning scenarios so far. We are interested in dynamic where data is sampled progressively, and done an incremental rather than a batch mode. seek efficient algorithms for computing feature importance (FI). Permutation (PFI) well-established model-agnostic measure to obtain global FI based marginalization of absent features. propose efficient, algorithm called iPFI estimate this incrementally under modeling conditions including concept drift. prove theoretical guarantees the approximation quality terms expectation variance. To validate our findings efficacy approaches dealing with streaming traditional settings, we conduct multiple experimental studies benchmark without
منابع مشابه
Permutation importance: a corrected feature importance measure
MOTIVATION In life sciences, interpretability of machine learning models is as important as their prediction accuracy. Linear models are probably the most frequently used methods for assessing feature relevance, despite their relative inflexibility. However, in the past years effective estimators of feature relevance have been derived for highly complex or non-parametric models such as support ...
متن کاملMORES: Online Incremental Multiple-Output Regression for Data Streams
Online multiple-output regression is an important machine learning technique for modeling, predicting, and compressing multi-dimensional correlated data streams. In this paper, we propose a novel online multiple-output regression method, called MORES, for streaming data. MORES can dynamically learn the structure of the regression coefficients to facilitate the model’s continuous refinement. We ...
متن کاملOnline Group Feature Selection from Feature Streams
Standard feature selection algorithms deal with given candidate feature sets at the individual feature level. When features exhibit certain group structures, it is beneficial to conduct feature selection in a grouped manner. For high-dimensional features, it could be far more preferable to online generate and process features one at a time rather than wait for generating all features before lea...
متن کاملChunk Incremental LDA Computing on Data Streams
This paper presents a constructive method for deriving an updated discriminant eigenspace for classification, when bursts of new classes of data is being added to an initial discriminant eigenspace in the form of random chunks. The proposed Chunk incremental linear discriminant analysis (I-LDA) can effectively evolve a discriminant eigenspace over a fast and large data stream, and extract featu...
متن کاملIncremental Generalized Eigenvalue Classification on Data Streams
As applications on massive data sets are emerging with an increasing frequency, we are facing the problem of analyzing the data as soon as they are produced. This is true in many fields of science and engineering: in high energy physics, experiments have been done to transfer data at a sustained rate of 150 gigabits per second. In Y2007, that speed will enable the delivery to users of data cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2023
ISSN: ['0885-6125', '1573-0565']
DOI: https://doi.org/10.1007/s10994-023-06385-y