Image de couverture de livre

MOMENTI: Scalable Motif Mining in Multidimensional Time Series

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ceccarello, Matteo, Monaco, Francesco Pio, Silvestri, Francesco
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fair Center Clustering in Sliding Windows
par: Ceccarello, Matteo, et autres
Publié: (2025)

Differentially Private Release of Hierarchical Origin/Destination Data with a TopDown Approach
par: Boninsegna, Fabrizio, et autres
Publié: (2024)

Efficient Computation of Periods and Covers Using Sampling
par: Lecroq, Thierry, et autres
Publié: (2024)

Dimensionality Reduction on Complex Vector Spaces for Euclidean Distance with Dynamic Weights
par: Moretti, Simone, et autres
Publié: (2022)

Differentially Private High-Dimensional Approximate Range Counting, Revisited
par: Aumüller, Martin, et autres
Publié: (2024)

Scalable and Interpretable Identification of Minimal Undesignable RNA Structure Motifs with Rotational Invariance
par: Zhou, Tianshuo, et autres
Publié: (2024)

Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time
par: Eden, Talya, et autres
Publié: (2025)

How many users have been here for a long time? Efficient solutions for counting long aggregated visits
par: Afshani, Peyman, et autres
Publié: (2026)

Scalable Order-Preserving Pattern Mining
par: Li, Ling, et autres
Publié: (2024)

Scalable Temporal Motif Densest Subnetwork Discovery
par: Sarpe, Ilie, et autres
Publié: (2024)

Motiflets -- Simple and Accurate Detection of Motifs in Time Series
par: Schäfer, Patrick, et autres
Publié: (2022)

$Δ$-Motif: Parallel Subgraph Isomorphism via Tabular Operations
par: Wang, Yulun, et autres
Publié: (2025)

Resilient Pattern Mining
par: Bian, Pengxin, et autres
Publié: (2025)

Banana Trees for the Persistence in Time Series Experimentally
par: Ost, Lara, et autres
Publié: (2024)

Fine Grained Lower Bounds for Multidimensional Knapsack
par: Doron-Arad, Ilan, et autres
Publié: (2024)

Optimal Trajectories in Discrete Space with Acceleration Constraints
par: Casteigts, Arnaud, et autres
Publié: (2026)

qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem
par: Dhar, Saurav, et autres
Publié: (2024)

BAT-LZ Out of Hell
par: Lipták, Zsuzsanna, et autres
Publié: (2024)

A Textbook Solution for Dynamic Strings
par: Lipták, Zsuzsanna, et autres
Publié: (2024)

Suffix sorting via matching statistics
par: Lipták, Zsuzsanna, et autres
Publié: (2022)

TUCKET: A Tensor Time Series Data Structure for Efficient and Accurate Factor Analysis over Time Ranges
par: Qiu, Ruizhong, et autres
Publié: (2025)

Hyper-distance Oracles in Hypergraphs
par: Preti, Giulia, et autres
Publié: (2023)

Counting Permutation Patterns with Multidimensional Trees
par: Beniamini, Gal, et autres
Publié: (2024)

AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling
par: Lee, Seoyong, et autres
Publié: (2026)

The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees
par: Komoto, Kenta, et autres
Publié: (2026)

Scalable Distributed String Sorting
par: Kurpicz, Florian, et autres
Publié: (2024)

Contextual Pattern Mining and Counting
par: Li, Ling, et autres
Publié: (2025)

Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts
par: Peng, Pan, et autres
Publié: (2025)

Scalable Multilevel and Memetic Signed Graph Clustering
par: Hausberger, Felix, et autres
Publié: (2022)

Scalable $k$-clique Densest Subgraph Search
par: Ye, Xiaowei, et autres
Publié: (2024)

Scalable Algorithms for 2-Packing Sets on Arbitrary Graphs
par: Borowitz, Jannick, et autres
Publié: (2023)

Density-Dependent Graph Orientation and Coloring in Scalable MPC
par: Ghaffari, Mohsen, et autres
Publié: (2026)

An Almost-Optimal Upper Bound on the Push Number of the Torus Puzzle
par: Caporrella, Matteo, et autres
Publié: (2026)

Scalable Similarity Search over Large Attributed Bipartite Graphs
par: Ou, Xi, et autres
Publié: (2025)

Accurate and Fast Approximate Graph Pattern Mining at Scale
par: Arpaci-Dusseau, Anna, et autres
Publié: (2024)

Network Design on Undirected Series-Parallel Graphs
par: Bansal, Ishan, et autres
Publié: (2024)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
par: Fan, Zhuochen, et autres
Publié: (2024)

Dynamically Maintaining the Persistent Homology of Time Series
par: di Montesano, Sebastiano Cultrera, et autres
Publié: (2023)

Scalable Fair Influence Blocking Maximization via Approximately Monotonic Submodular Optimization
par: Fang, Qiangpeng, et autres
Publié: (2026)

Prefix-free parsing for merging big BWTs
par: Diaz-Dominguez, Diego, et autres
Publié: (2025)