Applications
Wiring diagram extraction and gluing: a case study in classifying figure skating jumps using 3D dataset
arXiv:2607.27598v1 Announce Type: cross Abstract: Hasse clustering is an algorithm that extracts common patterns in sequential data and represents them in graphical forms. As the number of expected cl
arXiv:2607.27598v1 Announce Type: cross Abstract: Hasse clustering is an algorithm that extracts common patterns in sequential data and represents them in graphical forms. As the number of expected clusters grows, however, the algorithm can become infeasible to run due to combinatorial complexity. In this article, we describe a theory of gluing wiring diagrams, allowing iterative applications of Hasse clustering to achieve the same result as a single application. We test our theory in the context of classifying videos of figure skating jumps.
Related
- Automated regime classification in multidimensional time series data using sliced Wasserstein k-means clustering
- Improving Hospital Process Management through Process Mining: A Case Study on COVID-19 Clinical Pathways
- Global Sequential Testing for Multi-Stream Auditing
- Improving Patient Subtyping on Longitudinal Data using Representations from Mamba-based Architecture
Source: arXiv cs.LG | 2026-07-31