Online Nonparametric Supervised Learning for Massive Data
Mohamed Chaouch, Omama M. Al-Hamed

TL;DR
This paper introduces an online nonparametric classifier that combines dimension reduction and stochastic approximation to enable real-time supervised learning on massive streaming data, addressing computational challenges of traditional methods.
Contribution
The paper proposes a novel online algorithm for nonparametric classification that efficiently handles high-dimensional, large-scale, and streaming data by integrating PCA and stochastic approximation.
Findings
Online classifier achieves competitive accuracy with batch methods.
Online classifier offers better accuracy/computation trade-off.
Method performs well in real-time fetal monitoring applications.
Abstract
Despite their benefits in terms of simplicity, low computational cost and data requirement, parametric machine learning algorithms, such as linear discriminant analysis, quadratic discriminant analysis or logistic regression, suffer from serious drawbacks including linearity, poor fit of features to the usually imposed normal distribution and high dimensionality. Batch kernel-based nonparametric classifier, which overcomes the linearity and normality of features constraints, represent an interesting alternative for supervised classification problem. However, it suffers from the ``curse of dimension". The problem can be alleviated by the explosive sample size in the era of big data, while large-scale data size presents some challenges in the storage of data and the calculation of the classifier. These challenges make the classical batch nonparametric classifier no longer applicable. This…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFace and Expression Recognition
