arXiv (All)
open access
Memory-Efficient Sequential Pattern Mining with Hybrid Tries
This paper develops a memory-efficient approach for Sequential Pattern Mining (SPM), a fundamental topic in knowledge discovery that faces a well-known memory bottleneck for large data sets. Our methodology involves a novel hybrid trie data structure that exploits recurring patterns to compactly sto
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Abstract-Driven Pattern Discovery In Databases#933345
- Patterns, Rules, and Inferences#775081
- A Fast Algorithm for Denumerants with Three Variables#131234
- Not Every Rubric Teaches Equally: Policy-Aware Rubric Rewards for RLVR#204815
- Graph Memory: Spectral Associative Memory via Dirichlet Energy#1116696
Record · ID 1216106
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive