Martin Khannouz

dblp:267/3295 · DBLP profile ↗
← Back
3ranked-venue papers in the field
2as first author
3since 2021 · last 2024
0000-0003-2129-5517ORCID · corroborated

Domains — venue-derived; a paper can count in several

Big Data, Cloud & Distributed Data Systems · 2 (1 first)Data Mining & Knowledge Discovery · 1 (1 first)
YearPublicationVenuePosition
2024 Mondrian forest for data stream classification under memory constraints
Martin Khannouz, Tristan Glatard
Data Min. Knowl. Discov.1
2022 Dynamic Ensemble Size Adjustment for Memory Constrained Mondrian Forest
abstract
Supervised learning algorithms generally assume the availability of enough memory to store data models during the training and test phases. However, this assumption is unrealistic when data comes in the form of infinite data streams, or when learning algorithms are deployed on devices with reduced amounts of memory. Such memory constraints impact the model behavior and assumptions. In this paper, we show that under memory constraints, increasing the size of a tree-based ensemble classifier can worsen its performance. In particular, we experimentally show the existence of an optimal ensemble size for a memory-bounded Mondrian forest on data streams and we design an algorithm to guide the forest toward that optimal number by using an estimation of overfitting. We tested different variations for this algorithm on a variety of real and simulated datasets, and we conclude that our method can achieve up to 95% of the performance of an optimally-sized Mondrian forest for stable datasets, and can even outperform it for datasets with concept drifts. All our methods are implemented in the OrpailleCC open-source library and are ready to be used on embedded systems and connected objects.
Martin Khannouz, Tristan Glatard
IEEE Big Data1
2021 Reducing numerical precision preserves classification accuracy in Mondrian Forests
abstract
Mondrian Forests are a powerful data stream classification method, but their large memory footprint makes them ill-suited for low-resource platforms such as connected objects. We explored using reduced-precision floating-point representations to lower memory consumption and evaluated its effect on classification performance. We applied the Mondrian Forest implementation provided by OrpailleCC, a C++ collection of data stream algorithms, to two canonical datasets in human activity recognition: Recofit and Banos et al. Results show that the precision of floating-point values used by tree nodes can be reduced from 64 bits to 8 bits with no significant difference in F1 score. In some cases, reduced precision was shown to improve classification performance, presumably due to its regularization effect. We conclude that numerical precision is a relevant hyperparameter in the Mondrian Forest, and that commonly-used double precision values may not be necessary for optimal performance. Future work will evaluate the generalizability of these findings to other data stream classifiers.
Marc Vicuna, Martin Khannouz, Gregory Kiar, Yohan Chatelain, Tristan Glatard
IEEE BigData2