Research
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,978 papers · 148 categories

Trend · papers per month

2795588361,115 · Jun 202019922001200920172026
48 results for bursty data

This paper uses cPF to build recommender systems from raw count data.

problem Sparse, over-dispersed and bursty count data make direct use in recommender systems challenging.
method Compound Poisson Factorization (cPF) with a unified framework (dcPF) and adaptive algorithm.
result dcPF achieves better recommendation scores than Poisson Factorization on raw or binarized data.

Paper proposes a new method to handle missing data in medical records using sequential variational autoencoders.

problem Missing data in medical records due to sensor off-times and uneven data collection.
method Sequential variational autoencoders (VAEs) with a new methodology called Shi-VAE.
result Shi-VAE achieves the best performance in terms of both metrics compared to state-of-the-art methods.

Hybrid model improves geopolitical conflict forecasting.

problem Forecasting geopolitical events from sparse, bursty data.
method Sparse Temporal Fusion Transformer (TFT) + Variational Nearest Neighbor Gaussian Process (VNNGP).
result Consistently outperforms standalone TFT in long-range horizons.

Combustion reaction kinetics models are used for the description of a special class of bursty Financial Time Series. The small number of parameters they depend upon enable financial analysts to predict the time as well as the magnitude of the jump of the value of the portfolio. Several Financial Time Series are analyse…

2001-01-07abs ↗pdf ↗

