Exploiting Cluster-Structure to Predict the Labeling of a Graph

No abstract is available for this paper.

• Publication year

  2008

• Venue

  International Conference on Algorithmic Learning Theory

• Publication date

  2008-10-12

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-540-87987-9_9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Linear Lower Bound for the Perceptron for Input Sets of Constant Cardinality.

  2008cited by this paper
• Prediction on a Graph with a Perceptron

  2007influential reference
• A fast method to predict the labeling of a tree

  2007cited by this paper
• Dissimilarity in Graph-Based Semi-Supervised Classification

  2007cited by this paper
• On the Effectiveness of Laplacian Normalization for Graph Semi-supervised Learning

  2007cited by this paper
• Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples

  2006influential reference
• Introduction to Semi-Supervised Learning

  2006cited by this paper
• Online learning over graphs

  2005cited by this paper
• Online Passive-Aggressive Algorithms

  2003cited by this paper
• Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions

  2003cited by this paper
• A Second-Order Perceptron Algorithm

  2002cited by this paper
• Algorithmic Luckiness

  2001cited by this paper
• Learning Additive Models Online with Fast Evaluating Kernels

  2001cited by this paper
• Learning from Labeled and Unlabeled Data using Graph Mincuts

  2001cited by this paper
• The Robustness of the p-Norm Algorithms

  1999cited by this paper
• Large Margin Classification Using the Perceptron Algorithm

  1998cited by this paper
• Additive versus exponentiated gradient updates for linear prediction

  1995cited by this paper
• Random Walks and Electric Networks: REFERENCES

  1987cited by this paper
• Editorial: On Machine Learning

  1986cited by this paper
• Theory Of Automata

  1969cited by this paper
• ON CONVERGENCE PROOFS FOR PERCEPTRONS

  1963influential reference
• Theory of Reproducing Kernels.

  1950cited by this paper

• Fast Online Node Labeling for Very Large Graphs

  2023influential citation
• Efficient Online Multiclass Prediction on Graphs via Surrogate Losses

  2017cites this paper
• On Pairwise Clustering with Side Information

  2017cites this paper
• Online machine learning for combinatorial data

  2016influential citation
• Efficient algorithms for online learning over graphs

  2016cites this paper
• Ising Bandits with Side Information

  2015cites this paper
• Learning with Hypernode Graphs Spectral Learning with Hypernode Graphs Application to Skill Rating for Multiple Players Games ∗

  2015cites this paper
• Hypernode Graphs for Learning from Binary Relations between Groups in Networks

  2015cites this paper
• Online Mean Field Approximation for Automated Experimentation

  2015cites this paper
• Hypernode graphs for learning from binary relations between sets of objects. (Graphes d'hypernœuds pour l'apprentissage de relations binaires entre ensembles d'objets)

  2015cites this paper
• Online Prediction at the Limit of Zero Temperature

  2015cites this paper
• Online Similarity Prediction of Networked Data from Known and Unknown Graphs

  2013influential citation
• RolX: structural role extraction & mining in large graphs

  2012cites this paper
• Predicting the labels of an unknown graph via adaptive exploration

  2011cites this paper
• Exploiting structure defined by data in machine learning : some new analyses

  2011influential citation
• RolX: Role Extraction and Mining in Large Networks

  2011cites this paper
• RolX : Extracting Predictive Roles from Graphs

  2011cites this paper
• FAST LEARNING ON GRAPHS

  2011cites this paper
• Correcting Bias in Statistical Tests for Network Classifier Evaluation

  2011cites this paper
• Random Spanning Trees and the Prediction of Weighted Graphs

  2010influential citation
• Exact learning curves for Gaussian process regression on large random graphs

  2010cites this paper
• Correcting evaluation bias of relational classifiers with network cross validation

  2010cites this paper
• Short proofs for online multiclass prediction on graphs

  2010cites this paper
• Relating Function Class Complexity and Cluster Structure in the Function Domain with Applications to Transduction

  2010cites this paper
• Best Approximation with Laplacian p-Norms to Predict the Labeling of a Graph

  2009cites this paper
• Online Learning a Binary Labeling of a Graph

  2009influential citation
• Learning Unknown Graphs

  2009cites this paper
• Label Selection on Graphs

  2009cites this paper
• Predicting the Labelling of a Graph via Minimum $p$-Seminorm Interpolation

  2009cites this paper
• Fast and Optimal Prediction on a Labeled Tree

  2009cites this paper
• Theory and practice of transductive learning

  2008cites this paper
• A Linear Lower Bound for the Perceptron for Input Sets of Constant Cardinality.

  2008cites this paper
• Online Prediction on Large Diameter Graphs

  2008influential citation
• Low congestion online routing and an improved mistake bound for online prediction of graph labeling

  2008influential citation