MCBP detects boundaries by computing discrete mean curvature from k-nearest neighbor patches on the data manifold, then decomposes data into low-curvature smooth and high-curvature boundary subsets to improve clustering.
Visual Differential Geometry and Forms: A Mathematical Drama in Five Acts
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LG 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
GTSA-PCA replaces global PCA covariance with curvature-weighted local operators and a geodesic alignment step to produce geometry-aware embeddings that improve on standard PCA and UMAP in small-sample high-curvature settings.
citing papers explorer
-
A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning
MCBP detects boundaries by computing discrete mean curvature from k-nearest neighbor patches on the data manifold, then decomposes data into low-curvature smooth and high-curvature boundary subsets to improve clustering.
-
Curvature-Aware PCA with Geodesic Tangent Space Aggregation for Semi-Supervised Learning
GTSA-PCA replaces global PCA covariance with curvature-weighted local operators and a geodesic alignment step to produce geometry-aware embeddings that improve on standard PCA and UMAP in small-sample high-curvature settings.