Sciweavers

498 search results - page 65 / 100
» Learning structured prediction models: a large margin approa...
Sort
View
JMLR
2010
134views more  JMLR 2010»
13 years 2 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
TIP
2008
133views more  TIP 2008»
13 years 8 months ago
A Recursive Model-Reduction Method for Approximate Inference in Gaussian Markov Random Fields
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
Jason K. Johnson, Alan S. Willsky
ISBI
2008
IEEE
14 years 8 months ago
Segmentation of the evolving left ventricle by learning the dynamics
We propose a method for recursive segmentation of the left ventricle (LV) across a temporal sequence of magnetic resonance (MR) images. The approach involves a technique for learn...
Walter Sun, Müjdat Çetin, Raymond Chan...
CIKM
2009
Springer
14 years 2 months ago
Scalable learning of collective behavior based on sparse social dimensions
The study of collective behavior is to understand how individuals behave in a social network environment. Oceans of data generated by social media like Facebook, Twitter, Flickr a...
Lei Tang, Huan Liu
JMLR
2010
155views more  JMLR 2010»
13 years 6 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...