Sign inGet started
Paper · arXiv

High-dimensional Semi-supervised Classification via the Fermat Distance

Semi-supervised classification, where unlabeled data are massive but labeled data are limited, often arises in machine learning applications. We address this challenge under high-dimensional data by leveraging the manifold and cluster assumptions. Based on the Fermat distance, a density-sensitive metric that naturally encodes the cluster assumption, we propose the weighted $k$-nearest neighbors (NN) classifier and multidimensional scaling (MDS)-induced classifiers. The use of MDS with a large target dimension allows the effective application of linear classifiers to complex manifold data. Theoretically, we derive a sharp lower bound for the expected excess risk within clusters and prove t...

AuthorsRuoxu Tan, Yiming Zang
Primary categorystat.ML
Published26 April 2026
Last updated at source26 April 2026
stat.MLcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/e9673bbe-cf49-4c8e-ab54-ccb7c129af9e" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

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.