Improved graph-based semi-supervised learning schemes

DOI10.1007/S40314-025-03482-7MaRDI QIDQ6871009zbMATH OpenFDO

Authors Farid Bozorgnia

Publication date 20 January 2026

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40314-025-03482-7

zbMATH Keywords

graph-based algorithmsLaplace learningsemi-supervised learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Artificial neural networks and deep learning (68T07)

Cites work

• Analysis of p-Laplacian regularization in semisupervised learning
• Graph-based semi-supervised learning
• Graph-based semi-supervised learning via improving the quality of the graph dynamically
• Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
• Properly-weighted graph Laplacian for semi-supervised learning
• The game theoretic p-Laplacian and semi-supervised learning with few labels

This page was built for publication: Improved graph-based semi-supervised learning schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6871009)