Multiple Instance Learning with Trainable Soft Decision Tree Ensembles

4Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

A new random forest-based model for solving the Multiple Instance Learning problem under small tabular data, called the Soft Tree Ensemble Multiple Instance Learning, is proposed. A new type of soft decision trees is considered, which is similar to the well-known soft oblique trees, but with a smaller number of trainable parameters. In order to train the trees, it is proposed to convert them into neural networks of a specific form, which approximate the tree functions. It is also proposed to aggregate the instance and bag embeddings (output vectors) by using the attention mechanism. The whole Soft Tree Ensemble Multiple Instance Learning model, including soft decision trees, neural networks, the attention mechanism and a classifier, is trained in an end-to-end manner. Numerical experiments with well-known real tabular datasets show that the proposed model can outperform many existing multiple instance learning models. A code implementing the model is publicly available.

Cite

CITATION STYLE

APA

Konstantinov, A., Utkin, L., & Muliukha, V. (2023). Multiple Instance Learning with Trainable Soft Decision Tree Ensembles. Algorithms, 16(8). https://doi.org/10.3390/a16080358

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free