1658 search results - page 24 / 332 » Learning Unknown Graphs |
158
click to vote
ACL
1996
15 years 7 months ago
1996
Words unknown to the lexicon present a substantial problem to part-of-speech tagging. In this paper we present a technique for fully unsupervised statistical acquisition of rules ...
130
click to vote
COLING
1996
15 years 7 months ago
1996
One of the problems in part-of-speech tagging of real-word texts is that of unknown to the lexicon words. In (Mikheev, 1996), a technique for fully unsupervised statistical acquis...
142
click to vote
FOCS
2010
IEEE
15 years 3 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
247
click to vote
CORR
2010
Springer
15 years 10 days ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
139
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...