arXiv (All)
open access
CT-Miner: Fast and Coarse-Grained Time-Series Pattern Mining via Cartesian Trees
Time series often contain recurring structural patterns, and efficiently mining such patterns into compact representations is essential for scalable analysis of long sequences. Cartesian tree (CT) equivalence provides a well-established structural abstraction that preserves hierarchical order struct
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
- Continuous Symmetry Discovery and Enforcement Using Vector Fields With Application to Time Series and Image Data#176211
- Archaeology Coursebook#1270941
- The archaeology coursebook#1271347
- Shape irregularity of Life-Like Network Automaton rules as an indicator of classification performance#1247794
- Continuous-Time Machine Learning: A Unified Mathematical Perspective#1122719
Record · ID 1201343
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