940 search results - page 50 / 188 » Learning Word Representations from Relational Graphs |
130
Voted
ACL
2003
15 years 5 months ago
2003
We present a supervised machine learning algorithm for metonymy resolution, which exploits the similarity between examples of conventional metonymy. We show that syntactic head-mo...
142
Voted
ILP
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
119
Voted
FORMATS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
124
Voted
DAS
2010
Springer
15 years 7 months ago
2010
Springer
Most of the Indian scripts do not have any robust commercial OCRs. Many of the laboratory prototypes report reasonable results at recognition/classification stage. However, word ...
109
Voted
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we present a novel feature extraction framework, called learning by propagability. The whole learning process is driven by the philosophy that the data labels and o...