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.
LOBPCG speeds up spectral clustering for streaming graphs, reducing computation time and memory usage.
problem Efficiently partitioning large graphs in streaming environments.
method Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) for graph Laplacians.
result LOBPCG reduces computation time by 100-1000x for streaming graphs compared to static graph partitioning.
Paper detects changes in graph-based data streams using likelihood-ratios.
problem Detecting changes in synchronized graph-based data streams.
method Kernel-based likelihood-ratio estimation over graph nodes.
result Effective detection and localization of change-points.
GCTM integrates GCN into topic models for better topic learning from data streams.
problem Learning hidden topics from short and noisy data streams with concept drift.
method Proposes a graph convolutional topic model (GCTM) that learns from a knowledge graph and old data.
result Significantly better performance in probabilistic predictive measures and topic coherence.
Balancing graph summarization and change detection in streaming data.
problem Balancing compression rate in graph summarization and accuracy in change detection.
method Introducing a probabilistic hierarchical latent variable model and optimizing parameters based on the minimum description length principle to balance the trade-off.
result Guaranteed suppression of Type I error probability (false alarms) in change detection.
Paper detects changes in graph streams using CCMs and adversarial learning.
problem Detecting changes in stationarity in graph streams.
method Adversarial learning for graph embeddings on constant-curvature manifolds.
result The proposed methods outperform Euclidean embeddings in detecting even small changes.
Network sampling is integral to the analysis of social, information, and biological networks. Since many real-world networks are massive in size, continuously evolving, and/or distributed in nature, the network structure is often sampled in order to facilitate study. For these reasons, a more thorough and complete unde…
Paper develops an online EM algorithm for graph signal inference from streaming data.
problem Joint inference and clustering of graph signals with non-white excitation.
method Mixture model with low-rank plus sparse prior, online EM algorithm.
result Proposed online EM algorithm converges to MAP solution.
Framework for dynamic node embeddings from graph streams.
problem Temporal prediction-based applications using graph stream data.
method ε-graph time-series representation, temporal reachability graphs, weighted temporal summary graphs.
result Dynamic embedding methods achieve better predictive performance.
Paper introduces new graph concepts for better modeling of temporal interactions.
problem Graph theory struggles to capture temporal and structural aspects of interactions.
method Generalizes graph concepts to handle both temporal and structural aspects of interactions.
result Formalism allows direct modeling of interactions over time, similar to graph theory.
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.
CauScale efficiently discovers causal relationships in large graphs.
problem Efficiency bottlenecks in causal discovery for large graphs.
method Neural architecture with reduction unit and tied attention weights.
result Achieves 99.6% mAP on in-distribution data and 84.4% on out-of-distribution data.
Graphs embedded on curved manifolds improve anomaly detection.
problem Detecting changes in graph streams.
method Embed graphs on constant-curvature manifolds (hyper-spherical and hyperbolic) and apply change detection methods.
result Curved manifolds enhance change detection in graph streams.
A new method for predicting uncertainties in stream networks.
problem Uncertainty quantification in spatiotemporal graphs with directional flow constraints.
method Spatio-Temporal Adaptive Conformal Inference (STACI) integrating network topology and temporal dynamics.
result STACI effectively balances prediction efficiency and coverage, outperforming existing methods.
Graph representations offer powerful and intuitive ways to describe data in a multitude of application domains. Here, we consider stochastic processes generating graphs and propose a methodology for detecting changes in stationarity of such processes. The methodology is general and considers a process generating attrib…
A streaming GNN model tackles continual learning for updating node representations in real-time.
problem Learning new patterns in streaming graph data while maintaining existing patterns.
method Designing an approximation algorithm for pattern detection, combining data replaying and model regularization.
result Our model efficiently updates model parameters and achieves comparable performance to model retraining.
New method for estimating higher-order network dependencies in streaming data.
problem Estimating higher-order dependencies in massive, dynamic, and streaming networks.
method Adaptive sampling and unbiased estimators for streaming networks, with a James-Stein shrinkage estimator.
result Our approach outperforms baseline methods in estimating higher-order network structure from streaming data.
Real-time anomaly detection for edge streams using MIDAS and MIDAS-F.
problem Detecting unusual behavior in dynamic graph edge streams.
method MIDAS-F focuses on microcluster anomalies, incorporating anomalies into internal states to reduce poisoning effect.
result MIDAS-F outperforms MIDAS in accuracy, with up to 62% higher ROC-AUC.
Framework tracks evolving news stories across multiple sources.
problem Tracking evolving news stories across diverse sources and formats.
method Cross-domain story tracking approach using entity graphs and learning-to-rank.
result Outperforms state-of-the-art methods for real-time story tracking.
New method learns dynamic node embeddings from temporal networks.
problem Temporal networks' temporal information is often ignored or approximated.
method Continuous-time dynamic network embeddings (CTDNEs) using temporal walks.
result CTDNEs achieve an average gain of 11.9% in AUC across all methods and graphs.
SALSA improves submodular maximization on streaming data to 0.632 approximation.
problem Maximizing submodular functions on data streams with cardinality constraints.
method SALSA, a new low-memory, single-pass algorithm for streaming submodular maximization.
result SALSA achieves a 0.632 approximation factor, improving over the 0.5 factor of previous methods.
Graph Denoising Policy Network learns robust representations from noisy graphs.
problem Noise sensitivity in graph representation learning.
method Reinforcement learning to select signal neighborhoods and aggregate features.
result Significantly outperforms state-of-the-art methods on node classification tasks.
Graph auto-encoders improve financial clustering using news and stock data.
problem Improving clustering of financial entities using multiple data sources.
method Applying graph deep learning to a finance graph with news co-occurrence and stock price data.
result Dual data sources (news and stock price) improve clustering purity to 64% compared to 32% and 42% for single data sources.
Method reduces model bias in water temperature prediction using physics-guided GNNs.
problem Model bias in traditional physics-based models across different income and education levels.
method Physics-guided GNNs with refined neighbor selection and weights.
result Preserves equitable performance across different sensitive groups in the Delaware River Basin.
A new framework for efficient streaming network embedding.
problem Efficiently embedding new vertices in growing networks.
method Adapting existing network embedding methods to streaming environments.
result Provable feasible and close to optimal latent features for new vertices.
We derive a new proof to show that the incremental resparsification algorithm proposed by Kelner and Levin (2013) produces a spectral sparsifier in high probability. We rigorously take into account the dependencies across subsequent resparsifications using martingale inequalities, fixing a flaw in the original analysis…
Novel semi-supervised method for online structure learning in noisy data streams.
problem Discovering complex relations in noisy data streams with limited labelled data.
method Combines graph-cut minimization and first-order logic for online, single-pass label completion.
result Improves accuracy of structure learning system by completing missing labels.
From social networks to Internet applications, a wide variety of electronic communication tools are producing streams of graph data; where the nodes represent users and the edges represent the contacts between them over time. This has led to an increased interest in mechanisms to model the dynamic structure of time-var…
Zero-Copy Architecture Detects Cross-Company Financial Signals Instantly.
problem Financial models miss cross-company disruptions due to static data.
method Heterogeneous Rust-Python streaming architecture that maps cross-company attention as a continuous-time graph.
result Zero-copy parsing and inference process delivers real-time cross-company signal detection.
A new method classifies multiple correlated data streams simultaneously.
problem Classifying multiple correlated data streams in practical scenarios.
method Double-Coupling Support Vector Machines (DC-SVM) considers both internal and external correlations.
result The proposed method outperforms traditional methods on artificial and real-world data streams.
Paper converts graph learning to lifelong learning.
problem Learning graphs in a streaming fashion.
method Feature graph topology, converting node classification to graph classification.
result FGN achieves superior performance in lifelong human action recognition and feature matching.
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.
Reconstructs graph structure from noisy data samples.
problem Efficiently discover and model structures in high-dimensional data.
method Combining topological data analysis with numerical modelling.
result Recovery of graph structure from noisy point cloud samples.
The paper detects changes in graph signal means offline.
problem Segmenting and detecting changes in multivariate signals over graph nodes.
method Model selection approach exploiting sparsity in spectral domain.
result Proof of non-asymptotic oracle inequality for change-point detection.
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.
Authors provide a fair comparison of GNNs for graph classification.
problem Lack of reproducibility and rigorousness in experimental procedures for GNNs.
method Controlled and uniform framework with over 47,000 experiments.
result GNNs do not fully exploit structural information on some datasets.
A new method uses matrix sketches for efficient graph clustering in dynamic environments.
problem Efficiently clustering large, dynamic graphs in distributed memory systems.
method Inspired by spectral clustering, the approach uses random dimension-reducing projections to derive matrix sketches.
result The method produces embeddings that yield performant clustering results in a fully-dynamic stochastic block model stream.
New features capture the order of data streams.
problem Handling ordered moments in massive data streams.
method Introducing features for ordered moments.
result Theoretical guarantees for learning 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.
stream-learn is a Python library for analyzing data streams with various drift types.
problem Analyzing drifting and imbalanced data streams.
method Synthetic data stream generator, evaluation methodologies, and imbalanced binary classification metrics.
result Efficient implementation of classifiers for data stream analysis.
DGNN models dynamic graphs by capturing sequential edge information.
problem Lack of models for dynamic graphs with evolving structure.
method Proposes DGNN, a dynamic graph neural network framework.
result DGNN effectively models dynamic graphs and improves performance.
A-DOGE embeds attributed graphs efficiently using density of states.
problem Efficiently represent node-attributed graphs with few numerical features.
method A-DOGE uses density of states to blend topology and attributes, leveraging efficient approximation algorithms.
result A-DOGE achieves competitive performance with modern supervised GNNs while being significantly faster.
A new test detects noise in graph data, useful for forecasting.
problem Detecting uncorrelated noise in graph data.
method Spatio-temporal extension of traditional tests, using graph signals.
result Asymptotic distribution known, no assumption of identically distributed data.
Scikit-multiflow is a Python framework for multi-output/stream data mining.
problem Handling multi-output/stream data efficiently.
method Multi-output/multi-label stream data mining framework with state-of-the-art methods.
result Enables democratization of stream learning research.
Fuzzy Bounded Twin Support Vector Machine for large datasets and streaming data.
problem Handling large datasets and learning from data streams.
method Combining TWSVM with fuzzy membership function and using dual coordinate descent with Fourier Gaussian approximation.
result Fuzzy Bounded Twin Support Vector Machine (FBTWSVM) provides fast training and robust classification.
New method rebalances evolving data streams incrementally.
problem Incremental rebalancing of evolving data streams.
method Proposes a new streaming approach for rebalancing data streams online.
result Outperforms existing approaches in rebalancing data streams.
Proposes a new method for conversational agents using deep learning.
problem Building coherent and non-monotonous conversational agents with proper discourse and coverage.
method End-to-end multi-stream deep learning architecture leveraging contextual and syntactic information.
result Significantly improved next sentence prediction task.
PySAD offers a unified Python framework for efficient streaming anomaly detection.
problem Efficient anomaly detection in streaming data with strict constraints.
method Unified architecture with 17+ streaming algorithms, specialized components, and support for multiple learning paradigms.
result PySAD enables real-time processing with bounded memory and is compatible with other Python frameworks.