Sciweavers

940 search results - page 37 / 188
» Learning Word Representations from Relational Graphs
Sort
View
111
Voted
SIAMDM
2008
115views more  SIAMDM 2008»
15 years 3 months ago
Rank-Width and Well-Quasi-Ordering
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
Sang-il Oum
96
Voted
ALT
2009
Springer
16 years 18 days ago
Canonical Horn Representations and Query Learning
Abstract. We describe an alternative construction of an existing canonical representation for definite Horn theories, the Guigues-Duquenne basis (or GD basis), which minimizes a n...
Marta Arias, José L. Balcázar
144
Voted
NLDB
2005
Springer
15 years 9 months ago
The Role of Word Sense Disambiguation in Automated Text Categorization
Abstract. Automated Text Categorization has reached the levels of accuracy of human experts. Provided that enough training data is available, it is possible to learn accurate autom...
José María Gómez Hidalgo, Man...
116
Voted
LREC
2008
104views Education» more  LREC 2008»
15 years 5 months ago
Learning Patterns for Building Resources about Semantic Relations in the Medical Domain
In this article, we present a method for extracting automatically from texts semantic relations in the medical domain using linguistic patterns. These patterns refer to three leve...
Mehdi Embarek, Olivier Ferret
124
Voted
CVPR
2007
IEEE
16 years 5 months ago
Learning Visual Representations using Images with Captions
Current methods for learning visual categories work well when a large amount of labeled data is available, but can run into severe difficulties when the number of labeled examples...
Ariadna Quattoni, Michael Collins, Trevor Darrell