mlsanityData to 7 Oct 2026

A new classification method based on Minimum Spanning Trees

arXiv 2606.21639 ↗First posted 19 Jun 2026cs.LG stat.ME stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Minimum Spanning Trees have been used in unsupervised learning, particularly in clustering tasks, due to their ability to recognize clusters by removing edges that are considered inconsistent in defining those clusters. This paper aims to study the use of Minimum Spanning Trees in supervised learning. Specifically, we propose a classification algorithm based on Minimum Spanning Trees. To improve its performance, we introduce a robust version of the method that is also computationally more efficient. We evaluate the effectiveness of our proposed method through an extensive simulation study. We also apply the proposed methodology to a real-world case study involving aircraft trajectories.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 2 of its 18 references that are in the map. First posted on arXiv 19 Jun 2026.

Builds on

2 of 18 references.

References · 2

  1. 2023Clustering with minimum spanning trees: How good can it be?cited by 4
  2. 2025Complex Networks for Pattern-Based Data Classificationcited by 1

Built on by

Not cited yet.