Efficiently Sampling Interval Patterns from Numerical Databases

• URL: http://arxiv.org/abs/2512.00105v1
• Date: Thu, 27 Nov 2025 10:35:17 GMT
• Title: Efficiently Sampling Interval Patterns from Numerical Databases
• Abstract summary: This paper presents the first sampling approach designed to handle interval patterns in numerical databases.<n>It uses a multi-step sampling procedure and addresses a key challenge in numerical data: accurately determining the number of interval patterns that cover each object.<n>We extend this work with HFips, which samples interval patterns proportionally to both their frequency and hyper-volume.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Pattern sampling has emerged as a promising approach for information discovery in large databases, allowing analysts to focus on a manageable subset of patterns. In this approach, patterns are randomly drawn based on an interestingness measure, such as frequency or hyper-volume. This paper presents the first sampling approach designed to handle interval patterns in numerical databases. This approach, named Fips, samples interval patterns proportionally to their frequency. It uses a multi-step sampling procedure and addresses a key challenge in numerical data: accurately determining the number of interval patterns that cover each object. We extend this work with HFips, which samples interval patterns proportionally to both their frequency and hyper-volume. These methods efficiently tackle the well-known long-tail phenomenon in pattern sampling. We formally prove that Fips and HFips sample interval patterns in proportion to their frequency and the product of hyper-volume and frequency, respectively. Through experiments on several databases, we demonstrate the quality of the obtained patterns and their robustness against the long-tail phenomenon.

Related papers

• Frequency-based Constrained Sampling for Interval Patterns [0.0]
  We introduce CFips, a sampling approach that incorporates constraints directly into the sampling procedure.<n>We prove that CFips samples interval patterns proportionally to their frequency within the constrained pattern space.
  arXiv  Detail & Related papers  (2026-06-08T15:49:18Z)
• Efficiently Generating Correlated Sample Paths from Multi-step Time Series Foundation Models [66.60042743462175]
  We present a copula-based approach to efficiently generate accurate, correlated sample paths from time series foundation models.<n>Our approach generates correlated sample paths orders of magnitude faster than autoregressive sampling.
  arXiv  Detail & Related papers  (2025-10-02T17:08:58Z)
• Stationarity Exploration for Multivariate Time Series Forecasting [16.66747488602513]
  We propose a simple yet effective Amplitude-Phase Reconstruct Network (APRNet)<n>APRNet models the inter-relationships of amplitude and phase, which prevents the amplitude and phase from being constrained by different physical quantities.<n>We propose a novel Kolmogorov-Arnold-Network-based Local Correlation (KLC) module to adaptively fit local functions.
  arXiv  Detail & Related papers  (2025-08-12T13:15:51Z)
• LSCD: Lomb-Scargle Conditioned Diffusion for Time series Imputation [55.800319453296886]
  Time series with missing or irregularly sampled data are a persistent challenge in machine learning.<n>We introduce a different Lombiable--Scargle layer that enables a reliable computation of the power spectrum of irregularly sampled data.
  arXiv  Detail & Related papers  (2025-06-20T14:48:42Z)
• Convergence Of Consistency Model With Multistep Sampling Under General Data Assumptions [11.317363635566517]
  We study the convergence of consistency models when the self-consistency property holds approximately under the training distribution.<n>Our analysis requires only mild data assumption and applies to a family of forward processes.
  arXiv  Detail & Related papers  (2025-05-06T05:31:10Z)
• MFRS: A Multi-Frequency Reference Series Approach to Scalable and Accurate Time-Series Forecasting [51.94256702463408]
  Time series predictability is derived from periodic characteristics at different frequencies.<n>We propose a novel time series forecasting method based on multi-frequency reference series correlation analysis.<n> Experiments on major open and synthetic datasets show state-of-the-art performance.
  arXiv  Detail & Related papers  (2025-03-11T11:40:14Z)
• Enhancing Foundation Models for Time Series Forecasting via Wavelet-based Tokenization [74.3339999119713]
  We develop a wavelet-based tokenizer that allows models to learn complex representations directly in the space of time-localized frequencies.<n>Our method first scales and decomposes the input time series, then thresholds and quantizes the wavelet coefficients, and finally pre-trains an autoregressive model to forecast coefficients for the forecast horizon.
  arXiv  Detail & Related papers  (2024-12-06T18:22:59Z)
• Moirai-MoE: Empowering Time Series Foundation Models with Sparse Mixture of Experts [103.725112190618]
  This paper introduces Moirai-MoE, using a single input/output projection layer while delegating the modeling of diverse time series patterns to the sparse mixture of experts. Extensive experiments on 39 datasets demonstrate the superiority of Moirai-MoE over existing foundation models in both in-distribution and zero-shot scenarios.
  arXiv  Detail & Related papers  (2024-10-14T13:01:11Z)
• Stable generative modeling using Schrödinger bridges [0.22499166814992438]
  We propose a generative model combining Schr"odinger bridges and Langevin dynamics. Our framework can be naturally extended to generate conditional samples and to Bayesian inference problems.
  arXiv  Detail & Related papers  (2024-01-09T06:15:45Z)
• Time Series Anomaly Detection by Cumulative Radon Features [32.36217153362305]
  In this work, we argue that shallow features suffice when combined with distribution distance measures. Our approach models each time series as a high dimensional empirical distribution of features, where each time-point constitutes a single sample. We show that by parameterizing each time series using cumulative Radon features, we are able to efficiently and effectively model the distribution of normal time series.
  arXiv  Detail & Related papers  (2022-02-08T18:58:53Z)
• AutoSampling: Search for Effective Data Sampling Schedules [118.20014773014671]
  We propose an AutoSampling method to automatically learn sampling schedules for model training. We apply our method to a variety of image classification tasks illustrating the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2021-05-28T09:39:41Z)
• Multi-Time Attention Networks for Irregularly Sampled Time Series [18.224344440110862]
  Irregular sampling occurs in many time series modeling applications. We propose a new deep learning framework for this setting that we call Multi-Time Attention Networks. Our results show that our approach performs as well or better than a range of baseline and recently proposed models.
  arXiv  Detail & Related papers  (2021-01-25T18:57:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.