pith. sign in

arxiv: 2606.21639 · v1 · pith:45ZPSF6Dnew · submitted 2026-06-19 · 💻 cs.LG · stat.ME· stat.ML

A new classification method based on Minimum Spanning Trees

classification 💻 cs.LG stat.MEstat.ML
keywords minimumspanningtreesmethodclassificationclusterslearningproposed
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.