Wiring diagram extraction and gluing: a case study in classifying figure skating jumps using 3D dataset
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.
| Authors | Jason Lo, Mohammadnima Jafari |
|---|---|
| Primary category | cs.AI |
| Published | 30 July 2026 |
| Last updated at source | 30 July 2026 |
Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.