3050 search results - page 235 / 610 » On-line Algorithms in Machine Learning |
135
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Given a model family and a set of unlabeled examples, one could either label specific examples or state general constraints--both provide information about the desired model. In g...
134
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
128
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
Finding good representations of text documents is crucial in information retrieval and classification systems. Today the most popular document representation is based on a vector ...
154
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
We present a new unsupervised algorithm for training structured predictors that is discriminative, convex, and avoids the use of EM. The idea is to formulate an unsupervised versi...
137
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...