Sciweavers

5 search results - page 1 / 1
» Exploiting Cluster-Structure to Predict the Labeling of a Gr...
Sort
View
69
Voted
ALT
2008
Springer
15 years 6 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster
NIPS
2008
14 years 11 months ago
Online Prediction on Large Diameter Graphs
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
Mark Herbster, Guy Lever, Massimiliano Pontil
86
Voted
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
15 years 10 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
LION
2009
Springer
112views Optimization» more  LION 2009»
15 years 4 months ago
A Graph-Based Semi-supervised Algorithm for Protein Function Prediction from Interaction Maps
Abstract. Protein function prediction represents a fundamental challenge in bioinformatics. The increasing availability of proteomics network data has enabled the development of se...
Valerio Freschi
89
Voted
ICML
2007
IEEE
15 years 10 months ago
Transductive regression piloted by inter-manifold relations
In this paper, we present a novel semisupervised regression algorithm working on multiclass data that may lie on multiple manifolds. Unlike conventional manifold regression algori...
Huan Wang, Shuicheng Yan, Thomas S. Huang, Jianzhu...