We present a new, efficient method for automatically detecting severe conflicts `edit wars' in Wikipedia and evaluate this method on six different language WPs. We discuss how the number of edits, reverts, the length of discussions, the burstiness of edits and reverts deviate in such pages from those following the gene…

2011-07-19abs ↗pdf ↗

Paper proposes a new Markov model for efficient PLC system design.

problem Efficient estimation of Markov model parameters for bursty error channels.
method Introduced a Block Diagonal Markov model and a modified Baum-Welch algorithm.
result Efficient estimation of state transition matrix ΛΛ for PLC system design.

A common approach to analyze a covariate-sample count matrix, an element of which represents how many times a covariate appears in a sample, is to factorize it under the Poisson likelihood. We show its limitation in capturing the tendency for a covariate present in a sample to both repeat itself and excite related ones…

2016-04-25abs ↗pdf ↗

Robust Bayesian models are appealing alternatives to standard models, providing protection from data that contains outliers or other departures from the model assumptions. Historically, robust models were mostly developed on a case-by-case basis; examples include robust linear regression, robust mixture models, and bur…

2015-10-17abs ↗pdf ↗

New method uses reinforcement learning to accurately estimate available network bandwidth.

problem Accurate and fast estimation of available bandwidth in networks with varying cross-traffic.
method Employed reinforcement learning, specifically the εε-greedy algorithm in a multi-armed bandit approach.
result Proposed method identifies available bandwidth with high precision and converges under various challenging conditions.

How is popularity gained online? Is being successful strictly related to rapidly becoming viral in an online platform or is it possible to acquire popularity in a steady and disciplined fashion? What are other temporal characteristics that can unveil the popularity of online content? To answer these questions, we lever…

2019-04-10abs ↗pdf ↗

Paper proves EM algorithm convergence for mixtures of discrete and continuous parameters.

problem Nontrivial convergence analysis for EM algorithms with mixed-integer parameters.
method Introduces conditions for EM convergence in mixed-integer optimization.
result Proves convergence of EM-based sparse Bayesian learning algorithm.

Study develops curvature for contact-sequence networks, revealing temporal dynamics.

problem Lack of geometric analysis for temporal network sequences.
method Develops Forman--Ricci curvature on spatiotemporal prism complexes.
result Two curvature variants disagree on 56-67% of temporal edges.

This study reveals statistical patterns in ERC20 token transactions on Ethereum blockchain.

problem Understanding transactional dynamics in decentralized systems.
method Examined over 44 million ERC20 token transfers, categorized by address type (EOA or SC), and analyzed using scaling laws.
result EOA-driven transactions exhibit consistent statistical behavior, while SC-driven activity displays sublinear scaling and bursty activity.

A new metric, Weighted Regret, unifies FDR and power evaluation in online multiple testing.

problem The asymmetric costs of false positives and false negatives in automated pipelines.
method Introducing Weighted Regret and Decoupled-OMT (DOMT) to unify FDR and power evaluation.
result DOMT achieves an order-optimal sublinear mitigation of threshold depletion in bursty environments.

In online social media systems users are not only posting, consuming, and resharing content, but also creating new and destroying existing connections in the underlying social network. While each of these two types of dynamics has individually been studied in the past, much less is known about the connection between th…

2014-03-11abs ↗pdf ↗

Exact asymptotic solutions found for nonlinear Hawkes processes.

problem Analytical solutions for nonlinear Hawkes processes with positive and negative feedbacks.
method Field master equation approach to classify steady-state solutions.
result Explicit power law formulas for steady-state intensity distributions Pss(λ)λ1aP_{\mathrm{ss}}(λ)\propto λ^{-1-a}, with aa as a function of parameters.

Big data sets must be carefully partitioned into statistically similar data subsets that can be used as representative samples for big data analysis tasks. In this paper, we propose the random sample partition (RSP) data model to represent a big data set as a set of non-overlapping data subsets, called RSP data blocks,…

2017-12-12abs ↗pdf ↗

Prevents sensitive data generation in diffusion models using labeled and unlabeled data.

problem Generating sensitive data in diffusion models using unlabeled data.
method Positive-Unlabeled Diffusion Models, approximating ELBO with labeled and unlabeled data.
result Prevents the generation of sensitive data without compromising image quality.

Study reveals Data Shapley's inconsistent performance in data selection tasks.

problem Inconsistency of Data Shapley's performance in data selection across different settings.
method Hypothesis testing framework and identification of utility functions.
result Data Shapley's performance is no better than random selection without specific constraints.

PRRO generates synthetic tabular data that improves SL performance and class distribution.

problem Low SL utility of synthetic data due to class imbalance and overlooked data relationships.
method Data pruning and column reordering to optimize SL utility.
result Synthetic data generated with PRRO enhances predictive performance and class distribution.

Defines data science as a natural ecosystem with challenges and missions.

problem Challenges and missions in data science due to 5D complexities and data life cycle phases.
method Systemic and data-centric view of data science as a fusion of data universe and its challenges, formalizing a general-purpose architecture.
result Essential data science as a natural ecosystem integrating specific disciplines and high-impact applications.

This paper introduces C-DSL to improve data mining outcomes by considering context.

problem Data collection ambiguities, data imbalance, hidden biases, lack of domain info, and data incompleteness.
method Developed Context-Driven Data Science Lifecycle (C-DSL) to address data quality issues.
result Tangible improvements to data mining outcomes were achieved through C-DSL.

Proposes using probabilistic models for privacy-preserving synthetic data.

problem Designing high-quality synthetic data for privacy preservation.
method Formulate the problem through probabilistic modelling, choosing a model for the data.
result Statistical discoveries can be reliably reproduced from synthetic data.

Paper creates fair synthetic data ensuring equal predictions across sensitive attributes.

problem Ensuring fair predictions across sensitive attributes in synthetic data.
method Equalizing target probability distributions across sensitive attributes in synthetic data generation.
result Synthetic data provides strong fair predictions, equal across all thresholds.

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.

Efficient synthetic data generation improves model performance on tabular data.

problem Improving model robustness and performance with scarce or low-quality data.
method Hardness characterization to identify high-value training points, generating synthetic data only from these points.
result Synthetic data generated from hardest points outperforms non-targeted methods on tabular datasets.

For most problems in science and engineering we can obtain data sets that describe the observed system from various perspectives and record the behavior of its individual components. Heterogeneous data sets can be collectively mined by data fusion. Fusion can focus on a specific target relation and exploit directly ass…

2013-07-02abs ↗pdf ↗

DAERNN models censored data using neural networks with data augmentation.

problem Handling censored data in expectile regression.
method Data augmentation based Expectile Regression Neural Networks (ERNNs).
result DAERNN outperforms existing censored ERNNs methods and achieves comparable predictive performance to fully observed data.

Data preprocessing techniques are devoted to correct or alleviate errors in data. Discretization and feature selection are two of the most extended data preprocessing techniques. Although we can find many proposals for static Big Data preprocessing, there is little research devoted to the continuous Big Data problem. A…

2018-10-14abs ↗pdf ↗