Improving semi-supervised learning through optimum connectivity

doi:10.1016/j.patcog.2016.04.020

Return

Improving semi-supervised learning through optimum connectivity

2016-12-01

Willian Paraguassu Amorim

Alexandre X. Falcão *

João Paulo Papa

Marcelo H. de Carvalho

DOI：10.1016/j.patcog.2016.04.020

Original

Save

View PDF

Abstract

En 中文

The annotation of large data sets by a classifier is a problem whose challenge increases as the number of labeled samples used to train the classifier reduces in comparison to the number of unlabeled samples. In this context, semi-supervised learning methods aim at discovering and labeling informative samples among the unlabeled ones, such that their addition to the correct class in the training set can improve classification performance. We present a semi-supervised learning approach that connects unlabeled and labeled samples as nodes of a minimum-spanning tree and partitions the tree into an optimum-path forest rooted at the labeled nodes. It is suitable when most samples from a same class are more closely connected through sequences of nearby samples than samples from distinct classes, which is usually the case in data sets with a reasonable relation between number of samples and feature space dimension. The proposed solution is validated by using several data sets and state-of-the-art methods as baselines. (C) 2016 Elsevier Ltd. All rights reserved.

Keywords:

Semi-supervised learning

Optimum-path forest classifiers

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.