Empirical Comparison of “Hard” and “Soft” Label Propagation for Relational Classification

DOI10.1007/978-3-540-78469-2_13MaRDI QIDQ5452084zbMATH OpenOpenAlexFDO

Authors Aram Galstyan, Paul R. Cohen

Publication date 28 March 2008

Published in Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78469-2_13

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A note on label propagation for semi-supervised learning
• Single network relational transductive learning
• Graph-based semi-supervised learning by mixed label propagation with a soft constraint
• Ensembles of relational classifiers
• Inductive Logic Programming

Cited in

(1)

• Hard-label cryptanalytic extraction of neural network models

This page was built for publication: Empirical Comparison of “Hard” and “Soft” Label Propagation for Relational Classification

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