Sciweavers

1664 search results - page 88 / 333
» Distance labeling in graphs
Sort
View
JMLR
2006
186views more  JMLR 2006»
15 years 4 months ago
Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
Mikhail Belkin, Partha Niyogi, Vikas Sindhwani
154
Voted
EMNLP
2010
15 years 1 months ago
Collective Cross-Document Relation Extraction Without Labelled Data
We present a novel approach to relation extraction that integrates information across documents, performs global inference and requires no labelled text. In particular, we tackle ...
Limin Yao, Sebastian Riedel, Andrew McCallum
JMLR
2012
13 years 6 months ago
Distance Metric Learning with Eigenvalue Optimization
The main theme of this paper is to develop a novel eigenvalue optimization framework for learning a Mahalanobis metric. Within this context, we introduce a novel metric learning a...
Yiming Ying, Peng Li
ICCV
2007
IEEE
16 years 6 months ago
LogCut - Efficient Graph Cut Optimization for Markov Random Fields
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
Victor S. Lempitsky, Carsten Rother, Andrew Blake
137
Voted
ECEASST
2010
15 years 1 months ago
Checking Graph-Transformation Systems for Confluence
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
Detlef Plump