Graph-Based Semi-Supervised Learning and Spectral Kernel Design

Authors:
R. Johnson;Tong Zhang
Affiliations:
RJ Res. Consulting, Tarrytown;-
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 16

An efficient algorithm for learning to rank from preference graphs

Machine Learning
Error bounds of multi-graph regularized semi-supervised classification

Information Sciences: an International Journal
Transductive Rademacher complexity and its applications

Journal of Artificial Intelligence Research
Semisupervised multicategory classification with imperfect model

IEEE Transactions on Neural Networks
Semi-supervised learning based on high density region estimation

Neural Networks
Towards open-domain Semantic Role Labeling

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Semi-supervised Bayesian ARTMAP

Applied Intelligence
Manifold Mapping Machine

Neurocomputing
An effective procedure exploiting unlabeled data to build monitoring system

Expert Systems with Applications: An International Journal
A Family of Simple Non-Parametric Kernel Learning Algorithms

The Journal of Machine Learning Research
An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification

Neural Networks
Nonparametric semi-supervised learning for network intrusion detection: combining performance improvements with realistic in-situ training

Proceedings of the 5th ACM workshop on Security and artificial intelligence
Generalization performance of magnitude-preserving semi-supervised ranking with graph-based regularization

Information Sciences: an International Journal
Manifold-preserving graph reduction for sparse semi-supervised learning

Neurocomputing
Capturing the essence of word-of-mouth for social commerce: Assessing the quality of online e-commerce reviews by a semi-supervised approach

Decision Support Systems
Kernel regression with sparse metric learning

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology

Quantified Score

Hi-index	754.84

Visualization

Abstract

In this paper, we consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised learning methods on graphs. We examine various theoretical properties of such methods. In particular, we present learning bounds and derive optimal kernel representation by minimizing the bound. Based on the theoretical analysis, we are able to demonstrate why spectral kernel design based methods can improve the predictive performance. Empirical examples are included to illustrate the main consequences of our analysis.