Graph-Based Semi-Supervised Segregated Lipschitz Learning
It addresses class imbalance and label propagation in semi-supervised learning, which is an incremental advancement for machine learning applications.
This paper tackles the problem of semi-supervised classification with limited labeled data by developing a graph-based framework using the infinity Laplacian and spatial segregation theory. The method improves classification accuracy on benchmark datasets compared to existing approaches.
This paper presents an approach to semi-supervised learning for the classification of data using the Lipschitz Learning on graphs. We develop a graph-based semi-supervised learning framework that leverages the properties of the infinity Laplacian to propagate labels in a dataset where only a few samples are labeled. By extending the theory of spatial segregation from the Laplace operator to the infinity Laplace operator, both in continuum and discrete settings, our approach provides a robust method for dealing with class imbalance, a common challenge in machine learning. Experimental validation on several benchmark datasets demonstrates that our method not only improves classification accuracy compared to existing methods but also ensures efficient label propagation in scenarios with limited labeled data.