New algorithm embeds crime events using RBMs with feature selection.
problem Capturing complex crime data features for event embedding.
method Regularized RBMs with ℓ1 penalty for feature selection. result Improved event embedding with interpretable selected features.
Click through rate (CTR) prediction is very important for Native advertisement but also hard as there is no direct query intent. In this paper we propose a large-scale event embedding scheme to encode the each user browsing event by training a Siamese network with weak supervision on the users' consecutive events. The …
Anomaly detection plays an important role in modern data-driven security applications, such as detecting suspicious access to a socket from a process. In many cases, such events can be described as a collection of categorical values that are considered as entities of different types, which we call heterogeneous categor…
An explicit global and unique isometric embedding into hyperbolic 3-space, H^3, of an axi-symmetric 2-surface with Gaussian curvature bounded below is given. In particular, this allows the embedding into H^3 of surfaces of revolution having negative, but finite, Gaussian curvature at smooth fixed points of the U(1) iso…
Event2vec learns object embeddings in HINs by considering both relation properties and quantities.
problem Ignoring relation properties in existing NRL methods for HINs.
method Event2vec uses events to represent relations and defines event-driven proximities to measure object relevance.
result Event2vec preserves event-driven proximities in the embedding space and outperforms state-of-the-art methods.
A new HP model balances interpretability and flexibility for EHR event sequences.
problem Balancing interpretability and flexibility in modeling diagnostic event sequences.
method Proposes a neural network-based HP with flexible impact kernel and transformer layers.
result Accurately recovers impact functions, competitive performance, and clinically meaningful interpretation.
A new method for embedding sparse high-order interactions.
problem Learning embeddings from sparse high-order interaction events.
method Hybridizing sparse hypergraph and matrix Gaussian processes.
result Strong asymptotic bounds on sparsity ratio.
Predicting event attendance using social influence from social networks.
problem Predicting people's participation in real-world events.
method Modeling social influence, using non-geotagged posts and social group structures, applying graph embedding techniques, and training a neural network.
result The proposed classifier achieves 89% accuracy on the VFestival dataset, outperforming state-of-the-art methods.
DGE learns event representations from image sequences without manual annotations.
problem Data hunger and domain adaptation issues in self-supervised learning for temporal segmentation.
method Dynamic Graph Embedding (DGE) learns event representations by iteratively updating a graph and its embedding.
result DGE achieves robust temporal segmentation on benchmark datasets, outperforming state-of-the-art methods.
LOT framework speeds up event distance computation in collider physics.
problem Computational inefficiency in quantifying event distances.
method Linearized Optimal Transport (LOT) for efficient computation.
result LOT significantly reduces computational cost without sacrificing accuracy.
A new method estimates rare failure events in complex systems.
problem Estimating the probability of rare failure events in non-linear systems.
method Stochastic Spectral Embedding (SSE) combined with modifications for efficient rare event estimation.
result Rare failure probability decomposed into conditional probabilities for easier computation.
Study improves radio show segmentation using audio embeddings.
problem Automated segmentation of radio shows.
method Created audio embeddings from multi-class classification tasks on different datasets, evaluated performance against text-only baseline.
result Audio embeddings from non-speech sound event classification significantly outperformed text-only baseline by 32.3% in F1-measure.
Simple tabular event prediction model outperforms existing methods.
problem Predicting events from tabular data with historic events.
method Standard autoregressive LLM-style transformers with elementary positional embeddings and causal language modeling.
result Simple model outperforms existing approaches across various datasets and use-cases.
Develops a new framework for temporal anchoring in deep embedding spaces.
problem Temporal anchoring in deep embedding spaces, especially drift and convergence issues.
method Operator-theoretic framework with drift maps and event-indexed blocks, proving convergence theorems and equivalence theorems.
result Proves convergence theorems and equivalence theorems for the proposed framework.
Induction of common sense knowledge about prototypical sequences of events has recently received much attention. Instead of inducing this knowledge in the form of graphs, as in much of the previous work, in our method, distributed representations of event realizations are computed based on distributed representations o…
SELD-TCN improves sound event localization and detection efficiency.
problem Efficient sound event localization and detection on embedded hardware.
method Developed a novel temporal convolutional network (TCN) architecture.
result SELD-TCN outperforms state-of-the-art SELDnet on four datasets.
Predict stock movement with news headlines using BERT embeddings.
problem Predicting stock price movement after financial news.
method Fine-Tuned Contextualized-Embedding Recurrent Neural Network (FT-CE-RNN) using BERT.
result Obtains state-of-the-art results on stock movement prediction task.
The paper explores how control variates can reduce variance in Monte Carlo simulations, especially for Sobolev functions.
problem Efficiency of control variates in reducing variance for Monte Carlo simulations.
method Study of a specific quadrature rule using nonparametric regression-adjusted control variates.
result A specific quadrature rule can improve the Monte Carlo rate and achieve the minimax optimal rate under sufficient smoothness assumptions.
Paper uses DL and image embedding to classify power grid disturbances.
problem Classifying transient disturbances in power grids.
method Transformed time series data into images using Gramian Angular Field, then applied CNN and RNN for classification.
result DL algorithms outperform traditional data mining methods in power grid disturbance classification.
A new metric space model for point process excitations uncovers hidden interactions.
problem Estimating pairwise interactions in multivariate Hawkes processes is often infeasible.
method Developed a Hidden Hawkes Geometry (HHG) model to embed event types in a metric space.
result Learning the embedding reveals salient interactions in various applications.
Predict human lives using sequences of life events.
problem Predicting human life outcomes based on detailed event sequences.
method Adapting natural language processing techniques to analyze life events.
result Models predict diverse outcomes with high accuracy, outperforming state-of-the-art models.
PRAGMA models financial event sequences for various banking tasks.
problem Handling diverse financial data for multiple applications.
method Pre-training a Transformer model on a large banking event corpus with a self-supervised objective.
result PRAGMA achieves superior performance across multiple financial domains from raw event sequences.
Proposes a new framework to disentangle event influences in MTPP.
problem Underexplored how individual events influence overall dynamics over time.
method Decoupled MTPP framework using Neural Ordinary Differential Equations (Neural ODEs).
result Significantly improves performance on real-life datasets compared to state-of-the-art methods.
Paper explores multimodal methods for detecting urban micro-events.
problem Detecting urban micro-events in cities with limited geographical coverage.
method Exploring multimodal fusion methods including early, late, hybrid fusion and representation learning.
result Multimodal approach yields higher performance than unimodal alternatives.
Even in the absence of any explicit semantic annotation, vast collections of audio recordings provide valuable information for learning the categorical structure of sounds. We consider several class-agnostic semantic constraints that apply to unlabeled nonspeech audio: (i) noise and translations in time do not change t…
Recent progress in applying machine learning for jet physics has been built upon an analogy between calorimeters and images. In this work, we present a novel class of recursive neural networks built instead upon an analogy between QCD and natural languages. In the analogy, four-momenta are like words and the clustering…
The set N of all null geodesics of a globally hyperbolic (d+1)-dimensional spacetime (M,g) is naturally a smooth (2d-1)-dimensional contact manifold. The sky of an event is the subset of N defined by all null geodesics through that event, and is an embedded Legendrian submanifold of N diffeomorphic to a (d-1)-dimension…
Improved neural models for diverse user event sequences.
problem Challenges in modeling diverse user event sequences.
method Mixtures of latent embeddings with amortized variational inference.
result Systematic improvements over existing work for various predictive metrics.
PHASE predicts surgical complications from physiological signals.
problem Predicting adverse surgical outcomes from physiological signals.
method Self-supervised transfer learning for physiological signals.
result PHASE outperforms other approaches in predicting five surgical complications.
Paper detects important sub-events in disaster tweets.
problem Identifying useful information during large-scale disasters.
method Extract noun-verb pairs, learn semantic embeddings, rank and cluster.
result Effective unsupervised learning framework for sub-event detection.
SurvLatent ODE predicts VTE risk for cancer patients, outperforming current methods.
problem Predicting clinical outcomes from irregularly sampled EHR data with competing events.
method Neural ODE-based Recurrent Neural Networks (ODE-RNN) for flexible survival time estimation.
result SurvLatent ODE outperforms Khorana Risk scores for VTE risk prediction.
Visual analytics system for comparing medical records using sequence embeddings.
problem Challenges in analyzing medical records due to high dimensionality, irregularity, and sparsity.
method Event and sequence embeddings using autoencoder and self-attention mechanism, with sequence alignment for comparison.
result Demonstrated effectiveness with real-world neonatal ICU dataset.
Model traffic congestion events using multi-modal data and attention-based neural networks.
problem Capture non-homogeneous temporal and directional spatial dependencies in traffic congestion events.
method Attention-based neural networks for point processes, adapted tail-up model for spatial statistics.
result Superior performance compared to state-of-the-art methods on synthetic and real data.
PHINN: A generative model for rare-event time series using persistent homology
problem Generating rare events in time series
method Flow-matching framework with dynamic Betti curves and persistence landscape loss
result Outperforms statistical and diffusion baselines in topological fidelity and tail coverage
New models directly model inter-event times without intensity functions.
problem Learning temporal point processes with intensity-based approaches.
method Normalizing flows and mixture models for flexible and efficient modeling.
result Achieves state-of-the-art performance in prediction tasks.
Proposes COALA method for learning audio representations aligned with tags.
problem Lack of annotated data for high-performance audio representation learning.
method Aligns latent representations of audio and tags using a contrastive loss.
result Audio embedding model captures both acoustic and semantic characteristics.
Adaptive prediction timing improves healthcare outcomes by predicting patient events at the right frequency.
problem Inconsistent prediction granularity in healthcare models.
method Introduces a novel approach using Bayesian recurrent models and a new aggregation method to adapt prediction frequency based on uncertainty.
result Adaptive prediction timing leads to improved predictive performance, especially in the critical first 12 hours of patient stay.
Mining frequent sequential patterns consists in extracting recurrent behaviors, modeled as patterns, in a big sequence dataset. Such patterns inform about which events are frequently observed in sequences, i.e. what does really happen. Sometimes, knowing that some specific event does not happen is more informative than…
Liver transplant patients have a 25% chance of developing diabetes within 5 years.
problem Predicting new onset diabetes after liver transplant to improve patient care.
method Comparison of time-to-event prediction models and classifiers, including regularized Cox proportional-hazards model.
result Regularized Cox proportional-hazards model achieved high Concordance Index of 0.863.
Paper clusters event sequences using a reinforcement learning approach with policy mixture model.
problem Clustering event sequences with varying temporal patterns.
method Reinforcement learning with a policy mixture model, decomposing sequences into states and actions.
result Effective clustering of event sequences into underlying policies, outperforming existing methods.
Neural Spacetimes learn DAGs by embedding nodes in a spacetime manifold.
problem Learning representations of weighted directed acyclic graphs (DAGs).
method Trainable deep learning-based geometries (Neural Spacetimes) that encode both edge weights and causality.
result Universal embedding theorem for DAGs with sub-cubic parameters and low distortion.
The success of deep neural networks (DNNs) is heavily dependent on the availability of labeled data. However, obtaining labeled data is a big challenge in many real-world problems. In such scenarios, a DNN model can leverage labeled and unlabeled data from a related domain, but it has to deal with the shift in data dis…
Proposes a parsimonious graph spectral method for time series data.
problem Efficiently transmitting multivariate time series data.
method Graph spectral embedding with unsupervised, parsimonious encoding.
result Near-linear computational complexity and interpretable event structure.
Generative model for TPPs using signatures and distributional discrepancies.
problem Limitations of signature methods for TPPs and lack of global sequence-level loss in neural models.
method Introduce interarrival embedding to lift jump paths to continuous paths of bounded variation, enabling signature methods for discrete event sequences. Develop sigTPP, a signature-based generative model trained on path-level loss.
result sigTPP achieves the best average rank across multiple metrics and outperforms or is within a standard error of the strongest baseline in 64% of dataset-metric pairs.
Graph learning captures financial dynamics over time.
problem Understanding the evolving patterns in financial interactions.
method Graph Representation Learning applied to a dynamic financial graph.
result Captured latent trajectories reveal insights into economic events.
A new model captures complex event data using attention and Fourier kernels.
problem Capturing complex non-linear temporal dependencies in discrete event data.
method Integrates attention mechanism into point processes' conditional intensity function and uses Fourier kernel embedding.
result Established theoretical properties and demonstrated competitive performance.
The paper proposes a method to learn low-dimensional state embeddings from time series data.
problem Finding compact state embeddings from high-dimensional Markov state trajectories.
method The paper introduces a method based on diffusion maps to learn a low-dimensional state embedding and captures the dynamics of the process.
result The method reveals metastable structures in state clustering, providing sharp statistical error bounds and misclassification rates.
How can we effectively encode evolving information over dynamic graphs into low-dimensional representations? In this paper, we propose DyRep, an inductive deep representation learning framework that learns a set of functions to efficiently produce low-dimensional node embeddings that evolves over time. The learned embe…