Exploiting Cluster-Structure to Predict the Labeling of a Graph

DOI10.1007/978-3-540-87987-9_9MaRDI QIDQ3529910zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Learning unknown graphs
• Structural, Syntactic, and Statistical Pattern Recognition
• Predicting the labels of an unknown graph via adaptive exploration
• Short proofs for online multiclass prediction on graphs
• Predicting a switching sequence of graph labelings

Cites work

• 10.1162/153244303765208368
• A Second-Order Perceptron Algorithm
• Convex Analysis
• scientific article; zbMATH DE number 5957338 (Why is no real title available?)
• scientific article; zbMATH DE number 1804117 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 1263196 (Why is no real title available?)
• scientific article; zbMATH DE number 3189712 (Why is no real title available?)
• Large margin classification using the perceptron algorithm
• Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
• On the effectiveness of Laplacian normalization for graph semi-supervised learning
• The robustness of the \(p\)-norm algorithms
• Theory of Reproducing Kernels

Cited in

(5)

• Predicting the labels of an unknown graph via adaptive exploration
• Learning unknown graphs
• Structural, Syntactic, and Statistical Pattern Recognition
• Predicting a switching sequence of graph labelings
• Short proofs for online multiclass prediction on graphs

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

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