Sciweavers

103 search results - page 12 / 21
» Adaptive Matching Based Kernels for Labelled Graphs
Sort
View
EMNLP
2010
13 years 5 months ago
Efficient Graph-Based Semi-Supervised Learning of Structured Tagging Models
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
Amarnag Subramanya, Slav Petrov, Fernando Pereira
NAACL
2010
13 years 5 months ago
Syntactic/Semantic Structures for Textual Entailment Recognition
In this paper, we describe an approach based on off-the-shelf parsers and semantic resources for the Recognizing Textual Entailment (RTE) challenge that can be generally applied t...
Yashar Mehdad, Alessandro Moschitti, Fabio Massimo...
DAM
2008
88views more  DAM 2008»
13 years 7 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
BMCBI
2010
118views more  BMCBI 2010»
13 years 7 months ago
Walk-weighted subsequence kernels for protein-protein interaction extraction
Background: The construction of interaction networks between proteins is central to understanding the underlying biological processes. However, since many useful relations are exc...
Seonho Kim, Juntae Yoon, Jihoon Yang, Seog Park
CIVR
2008
Springer
279views Image Analysis» more  CIVR 2008»
13 years 9 months ago
Semi-supervised learning of object categories from paired local features
This paper presents a semi-supervised learning (SSL) approach to find similarities of images using statistics of local matches. SSL algorithms are well known for leveraging a larg...
Wen Wu, Jie Yang