Data stream classification methods demonstrate promising performance on a single data stream by exploring the cohesion in the data stream. However, multiple data streams that involve several correlated data streams are common in many practical scenarios, which can be viewed as multi-task data streams. Instead of handli…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,657 papers · 148 categories
Trend · papers per month
48 results for “streaming data”
Data stream clustering tackles real-time data processing challenges.
problem Real-time processing of data streams with less prior information.
method Review of data stream clustering algorithms and their characteristics.
result Comparison and analysis of data stream clustering algorithms.
Bayesian tensor train method recovers streaming data with high accuracy.
problem Recovering high-order, incomplete, and noisy streaming data.
method Bayesian tensor train decomposition using streaming variational Bayes method.
result The proposed SPTT algorithm excels in recovering streaming data compared to state-of-the-art methods.
Nowadays, every device connected to the Internet generates an ever-growing stream of data (formally, unbounded). Machine Learning on unbounded data streams is a grand challenge due to its resource constraints. In fact, standard machine learning techniques are not able to deal with data whose statistics is subject to gr…
stream-learn is a Python package compatible with scikit-learn and developed for the drifting and imbalanced data stream analysis. Its main component is a stream generator, which allows to produce a synthetic data stream that may incorporate each of the three main concept drift types (i.e. sudden, gradual and incrementa…
Dynamic Model Tree improves online learning for evolving data streams.
problem Effective and transparent machine learning on data streams is challenging.
method Revisit Model Trees for data stream applications, introducing Dynamic Model Tree.
result Dynamic Model Tree reduces the number of splits and outperforms state-of-the-art models.
Adapts DPMM for fast streaming data clustering.
problem Clustering streaming data with time-dependent statistics.
method Adapts DPMM and sampling-based inference for online clustering.
result Obtains state-of-the-art results in speed and accuracy.
CROC identifies the earliest-changing stream as the root cause in multi-stream data.
problem Distribution-free root cause analysis in multi-stream data with unknown distributional changes.
method Conformal p-values and finite-sample valid confidence sets.
result CROC efficiently isolates the root cause under minimal assumptions.
In machine learning, the one-class classification problem occurs when training instances are only available from one class. It has been observed that making use of this class's structure, or its different contexts, may improve one-class classifier performance. Although this observation has been demonstrated for static …
This research generates synthetic data streams for handling concept drifts and novel classes.
problem Handling concept drifts and novel classes in dynamic data streams.
method Synthetic data stream generation for both concept drifts and novel classes.
result Demonstrates the effectiveness of unsupervised drift detectors in open set recognition.
Paper improves Oja's algorithm for Markovian data streams.
problem Estimating the top eigenvector of a covariance matrix from Markovian data.
method Improves Oja's algorithm for streaming PCA with Markovian dependence.
result First sharp rate for Oja's algorithm on entire data stream, removing sample size dependence.
We introduce a new sub-linear space sketch---the Weight-Median Sketch---for learning compressed linear classifiers over data streams while supporting the efficient recovery of large-magnitude weights in the model. This enables memory-limited execution of several statistical analyses over streams, including online featu…
Paper proposes a method to estimate coverage in data streams.
problem Estimating coverage in data streams with limited storage.
method Modified CVM algorithm for estimating coverage in streaming settings.
result The method efficiently estimates coverage in data streams.
A method detects changes in heterogeneous data streams over graph nodes.
problem Detecting changes in data streams from nodes of a graph.
method Online non-parametric method using likelihood-ratio estimation.
result The method accurately identifies change-points in real-world applications.
A new method for estimating SW from streaming data.
problem Estimating Wasserstein distance from sample streams.
method Introducing a streaming estimator of the 1DW and applying it to all projections.
result Stream-SW achieves more accurate approximation of SW than random subsampling.
CURIE uses cellular automata to detect concept drift in data streams.
problem Detecting changes in data distribution (concept drift) in data streams.
method CURIE represents data stream distribution in a cellular automata grid and uses its neighborhood rule to detect changes.
result CURIE, when hybridized with base learners, performs competitively in detection metrics and classification accuracy.
Differentially private ensemble classifiers adapt to data streams while protecting privacy.
problem Adapting to evolving data characteristics while protecting private information.
method Unbounded ensemble updates, model agnostic approach.
result Outperforms competitors on various privacy, drift, and distribution settings.
Visual analytics tool detects and corrects concept drift in data streams.
problem Concept drift causes inaccurate predictions in evolving data.
method DriftVis combines drift detection and visualization.
result Visual analytics supports detection, examination, and correction of concept drift.
Enhash detects concept drift in data streams quickly and efficiently.
problem Detecting abrupt, gradual, virtual, or recurring events in data streams.
method Uses projection hash to insert incoming samples and detects concept drift.
result Enhash has competitive performance and moderate resource requirements compared to existing ensemble learners.
Many modern data analysis problems involve inferences from streaming data. However, streaming data is not easily amenable to the standard probabilistic modeling approaches, which assume that we condition on finite data. We develop population variational Bayes, a new approach for using Bayesian modeling to analyze strea…
Detects synchronized behavior in streaming data.
problem Tracking synchronized behavior in time-stamped tuples.
method AugSplicing algorithm for streaming dense block detection.
result Effective and robust in detecting anomalous behavior.
Paper addresses challenges in benchmarking stream learning algorithms with real-world data.
problem Lack of publicly available non-stationary real-world datasets for evaluating stream algorithms.
method Proposes a new public data repository for benchmarking stream algorithms with real-world data.
result Mitigates problems related to dataset choice in experimental evaluation of stream classifiers and drift detectors.
The performance of classification algorithms with a massive and highly imbalanced data stream depends upon efficient balancing strategy. Some techniques of balancing strategy have been applied in the past with Batch data to resolve the class imbalance problem. This paper proposes a new incremental data balancing framew…
New robustness certificates for streaming models with a sliding window.
problem Applying robustness certificates to streaming data with correlated inputs.
method Deriving robustness certificates for models using a sliding window over a sequence of potentially correlated inputs.
result Guarantees hold for the average model performance across the entire stream, independent of stream size.
This paper reviews methods for distributed training of machine learning models from high-rate streams.
problem Training machine learning models from high-rate distributed streams in a compute- and bandwidth-limited setting.
method Recently developed methods for large-scale distributed stochastic optimization.
result There exist regimes where systems can learn from distributed, streaming data at order-optimal rates.
A new algorithm for K-means clustering in evolving data streams.
problem Clustering of continuously arriving data in streaming scenarios with concept drift.
method Formal definition of Streaming -means, surrogate error function, algorithm for minimizing surrogate error.
result The surrogate error function effectively approximates the Streaming -means error.
New metrics needed for streaming ML due to delayed labels.
problem Streaming ML evaluation fails to identify unexpected performance.
method Recommend additional metrics for streaming ML performance.
result New metrics are needed for streaming ML due to delayed labels.
The advance of modern sensor technologies enables collection of multi-stream longitudinal data where multiple signals from different units are collected in real-time. In this article, we present a non-parametric approach to predict the evolution of multi-stream longitudinal data for an in-service unit through borrowing…
New algorithm samples matrix rows proportional to their ℓ_p norm in a turnstile data stream.
problem Sampling rows of a dynamic matrix efficiently in a turnstile data stream.
method Develops a novel algorithm for sampling rows proportional to their ℓ_p norm in a turnstile data stream, returning sampled row indexes and approximated sampling probabilities.
result Achieves approximation for logistic regression in a turnstile data stream with polynomial sketch size.
METEOR learns efficient representations from multi-modal data streams.
problem Efficiently interpreting multi-modal information in complex environments.
method METEOR learns compact representations by sharing parameters within semantically meaningful groups and preserving domain-agnostic semantics.
result METEOR reduces memory usage by around 80% compared to conventional methods.
Convolutional neural networks outperform other architectures in streaming time series classification.
problem Efficient deep learning models for real-time data streams.
method Asynchronous dual-pipeline deep learning framework for real-time predictions.
result Convolutional architectures achieve higher accuracy and efficiency in streaming time series classification.
Federated learning for data streams tackles real-time learning from IoT devices.
problem Efficiently learn from data streams generated by IoT devices and smartphones.
method Proposes a general federated learning algorithm for data streams using weighted empirical risk minimization.
result Demonstrates improved performance on various machine learning tasks compared to static dataset approaches.
Survey of active learning for data streams.
problem Efficiently labeling data points in real-time data streams.
method Review of active learning approaches for data streams.
result Overview of recent approaches for online active learning.
StreamEnsemble dynamically selects ML models for ST data streams to improve predictive accuracy.
problem Predictive queries over spatiotemporal data streams are challenging due to varying distributions and patterns.
method Dynamic selection and allocation of ML models based on time series distributions and characteristics.
result Significantly outperforms traditional ensemble and single model approaches, reducing prediction error by over 10 times.
In marketing we are often confronted with a continuous stream of responses to marketing messages. Such streaming data provide invaluable information regarding message effectiveness and segmentation. However, streaming data are hard to analyze using conventional methods: their high volume and the fact that they are cont…
MSTREAM detects anomalies in multi-aspect data streams.
problem Detecting unusual group anomalies in dynamic multi-aspect data.
method Online streaming multi-aspect anomaly detection framework.
result MSTREAM outperforms state-of-the-art baselines.
Proposes a method to optimize budget allocation for collecting and analyzing streaming data.
problem Optimizing resource allocation for collecting and analyzing streaming data.
method Formulates optimization problems to allocate budgets for collecting input data and running simulations, characterizes asymptotic behavior of performance estimators, and develops a multi-stage simultaneous budget allocation procedure.
result Demonstrates competitive performance of the proposed procedure through numerical studies.
Data collection at a massive scale is becoming ubiquitous in a wide variety of settings, from vast offline databases to streaming real-time information. Learning algorithms deployed in such contexts must rely on single-pass inference, where the data history is never revisited. In streaming contexts, learning must also …
In data stream mining, predictive models typically suffer drops in predictive performance due to concept drift. As enough data representing the new concept must be collected for the new concept to be well learnt, the predictive performance of existing models usually takes some time to recover from concept drift. To spe…
Big data trend has enforced the data-centric systems to have continuous fast data streams. In recent years, real-time analytics on stream data has formed into a new research field, which aims to answer queries about what-is-happening-now with a negligible delay. The real challenge with real-time stream data processing …
A new algorithm splits Gaussian processes for efficient streaming data.
problem Poor scaling of Gaussian processes in streaming data.
method Sequential partitioning of input space and localized Gaussian process fitting.
result The algorithm achieves linear memory complexity and superior time and space complexity.
AdaKoop efficiently models nonlinear dynamics from nonstationary data streams.
problem Capturing nonlinear dynamics in nonstationary data streams with computational efficiency.
method Koopman operator theory and probabilistic framework for streaming data.
result AdaKoop outperforms state-of-the-art methods in real-time forecasting accuracy and efficiency.
Classifiers trained on data sets possessing an imbalanced class distribution are known to exhibit poor generalisation performance. This is known as the imbalanced learning problem. The problem becomes particularly acute when we consider incremental classifiers operating on imbalanced data streams, especially when the l…
In a world of global trading, maritime safety, security and efficiency are crucial issues. We propose a multi-task deep learning framework for vessel monitoring using Automatic Identification System (AIS) data streams. We combine recurrent neural networks with latent variable modeling and an embedding of AIS messages t…
In theory, Bayesian nonparametric (BNP) models are well suited to streaming data scenarios due to their ability to adapt model complexity with the observed data. Unfortunately, such benefits have not been fully realized in practice; existing inference algorithms are either not applicable to streaming applications or no…
Novel algorithm SAODE improves high-dimensional stream classification in seasonal data.
problem Handling seasonal concept drift in high-dimensional stream classification.
method SAODE classifier that includes time as a super parent to handle seasonal drift.
result SAODE consistently outperforms other methods in stream and concept drift classification.
Streaming algorithms are generally judged by the quality of their solution, memory footprint, and computational complexity. In this paper, we study the problem of maximizing a monotone submodular function in the streaming setting with a cardinality constraint . We first propose Sieve-Streaming++, which requires just…
Unified study of stateful replay for streaming learning, reducing forgetting by 2-3x.
problem Catastrophic forgetting in streaming generative and predictive learning.
method Unified analysis of stateful replay for autoencoding, forecasting, and classification tasks.
result Stateful replay reduces average forgetting by a factor of 2-3 on heterogeneous multi-task streams.