Human Independent Real-Time Decision-Making Via Drift-Aware Adaptive Random Forest Ensembles
DOI:
https://doi.org/10.29284/en145088Keywords:
Adaptive Random Forest, Online Learning, Real-Time Systems, Autonomous Decision-Making, Concept Drift, Machine Learning.Abstract
Real-time decision-making systems increasingly operate in environments characterized by continuous data streams, concept drift, and the need for immediate, autonomous responses without human intervention. Traditional batch-trained machine learning models struggle in such settings due to delayed retraining and limited adaptability. This paper proposes a novel, fully autonomous decision framework that employs Adaptive Random Forests (ARF) for real-time intelligent decision-making. The framework integrates online learning, drift-aware ensemble adaptation, and self-regulating decision logic to enable continuous learning and action without manual supervision. Unlike existing approaches that rely on periodic human-in-the-loop updates, the proposed system autonomously detects data distribution changes, reconfigures its ensemble structure, and issues decisions in real time. Experimental analysis on streaming benchmarks and simulated real-world scenarios demonstrates improved adaptability, stability, and decision latency compared to conventional online and batch learning models. The proposed approach is suitable for safety-critical and high-throughput applications such as smart infrastructure, cyber-physical systems, and autonomous monitoring platforms.
References
[1] G. Hulten, L. Spencer, and P. Domingos, “Mining time-changing data streams,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, USA, 2001, pp. 97–106.
[2] P. Domingos and G. Hulten, “Mining high-speed data streams,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, 2000, pp. 71–80.
[3] A. Bifet and R. Gavaldà, “Learning from time-changing data with adaptive windowing,” in Proceedings of the SIAM International Conference on Data Mining, 2007, pp. 443–448.
[4] J. Gama, P. Medas, G. Castillo, and P. Rodrigues, “Learning with drift detection,” in Proceedings of the Brazilian Symposium on Artificial Intelligence, 2004, pp. 286–295.
[5] J. Gama, I. Žliobaitė, A. Bifet, M. Pechenizkiy, and A. Bouchachia, “A survey on concept drift adaptation,” ACM Computing Surveys, vol. 46, no. 4, pp. 1–37, 2014.
[6] H. M. Gomes, A. Bifet, J. Read, J. P. Barddal, F. Enembreck, B. Pfharinger, G. Holmes, and T. Abdessalem, “Adaptive random forests for evolving data stream classification,” Machine Learning, vol. 106, no. 9–10, pp. 1469–1495, 2017.
[7] A. Bifet, G. Holmes, R. Kirkby, and B. Pfahringer, “MOA: Massive online analysis,” Journal of Machine Learning Research, vol. 11, pp. 1601–1604, 2010.
[8] S. M. Webb, M. Hyde, H. Cao, H. L. Nguyen, and F. Petitjean, “Characterizing concept drift,” Data Mining and Knowledge Discovery, vol. 30, no. 4, pp. 964–994, 2016.
[9] L. Rutkowski, M. Jaworski, L. Pietruczuk, and P. Duda, “The CART decision tree for mining data streams,” Information Sciences, vol. 266, pp. 1–15, 2014.
[10] M. L. Zhang and Z. H. Zhou, “A review on multi-label learning algorithms,” IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 8, pp. 1819–1837, Aug. 2014.
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution 4.0 International License.
This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

