On the public citation graph
AMF: Aggregated Mondrian Forests for Online Learning
0 signed · 74 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcss.1997.1556openalex-snapshot
A Game of Prediction with Expert Advice
inferredcites →https://doi.org/10.1007/b99352openalex-snapshot
Statistical Learning Theory and Stochastic Optimization
inferredcites →https://doi.org/10.1016/j.ygeno.2012.04.003openalex-snapshot
Random forests for genomic data analysis
inferredcites →https://doi.org/10.1016/s0246-0203(99)00115-6openalex-snapshot
The “progressive mixture” estimator for regression trees
inferredcites →https://doi.org/10.1017/cbo9780511546921openalex-snapshot
Prediction, Learning, and Games
inferredcites →https://doi.org/10.1023/a:1007396710653openalex-snapshot
Predicting Nearly As Well As the Best Pruning of a Decision Tree
inferredcites →https://doi.org/10.1023/a:1022699900025openalex-snapshot
Incremental Induction of Decision Trees
inferredcites →https://doi.org/10.1051/ps/2018008openalex-snapshot
Impact of subsampling and tree depth on random forests
inferredcites →https://doi.org/10.1080/01621459.1998.10473750openalex-snapshot
Bayesian CART Model Search
inferredcites →https://doi.org/10.1080/10485252.2012.677843openalex-snapshot
Variance reduction in purely random forests
inferredcites →https://doi.org/10.1109/18.382012openalex-snapshot
The context-tree weighting method: basic properties
inferredcites →https://doi.org/10.1109/18.661523openalex-snapshot
The context-tree weighting method: extensions
inferredcites →https://doi.org/10.1109/tit.2004.833339openalex-snapshot
On the Generalization Ability of On-Line Learning Algorithms
inferredcites →https://doi.org/10.1111/rssb.12293openalex-snapshot
Bayesian Regression Tree Ensembles that Adapt to Smoothness and Sparsity
inferredcites →https://doi.org/10.1145/225298.225305openalex-snapshot
Predicting nearly as well as the best pruning of a decision tree
inferredcites →https://doi.org/10.1186/1471-2105-7-3openalex-snapshot
Gene selection and classification of microarray data using random forest
inferredcites →https://doi.org/10.1198/jasa.2011.ap09769openalex-snapshot
Dynamic Trees for Learning and Design
inferredcites →https://doi.org/10.1214/09-aoas285openalex-snapshot
BART: Bayesian additive regression trees
inferredcites →https://doi.org/10.1214/19-aos1879openalex-snapshot
Posterior concentration for Bayesian regression trees and forests
inferredcites →https://doi.org/10.1214/19-aos1886openalex-snapshot
Minimax optimal rates for Mondrian trees and forests
inferredcites →https://doi.org/10.1214/aos/1176345969openalex-snapshot
Optimal Global Rates of Convergence for Nonparametric Regression
inferredcites →https://doi.org/10.13140/2.1.1570.5928openalex-snapshot
Understanding Random Forests: From Theory to Practice
inferredcites →https://doi.org/10.32614/cran.package.partyopenalex-snapshot
party: A Laboratory for Recursive Partytioning
inferredcites →https://doi.org/10.48550/arxiv.1005.0208openalex-snapshot
Analysis of a Random Forests Model
inferredcites →https://doi.org/10.48550/arxiv.1201.0490openalex-snapshot
Scikit-learn: Machine Learning in Python
inferredcites →https://doi.org/10.48550/arxiv.1302.4853openalex-snapshot
Consistency of Online Random Forests
inferredcites →https://doi.org/10.48550/arxiv.1406.2673openalex-snapshot
Mondrian Forests: Efficient Online Random Forests
inferredcites →https://doi.org/10.48550/arxiv.1407.3939openalex-snapshot
Analysis of purely random forests bias
inferredcites →https://doi.org/10.48550/arxiv.1503.06388openalex-snapshot
Adaptive Concentration of Regression Trees, with Application to Random Forests
inferredcites →https://doi.org/10.48550/arxiv.1506.03805openalex-snapshot
Mondrian Forests for Large-Scale Regression when Uncertainty Matters
inferredcites →https://doi.org/10.48550/arxiv.1711.02887openalex-snapshot
Universal consistency and minimax rates for online Mondrian Forests
inferredcites →https://doi.org/10.5555/2503308.2343682openalex-snapshot
Analysis of a random forests model
inferredcites →https://doi.org/10.7551/mitpress/1120.003.0051openalex-snapshot
On the Generalization Ability of On-line Learning Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-032-23833-7_27openalex-snapshot
The Window Dilemma: Why Concept Drift Detection is Ill-Posed
inferred← citeshttps://doi.org/10.1007/s00521-023-08290-wopenalex-snapshot
An adaptive multi-class imbalanced classification framework based on ensemble methods and deep network
inferred← citeshttps://doi.org/10.1007/s10489-022-03264-2openalex-snapshot
Walking motion real-time detection method based on walking stick, IoT, COPOD and improved LightGBM
inferred← citeshttps://doi.org/10.1007/s10489-025-06786-7openalex-snapshot
Simultaneous fault prediction in evolving industrial environments with ensembles of Hoeffding adaptive trees
inferred← citeshttps://doi.org/10.1007/s10586-024-04465-9openalex-snapshot
An online ensemble method for auto-scaling NFV-based applications in the edge
inferred← citeshttps://doi.org/10.1007/s10846-024-02178-0openalex-snapshot
Semi-Supervised Online Continual Learning for 3D Object Detection in Mobile Robotics
inferred← citeshttps://doi.org/10.1016/j.dam.2024.09.021openalex-snapshot
There is no perfect Mondrian partition for squares of side lengths less than 1001
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.128439openalex-snapshot
Concept drift meets industrial data streams: An efficient drift adaptation framework with knowledge embedding and transfer
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.129818openalex-snapshot
Markov-based continuous learning with diversion of data distribution direction for streaming data in limited memory
inferred← citeshttps://doi.org/10.1016/j.ins.2026.123338openalex-snapshot
TRACED: Trend-adaptive classification with ellipsoidal disambiguation for resolving exterior and coincident regions in data streams
inferred← citeshttps://doi.org/10.1016/j.iot.2025.101545openalex-snapshot
OASIS: Online adaptive ensembles for drift adaptation on evolving IoT data streams
inferred← citeshttps://doi.org/10.1016/j.iot.2025.101758openalex-snapshot
A comprehensive review of IoT device fingerprinting: Insights into techniques, trends, challenges, and future directions
inferred← citeshttps://doi.org/10.1016/j.jcp.2021.110116openalex-snapshot
Uncertainty quantification for data-driven turbulence modelling with Mondrian forests
inferred← citeshttps://doi.org/10.1016/j.knosys.2024.112561openalex-snapshot
Hoeffding adaptive trees for multi-label classification on data streams
inferred← citeshttps://doi.org/10.1038/s41598-025-08844-zopenalex-snapshot
Adaptive ensemble spatial analysis
inferred← citeshttps://doi.org/10.1080/01621459.2022.2126782openalex-snapshot
Large Scale Prediction with Decision Trees
inferred← citeshttps://doi.org/10.1093/jrsssb/qkaf077openalex-snapshot
Inference with Mondrian random forests
inferred← citeshttps://doi.org/10.1109/globecom59602.2025.11431867openalex-snapshot
OLIDA-IDS: Online Learning with Integrated Domain Adaptation for Intrusion Detection Systems
inferred← citeshttps://doi.org/10.1109/iccea62105.2024.10603489openalex-snapshot
An Online Transfer Learning Model for Intrusion Detection using FT-Transformer and KSWIN-Driven Concept Drift Detection Mechanism
inferred← citeshttps://doi.org/10.1109/tcomm.2025.3547764openalex-snapshot
Toward Zero Touch Networks: Cross-Layer Automated Security Solutions for 6G Wireless Networks
inferred← citeshttps://doi.org/10.1109/tcyb.2024.3429459openalex-snapshot
TS-DM: A Time Segmentation-Based Data Stream Learning Method for Concept Drift Adaptation
inferred← citeshttps://doi.org/10.1109/tit.2023.3287432openalex-snapshot
WildWood: A New Random Forest Algorithm
inferred← citeshttps://doi.org/10.1109/tit.2026.3681693openalex-snapshot
Fréchet Regression With Mondrian Forests: Finite-Sample Guarantees and Ensemble Benefits
inferred← citeshttps://doi.org/10.1109/tkde.2025.3610184openalex-snapshot
Adaptive Information Fusion-Based Concept Drift Learning for Evolving Multiple Data Streams
inferred← citeshttps://doi.org/10.1109/tmlcn.2024.3374253openalex-snapshot
An IoMT-Based Incremental Learning Framework With a Novel Feature Selection Algorithm for Intelligent Diagnosis in Smart Healthcare
inferred← citeshttps://doi.org/10.1109/tnnls.2022.3212859openalex-snapshot
Online Extra Trees Regressor
inferred← citeshttps://doi.org/10.1111/nyas.70117openalex-snapshot
Key Factors and Predictive Models of Digital Collaborative Education Based on Machine Learning
inferred← citeshttps://doi.org/10.11606/t.55.2023.tde-30082023-135843openalex-snapshot
Efficient online tree, rule-based and distance-based algorithms
inferred← citeshttps://doi.org/10.23919/chain.2024.100002openalex-snapshot
Lithium Battery Digital Twin Model with Incremental Learning
inferred← citeshttps://doi.org/10.3390/math13040587openalex-snapshot
Foundations and Innovations in Data Fusion and Ensemble Learning for Effective Consensus
inferred← citeshttps://doi.org/10.36227/techrxiv.23971707openalex-snapshot
Towards Zero Touch Networks: Cross-Layer Automated Security Solutions for 6G Wireless Networks
inferred← citeshttps://doi.org/10.5753/w6g.2025.8835openalex-snapshot
Online Approach for Proactive Scaling of Mobile Core Network Functions
inferred← citeshttps://doi.org/10.70675/d8ecd308z06cbz4e17zba3fzccfa3ad4f6f1openalex-snapshot
Robust algorithms and other contributions to machine learning
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.