A Study on Online Learning Algorithms for Streaming Data
-
DOI:
https://doi.org/10.67228/30713498/IJADSMC-2022PI7C5DPublished 04-05-2022
Online Learning, Streaming Data, Concept Drift, Incremental Learning, Real-Time Analytics, Stochastic Gradient Descent, Adaptive Algorithms, Machine Learning, Data Streams Issue
Section
ArticlesHow to Cite
[1]T. Chikore, “A Study on Online Learning Algorithms for Streaming Data”, IJADSMC, vol. 5, no. 1, pp. 01–16, Apr. 2022, doi: 10.67228/30713498/IJADSMC-2022PI7C5D.Abstract
The rapid growth of data from sensors, social media, financial systems, and IoT devices has made streaming data processing a critical research area. Traditional batch learning methods are unsuitable for streaming environments due to memory, time constraints, and inability to handle concept drift. Online learning algorithms provide an effective solution by continuously updating models with incoming data. This paper presents a comprehensive study of online learning techniques for streaming data, focusing on adaptability, accuracy, memory efficiency, and performance. Algorithms such as Stochastic Gradient Descent, Online Passive-Aggressive methods, and online ensemble techniques are analyzed along with their mathematical foundations and trade-offs. The study also addresses challenges like non-stationary data, real-time processing, and scalability, along with solutions such as concept drift detection and adaptive learning. Applications in fraud detection, predictive maintenance, healthcare, and recommendation systems are discussed. Experimental results show that hybrid online ensemble methods outperform traditional single-model approaches in stability and performance, while lightweight algorithms are suitable for edge computing. The paper concludes with future directions including federated learning, reinforcement-based adaptation, and integration with deep learning, emphasizing the importance of online learning in real-time intelligent systems.
References
[1] F. Rosenblatt, “The Perceptron: A Probabilistic Model for Information Storage and Organization in the Brain,” Psychological Review, vol. 65, no. 6, pp. 386–408, 1958.
[2] H. Robbins and S. Monro, “A Stochastic Approximation Method,” Annals of Mathematical Statistics, vol. 22, no. 3, pp. 400–407, 1951.
[3] J. Kiefer and J. Wolfowitz, “Stochastic Estimation of the Maximum of a Regression Function,” Annals of Mathematical Statistics, 1952.
[4] L. Bottou, “Online Learning and Stochastic Approximations,” On-Line Learning in Neural Networks, Cambridge University Press, 1998.
[5] N. Cesa-Bianchi and G. Lugosi, Prediction, Learning, and Games, Cambridge University Press, 2006.
[6] K. Crammer, O. Dekel, J. Keshet, S. Shalev-Shwartz and Y. Singer, “Online Passive-Aggressive Algorithms,” Advances in Neural Information Processing Systems (NIPS), 2006.
[7] M. Zinkevich, “Online Convex Programming and Generalized Infinitesimal Gradient Ascent,” ICML, 2003.
[8] A. Bifet, G. Holmes, R. Kirkby and B. Pfahringer, “MOA: Massive Online Analysis,” Journal of Machine Learning Research, 2010.
[9] N. Oza and S. Russell, “Online Bagging and Boosting,” Artificial Intelligence and Statistics, 2001.
[10] J. Gama, I. Žliobaitė, A. Bifet, M. Pechenizkiy and A. Bouchachia, “A Survey on Concept Drift Adaptation,” ACM Computing Surveys, 2014.
[11] M. D. Zeiler, “ADADELTA: An Adaptive Learning Rate Method,” arXiv, 2012.
[12] S. Fukushima, A. Nitanda and K. Yamanishi, “Online Robust and Adaptive Learning from Data Streams,” arXiv, 2020.
[13] Y. Han et al., “Bilevel Online Deep Learning in Non-Stationary Environment,” arXiv, 2022.
[14] A. Budiman, M. I. Fanany and C. Basaruddin, “Adaptive Online Sequential ELM for Concept Drift Tackling,” arXiv, 2016.
[15] J. Lu et al., “A Survey of Active and Passive Concept Drift Handling Methods,” 2022.
Downloads
How to Cite
[1]T. Chikore, “A Study on Online Learning Algorithms for Streaming Data”, IJADSMC, vol. 5, no. 1, pp. 01–16, Apr. 2022, doi: 10.67228/30713498/IJADSMC-2022PI7C5D.