Imagen de Portada

Memory-Efficient Sequential Pattern Mining with Hybrid Tries

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Hosseininasab, Amin, van Hoeve, Willem-Jan, Cire, Andre A.
Formato:	Preprint
Publicado:	2022
Materias:	Databases Artificial Intelligence Data Structures and Algorithms Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Motiflets -- Simple and Accurate Detection of Motifs in Time Series
por: Schäfer, Patrick, et al.
Publicado: (2022)

TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
por: Zandieh, Amir, et al.
Publicado: (2025)

SubGen: Token Generation in Sublinear Time and Memory
por: Zandieh, Amir, et al.
Publicado: (2024)

Contextual Pattern Mining and Counting
por: Li, Ling, et al.
Publicado: (2025)

COL-Trees: Efficient Hierarchical Object Search in Road Networks
por: Abeywickrama, Tenindra, et al.
Publicado: (2026)

Scalable Order-Preserving Pattern Mining
por: Li, Ling, et al.
Publicado: (2024)

Online Learning with Probing for Sequential User-Centric Selection
por: Xu, Tianyi, et al.
Publicado: (2025)

On Language Generation in the Limit with Bounded Memory
por: Kleinberg, Jon, et al.
Publicado: (2026)

B+ANN: A Fast Billion-Scale Disk-based Nearest-Neighbor Index
por: Tekin, Selim Furkan, et al.
Publicado: (2025)

Daisy Bloom Filters
por: Bercea, Ioana O., et al.
Publicado: (2022)

Matrix Product Sketching via Coordinated Sampling
por: Daliri, Majid, et al.
Publicado: (2025)

Dynamic Data Layout Optimization with Worst-case Guarantees
por: Rong, Kexin, et al.
Publicado: (2024)

Dynamic data summarization for hierarchical spatial clustering
por: Abduaziz, Kayumov, et al.
Publicado: (2024)

Optimal Matrix Sketching over Sliding Windows
por: Yin, Hanyan, et al.
Publicado: (2024)

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
por: Lee, Changyeol, et al.
Publicado: (2025)

Learned Static Function Data Structures
por: Hermann, Stefan, et al.
Publicado: (2025)

Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
por: Guan, Xinyu, et al.
Publicado: (2025)

Probabilistic Kernel Function for Fast Angle Testing
por: Lu, Kejing, et al.
Publicado: (2025)

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
por: Lu, Kejing, et al.
Publicado: (2024)

Efficient Detection of Commutative Factors in Factor Graphs
por: Luttermann, Malte, et al.
Publicado: (2024)

Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
por: Li, Dongyue, et al.
Publicado: (2025)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
por: Song, Siwoo, et al.
Publicado: (2025)

Changing Base Without Losing Pace: A GPU-Efficient Alternative to MatMul in DNNs
por: Ailon, Nir, et al.
Publicado: (2025)

Optimal Survival Trees: A Dynamic Programming Approach
por: Huisman, Tim, et al.
Publicado: (2024)

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
por: Liao, Meihao, et al.
Publicado: (2025)

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
por: Brita, Catalin E., et al.
Publicado: (2025)

Approximate Lifted Model Construction
por: Luttermann, Malte, et al.
Publicado: (2025)

BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs
por: Najafi, Mohammad Matin, et al.
Publicado: (2025)

Text Indexing for Long Patterns using Locally Consistent Anchors
por: Ayad, Lorraine A. K., et al.
Publicado: (2024)

Efficient Diffusion Models for Symmetric Manifolds
por: Mangoubi, Oren, et al.
Publicado: (2025)

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs
por: Wienöbst, Marcel, et al.
Publicado: (2022)

A Fair and Memory/Time-efficient Hashmap
por: Asudeh, Abolfazl, et al.
Publicado: (2023)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
por: De Man, Quinten, et al.
Publicado: (2026)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
por: Yang, Huihui, et al.
Publicado: (2025)

AlgoSelect: Universal Algorithm Selection via the Comb Operator
por: Yao, Jasper
Publicado: (2025)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
por: de Wynter, Adrian
Publicado: (2020)

Streaming Attention Approximation via Discrepancy Theory
por: Kochetkova, Ekaterina, et al.
Publicado: (2025)

Discovering Data Structures: Nearest Neighbor Search and Beyond
por: Salemohamed, Omar, et al.
Publicado: (2024)

OpenTensor: Reproducing Faster Matrix Multiplication Discovering Algorithms
por: Sun, Yiwen, et al.
Publicado: (2024)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
por: Pedramfar, Mohammad, et al.
Publicado: (2023)