Sciweavers

1658 search results - page 98 / 332
» Learning Unknown Graphs
Sort
View
JMLR
2006
124views more  JMLR 2006»
15 years 4 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
ACL
2004
15 years 6 months ago
Enriching the Output of a Parser Using Memory-based Learning
We describe a method for enriching the output of a parser with information available in a corpus. The method is based on graph rewriting using memorybased learning, applied to dep...
Valentin Jijkoun, Maarten de Rijke
ICML
2009
IEEE
16 years 5 months ago
Group lasso with overlap and graph lasso
We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is ty...
Laurent Jacob, Guillaume Obozinski, Jean-Philippe ...
NIPS
2004
15 years 6 months ago
Distributed Information Regularization on Graphs
We provide a principle for semi-supervised learning based on optimizing the rate of communicating labels for unlabeled points with side information. The side information is expres...
Adrian Corduneanu, Tommi Jaakkola
SDM
2008
SIAM
144views Data Mining» more  SDM 2008»
15 years 6 months ago
Semi-supervised Multi-label Learning by Solving a Sylvester Equation
Multi-label learning refers to the problems where an instance can be assigned to more than one category. In this paper, we present a novel Semi-supervised algorithm for Multi-labe...
Gang Chen, Yangqiu Song, Fei Wang, Changshui Zhang