A topological approach for semi-supervised learning

被引:0
作者
Ines, A. [1 ]
Dominguez, C. [1 ]
Heras, J. [1 ]
Mata, G. [1 ]
Rubio, J. [1 ]
机构
[1] Univ La Rioja, Dept Math & Comp Sci, Logrono, Spain
关键词
Topological data analysis; Semi-supervised learning; Bottleneck distance; Wasserstein distance; Data connectivity; SUPPORT;
D O I
10.1016/j.jocs.2024.102403
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Nowadays, Machine Learning and Deep Learning methods have become the state-of-the-art approach to solve data classification tasks. In order to use those methods, it is necessary to acquire and label a considerable amount of data; however, this is not straightforward in some fields, since data annotation is time consuming and might require expert knowledge. This challenge can be tackled by means of semi-supervised learning methods that take advantage of both labelled and unlabelled data. In this work, we present new semi-supervised learning methods based on techniques from Topological Data Analysis (TDA). In particular, we have created two semi-supervised learning methods following two topological approaches. In the former, we have used a homological approach that consists in studying the persistence diagrams associated with the data using the bottleneck and Wasserstein distances. In the latter, we have considered the connectivity of the data. In addition, we have carried out a thorough analysis of the developed methods using 9 tabular datasets with low and high dimensionality. The results show that the developed semi-supervised methods outperform the results obtained with models trained with only manually labelled data, and are an alternative to other classical semi-supervised learning algorithms.
引用
收藏
页数:9
相关论文
共 40 条
[1]   No Free Lunch Theorem: A Review [J].
Adam, Stavros P. ;
Alexandropoulos, Stamatios-Aggelos N. ;
Pardalos, Panos M. ;
Vrahatis, Michael N. .
APPROXIMATION AND OPTIMIZATION: ALGORITHMS, COMPLEXITY AND APPLICATIONS, 2019, 145 :57-82
[2]  
[Anonymous], 2002, LEARNING LABELED UNL
[3]   Deep Learning for AI [J].
Bengio, Yoshua ;
Lecun, Yann ;
Hinton, Geoffrey .
COMMUNICATIONS OF THE ACM, 2021, 64 (07) :58-65
[4]  
Berthelot D, 2019, ADV NEUR IN, V32
[5]  
Blum A., 1998, Proceedings of the Eleventh Annual Conference on Computational Learning Theory, P92, DOI 10.1145/279943.279962
[6]  
CORTES C, 1995, MACH LEARN, V20, P273, DOI 10.1023/A:1022627411411
[7]  
Dua Dheeru, 2017, UCI machine learning repository
[8]  
Edelsbrunner H, 2000, ANN IEEE SYMP FOUND, P454
[9]  
Edelsbrunner H., 2010, Computational Topology. An Introduction
[10]   Geometry helps in bottleneck matching and related problems [J].
Efrat, A ;
Itai, A ;
Katz, MJ .
ALGORITHMICA, 2001, 31 (01) :1-28