Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
2024.Graph-based semi-supervised learning methods combine the graph structure and labeled data to classify unlabeled data. In this work, we study the effect of a noisy oracle on classification. In particular, we derive the maximum a posteriori (MAP) estimator for clustering a degree corrected stochastic block model when a noisy oracle reveals a fraction of the labels. We then propose an algorithm derived from a continuous relaxation of the MAP, and we establish its consistency. Numerical experiments show that our approach achieves promising performance on synthetic and real data sets, even in the case of very noisy labeled data.
Olivier Sauter, Alessandro Pau, Yoeri Renier Johannes Poels, Cristina Venturini
Zoë Holmes, Thanasilp Supanut, Giorgio Facelli, Weijie Xiong, Mehrad Sahebi
Cécile Hébert, Duncan Thomas Lindsay Alexander, Nathanaël Perraudin, Guillaume Romain Obozinski, Thomas Tim Holvoet