572 search results - page 101 / 115 » A Neural Probabilistic Language Model |
164
click to vote
CORR
2012
Springer
13 years 11 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
202
click to vote
Book
"Gaussian processes (GPs) provide a principled, practical, probabilistic approach to learning in kernel machines. GPs have received increased attention in the machine-learning...
140
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
The paper is concerned with learning to rank, which is to construct a model or a function for ranking objects. Learning to rank is useful for document retrieval, collaborative fil...
127
click to vote
ICALP
1990
Springer
15 years 7 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
113
click to vote
ACL
1994
15 years 4 months ago
1994
In many applications of natural language processing it is necessary to determine the likelihood of a given word combination. For example, a speech recognizer may need to determine...