NegPSpan extracts negative sequential patterns efficiently.
problem Mining negative sequential patterns in sequence datasets.
method PrefixSpan depth-first scheme with maxgap constraints.
result NegPSpan extracts meaningful negative sequential patterns.
Recent sequential pattern mining methods have used the minimum description length (MDL) principle to define an encoding scheme which describes an algorithm for mining the most compressing patterns in a database. We present a novel subsequence interleaving model based on a probabilistic model of the sequence database, w…
This paper presents a framework for exact discovery of the top-k sequential patterns under Leverage. It combines (1) a novel definition of the expected support for a sequential pattern - a concept on which most interestingness measures directly rely - with (2) SkOPUS: a new branch-and-bound algorithm for the exact disc…
The study compares ASP encodings for sequential pattern mining tasks.
problem Efficiency of Answer Set Programming (ASP) encodings for sequential pattern mining.
method Two representations of embeddings (fill-gaps vs skip-gaps) and various types of patterns were tested.
result Fill-gaps strategy is more efficient on real problems due to lower memory consumption.
A new framework for mining high utility patterns in interval-based sequences.
problem Mining patterns in events that persist over varying time intervals and considering event utility.
method Integrates utility into interval-based sequences and proposes HUIPMiner algorithm with pruning strategy.
result HUIPMiner efficiently finds high utility patterns in real datasets.
EvoRate metric assesses learnability of sequential data by measuring predictive information.
problem Model misspecification due to misinterpreting patterns in sequential data.
method Predictive information framework based on mutual information between past and future.
result Temporal patterns fundamentally constrain learnability; optimal predictors cannot outperform intrinsic information limit.
BN^2MF identifies unknown exposure patterns in environmental mixtures.
problem Identifying unknown exposure patterns in environmental mixtures.
method Bayesian non-parametric non-negative matrix factorization (BN^2MF) with non-negative continuous priors and a non-parametric sparse prior.
result Estimates patterns of chemical exposures without specifying the number of patterns.
Paper discovers shifting patterns in sequence classification and proposes a method to improve performance.
problem Discriminative patterns in sequential data are time-dependent and degrade traditional classification methods.
method Proposes a novel sequence classification method using multi-instance learning and LSTM models to detect and model shifting patterns.
result Demonstrates superior sequence classification performance and detection of shifting patterns in cropland mapping and affective state recognition.
Method detects multi-timescale consumer spending patterns from receipts.
problem Understanding and managing consumer behavior in high-dimensional data.
method Non-negative tensor factorization (NTF) to extract multi-timescale expenditure patterns.
result Consumption patterns are characterized based on spending behavior over different timescales.
HYPA-DBGNN detects anomalous sequential patterns in temporal graphs.
problem Modeling temporal patterns in dynamic graphs, especially considering deviations from random shuffling.
method Two-step approach combining null model inference and neural message passing.
result HYPA-DBGNN outperforms baseline methods in static node classification tasks.
We introduce two types of ordinal pattern dependence between time series. Positive (resp. negative) ordinal pattern dependence can be seen as a non-paramatric and in particular non-linear counterpart to positive (resp. negative) correlation. We show in an explorative study that both types of this dependence show up in …
This review assesses deep-learning methods for complex sequential data.
problem Lack of robustness and transparency in deep-learning frameworks for irregular sequential data.
method Systematic literature review of existing algorithms.
result Recurrent neural networks dominate in performance evaluation of deep-learning frameworks.
TraLFM models human mobility patterns from traffic trajectories.
problem Understanding human mobility patterns from traffic data.
method Latent factor modeling of sequential, personal, and temporal factors.
result TraLFM significantly outperforms state-of-the-art methods in latent factor analysis and next location prediction.
New method reduces state redundancy in HSMM for driving patterns.
problem Overestimation of states in HSMM models.
method Robust HDP-HSMM (rHDP-HSMM) method to reduce redundant states.
result Improved consistency and accurate inference of driving maneuvers.
Method predicts spatio-temporal patterns varying by region.
problem Predicting spatio-temporal processes with varying temporal patterns across regions.
method Localized spatio-temporal covariance model and sequential covariance fitting.
result Accurately predicts missing data in spatial regions over time.
Proposes OC4Seq for detecting anomalies in discrete event sequences.
problem Challenges in detecting anomalies in discrete event sequences, including data imbalance, discrete events, and sequential nature.
method Integrates anomaly detection with recurrent neural networks (RNNs) to embed sequences into latent spaces and designs a multi-scale RNN framework to capture multi-scale sequential patterns.
result OC4Seq consistently outperforms various baselines on three benchmark datasets.
MEANTIME improves sequential recommendation by using multi-temporal embeddings and attention mechanisms.
problem Limited use of timestamp information and information bottleneck in sequential recommendation models.
method MEANTIME employs multiple types of temporal embeddings and attention mechanisms to capture diverse patterns from user behavior sequences.
result MEANTIME outperforms state-of-the-art sequential recommendation methods.
The paper proposes a new method to improve microcredit decisions by modeling sequential loan interactions.
problem Improving microcredit decision-making by addressing population bias and model generalization.
method The authors introduce a multi-stage interaction sequence (MSIS) method that models sequential loan interactions and uses a hierarchical attention module to leverage interaction information.
result The MSIS method effectively remedies population bias and improves model generalization on a real loan data set.
New method learns from either positive or negative feedback alone.
problem Limited applicability of existing preference optimization methods in scenarios with only unpaired feedback.
method Decouples learning from positive and negative feedback, using expectation-maximization (EM) to optimize probability of positive outcomes and explicitly incorporate negative examples.
result Stable learning from negative feedback alone demonstrated.
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.
Study uses NMF to analyze multimorbidity patterns in large EHR dataset.
problem Understanding and quantifying multimorbidity patterns over time.
method Non-negative Matrix Factorisation (NMF) for temporal phenotyping.
result Temporal characteristics of disease clusters reveal new multimorbidity patterns.
Study uses machine learning to detect sleep disorders by identifying brain patterns.
problem Detecting sleep disorders through EEG patterns in NREM sleep cycles.
method Feature engineering and machine learning model for predicting Cyclic Alternating Patterns (CAP).
result The model accurately predicts CAP sequences associated with sleep disorders.
PSEUDo learns patterns in multivariate time series with locality-sensitive hashing and relevance feedback.
problem Efficient pattern detection in large, multi-track sequential data with high variance and lack of ground truth.
method Query-aware locality-sensitive hashing for feature learning, sub-linear training and inference time.
result PSEUDo achieves sub-linear time efficiency for pattern modeling and comparison of 10,000 multivariate time series.
SANST uses self-attentive networks with spatial and temporal embeddings for better POI recommendations.
problem Next point-of-interest (POI) recommendation for users based on their history.
method SANST incorporates spatio-temporal patterns into self-attentive networks.
result SANST outperforms state-of-the-art models by up to 13.65% in nDCG@10.
Proposes a novel method for generating hard negatives near time series data boundaries.
problem Challenges in generating effective negative samples for time series anomaly detection.
method Reconstruction-driven boundary negative generation framework using reinforcement learning.
result Improves anomaly representation learning and achieves competitive detection performance.
Tree-based LSTM improves sequential regression with missing data.
problem Regression for variable-length sequential data with missing samples.
method Tree architecture of LSTM networks, selecting LSTM networks based on presence-pattern of previous inputs.
result Significant performance improvements on financial and real-life datasets.
A textbook on machine learning explaining patterns, predictions, and actions.
problem Understanding patterns in data for predictions and actions.
method Explains foundations of decision making, representation, optimization, and generalization.
result Equips readers with tools to reason about actions and their consequences.
Proposes a method to integrate learner models robustly against misspecifications.
problem Misspecifications in learner models and parameter sharing patterns degrade prediction accuracy.
method Sequentially incorporates additional learners based on user-specified parameter sharing patterns.
result Data-adaptively selects the most suitable way of parameter sharing to enhance predictive performance.
Adaptive RNN using mixture layer for multi-pattern sequences.
problem Inadequate RNN performance on sequences with multiple patterns.
method Introducing a mixture layer to partition and store prototype vectors, enabling adaptive state updates.
result M-RNN outperforms traditional RNN in assimilating sequences with multiple patterns.
Paper proposes a new HMM approach for better action recognition.
problem Capturing complex temporal dependency patterns in skeleton-based actions.
method Introduces a hierarchical HMM with a latent variable layer for dynamic inference.
result Proposed approach effectively models complex sequential data and handles missing values.
The paper improves SVR with linear constraints for better model properties.
problem Improving Support Vector Regression with linear constraints.
method Generalized SMO algorithm for solving optimization with linear constraints.
result The proposed method shows better practical performance on various datasets.
Random geodesics on curved surfaces form a pattern similar to random lines.
problem Understanding the geometry of random paths on curved surfaces.
method Scaling and analysis of tessellations induced by long geodesics.
result The global statistics of tessellations approach those of a Poisson line process.
Stock markets show unusual overnight and intraday returns.
problem Unusual patterns of overnight and intraday returns in stock markets.
method Analyzed features of the returns to deduce the cause.
result The only plausible explanation for these returns is that they are due to market manipulation.
We consider and extend the adversarial agent-based learning approach of Gy{ö}rfi {\it et al} to the situation of zero-cost portfolio selection implemented with a quadratic approximation derived from the mutual fund separation theorems. The algorithm is applied to daily sampled sequential Open-High-Low-Close data and se…
The classification procedure of streaming data usually requires various ad hoc methods or particular heuristic models. We explore a novel non-parametric and systematic approach to analysis of heterogeneous sequential data. We demonstrate an application of this method to classification of the delays in responding to the…
Paper explores folding patterns of curved creases preserving their geometric properties.
problem Investigating rigid-ruling folding motions of curved crease-rule patterns.
method Deriving conditions for rigid-ruling foldability and analyzing combinations of creases.
result Constant fold-angle creases are only compatible with other constant fold-angle creases.
Modeling and estimating dynamic graphs from binary pattern sequences.
problem Extracting dominant correlation structures from time-dependent binary patterns.
method State-space model of an Ising-type network composed of multiple undirected graphs, sequential Bayes algorithm.
result The method outperforms traditional methods in uncovering overlapping graphs and estimating dynamics of weights.
The paper integrates statistical significance and discriminative power in pattern discovery.
problem Discovering actionable patterns that meet rigorous statistical significance and discriminative power criteria.
method Integrates statistical significance and discriminative power criteria into state-of-the-art algorithms.
result Improves discriminative power and statistical significance of discovered patterns without quality deterioration.
Podcast recommendations improved by analyzing user listening paths.
problem Challenges in recommending podcasts effectively.
method Analyzes user listening paths as sequential trajectories for recommendations.
result 450% increase in effectiveness over baseline.
Optimal transport kernels improve neural architecture search efficiency.
problem Comparing complex neural architectures similarity using Euclidean metric fails.
method Developed a novel discrepancy using tree-Wasserstein (TW) for neural architectures.
result TW-based approaches outperform other methods in sequential and parallel NAS.
New method embeds time span into self-attention for better temporal pattern recognition.
problem Capturing temporal patterns in event sequences without recurrent networks.
method Functional time representation learning with Bochner's and Mercer's Theorems.
result Proposed methods outperform baseline models in various continuous-time event sequence prediction tasks.
Estimates LRD in sequential data, improving RNNs.
problem Quantifying LRD in sequential data for better RNNs.
method Principled estimation procedure based on LRD theory for real-valued time series.
result Estimates LRD reliably in user behavior and Wikipedia article writing.
Based on the Log-Periodic Power Law (LPPL) methodology, with the universal preferred scaling factor λ≈2, the negative bubble on the oil market in 2014-2016 has been detected. Over the same period a positive bubble on the so called commodity currencies expressed in terms of the US dollar appears to take place w…
RotatE embeds knowledge graphs using rotations in complex space for better link prediction.
problem Predicting missing links in knowledge graphs.
method RotatE models relations as rotations in complex vector space, using self-adversarial negative sampling.
result RotatE models and infers various relation patterns, outperforming existing models.
SANS uses graph structure to find meaningful negatives for entity and relation embeddings.
problem Finding hard negatives for entity and relation embeddings in knowledge graphs.
method Structure Aware Negative Sampling (SANS) that selects negatives from a node's k-hop neighborhood.
result SANS finds semantically meaningful negatives and is competitive with state-of-the-art approaches.
A CNN-based model improves stock price prediction accuracy.
problem Overfitting in image-based stock prediction models.
method SMSFR-CNN combining CNN and image features.
result SMSFR-CNN achieves high predictive accuracy on A-share stocks.
A new matrix factorization method for high-dimensional data.
problem Exploiting sparse structures in complex data for better interpretability.
method Bayesian shrinkage priors and flexible sparse patterns modeled through row and column dependencies.
result Demonstrated practical advantages through simulation and soccer heatmap analysis.
Develops scalable model for learning velocity fields in complex traffic scenarios.
problem Learning heterogeneous and dynamic velocity fields in complex traffic scenarios.
method Nonparametric Bayesian modeling with hierarchical Dirichlet process and infinite hidden Markov model, Gaussian process prior, and scalable approximate inference.
result Demonstrates effective scalability and applicability to real-world traffic data.