Almost exact recovery in label spreading

DOI10.1007/978-3-030-25070-6_3MaRDI QIDQ6154908zbMATH OpenFDO

Authors Konstantin Avrachenkov, Maximilien Dreveton

Publication date 16 February 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-25070-6_3

zbMATH Keywords

community detectionlabel spreadingrandom graphssemi-supervised clusteringstochastic block model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Internet topics (68M11) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Global and local information in clustering labeled block models
• Learning Theory
• On semi-supervised learning
• Strong consistency, graph Laplacians, and the stochastic block model
• On the consistency of graph-based Bayesian semi-supervised learning and the scalability of sampling algorithms

Cited in

(1)

• Almost exact recovery in noisy semi-supervised learning

This page was built for publication: Almost exact recovery in label spreading

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