Parallel approaches for a decision tree-based explainability algorithm

While nowadays Machine Learning (ML) algorithms have achieved impressive prediction accuracy in various fields, their ability to provide an explanation for the output remains an issue. The explainability research field is precisely devoted to investigating techniques able to give an interpretation o...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Future generation computer systems Ročník 158; s. 308 - 322
Hlavní autoři: Loreti, Daniela, Visani, Giorgio
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.09.2024
Témata:
Global and Local Explainability
Parallel computing
Parallel decision tree building
Parallel computing
Global and Local Explainability
Parallel decision tree building
ISSN:0167-739X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:While nowadays Machine Learning (ML) algorithms have achieved impressive prediction accuracy in various fields, their ability to provide an explanation for the output remains an issue. The explainability research field is precisely devoted to investigating techniques able to give an interpretation of ML algorithms’ predictions. Among the various approaches to explainability, we focus on GLEAMS: a decision tree-based solution that has proven to be rather promising under various perspectives, but suffers a sensible increase in the execution time as the problem size grows. In this work, we analyse the state-of-the-art parallel approaches to decision tree-building algorithms and we adapt them to the peculiar characteristics of GLEAMS. Relying on an increasingly popular distributed computing engine called Ray, we propose and implement different parallelization strategies for GLEAMS. An extensive evaluation highlights the benefits and limitations of each strategy and compares the performance with other existing explainability algorithms. [Display omitted] •Investigates different parallel approaches for GLEAMS explainability algorithm.•Analyses existing parallelization strategies for decision tree building algorithms.•The implementation leverages a popular distributed computing engine, Ray.•A comparison of the performance of the different parallel strategies is presented.
ISSN:0167-739X
DOI:10.1016/j.future.2024.04.044