Exploiting Cluster-Structure to Predict the Labeling of a Graph

DOI10.1007/978-3-540-87987-9_9zbMath1156.68535OpenAlexW1720986870MaRDI QIDQ3529910

Mark Herbster

Publication date: 14 October 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-87987-9_9

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Predicting the labels of an unknown graph via adaptive exploration ⋮ Short proofs for online multiclass prediction on graphs ⋮ Learning Unknown Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The robustness of the \(p\)-norm algorithms
• Large margin classification using the perceptron algorithm
• 10.1162/153244303765208368
• A Second-Order Perceptron Algorithm
• Convex Analysis
• Theory of Reproducing Kernels

This page was built for publication: Exploiting Cluster-Structure to Predict the Labeling of a Graph