Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.23766 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911344632004608 |
|---|---|
| author | Salta, Karim Kirby, Michael Peterson, Chris |
| author_facet | Salta, Karim Kirby, Michael Peterson, Chris |
| contents | In many classification and clustering tasks, it is useful to compute a geometric representative for a dataset or a cluster, such as a mean or median. When datasets are represented by subspaces, these representatives become points on the Grassmann or flag manifold, with distances induced by their geometry, often via principal angles. We introduce a subspace clustering algorithm that replaces subspace means with a trainable prototype defined as a Schubert Variety of Best Fit (SVBF) - a subspace that comes as close as possible to intersecting each cluster member in at least one fixed direction. Integrated in the Linde-Buzo-Grey (LBG) pipeline, this SVBF-LBG scheme yields improved cluster purity on synthetic, image, spectral, and video action data, while retaining the mathematical structure required for downstream analysis. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_23766 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Granular Grassmannian Clustering Framework via the Schubert Variety of Best Fit Salta, Karim Kirby, Michael Peterson, Chris Machine Learning Computational Geometry Computer Vision and Pattern Recognition Distributed, Parallel, and Cluster Computing 68T10, 62H30, 65K10 I.5.3; I.5.1; G.1.6 In many classification and clustering tasks, it is useful to compute a geometric representative for a dataset or a cluster, such as a mean or median. When datasets are represented by subspaces, these representatives become points on the Grassmann or flag manifold, with distances induced by their geometry, often via principal angles. We introduce a subspace clustering algorithm that replaces subspace means with a trainable prototype defined as a Schubert Variety of Best Fit (SVBF) - a subspace that comes as close as possible to intersecting each cluster member in at least one fixed direction. Integrated in the Linde-Buzo-Grey (LBG) pipeline, this SVBF-LBG scheme yields improved cluster purity on synthetic, image, spectral, and video action data, while retaining the mathematical structure required for downstream analysis. |
| title | A Granular Grassmannian Clustering Framework via the Schubert Variety of Best Fit |
| topic | Machine Learning Computational Geometry Computer Vision and Pattern Recognition Distributed, Parallel, and Cluster Computing 68T10, 62H30, 65K10 I.5.3; I.5.1; G.1.6 |
| url | https://arxiv.org/abs/2512.23766 |