Online Random Feature Forests for Learning in Varying Feature Spaces

Authors

  • Christian Schreckenberger University of Mannheim
  • Yi He Old Dominion University
  • Stefan Lüdtke University of Mannheim
  • Christian Bartelt University of Mannheim
  • Heiner Stuckenschmidt University of Mannheim

DOI:

https://doi.org/10.1609/aaai.v37i4.25581

Keywords:

DMKM: Data Stream Mining, ML: Classification and Regression, ML: Online Learning & Bandits, ML: Time-Series/Data Streams

Abstract

In this paper, we propose a new online learning algorithm tailored for data streams described by varying feature spaces (VFS), wherein new features constantly emerge and old features may stop to be observed over various time spans. Our proposed algorithm, named Online Random Feature Forests for Feature space Variabilities (ORF3V), provides a strategy to respect such feature dynamics by generating, updating, pruning, as well as online re-weighing an ensemble of what we call feature forests, which are generated and updated based on a compressed and storage efficient representation for each observed feature. We benchmark our algorithm on 12 datasets, including one novel real-world dataset of government COVID-19 responses collected through a crowd-sensing program in Spain. The empirical results substantiate the viability and effectiveness of our ORF3V algorithm and its superior accuracy performance over the state-of-the-art rival models.

Downloads

Published

2023-06-26

How to Cite

Schreckenberger, C., He, Y., Lüdtke, S., Bartelt, C., & Stuckenschmidt, H. (2023). Online Random Feature Forests for Learning in Varying Feature Spaces. Proceedings of the AAAI Conference on Artificial Intelligence, 37(4), 4587-4595. https://doi.org/10.1609/aaai.v37i4.25581

Issue

Section

AAAI Technical Track on Data Mining and Knowledge Management