3137 search results - page 260 / 628 » A Text Understander that Learns |
154
click to vote
AIIA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In a recent work we have carried out CarpeDiem, a novel algorithm for the fast evaluation of Supervised Sequential Learning (SSL) classifiers. In this paper we point out...
166
Voted
NIPS
2004
15 years 8 months ago
2004
We propose a probabilistic, generative account of configural learning phenomena in classical conditioning. Configural learning experiments probe how animals discriminate and gener...
235
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
191
click to vote
NIPS
2007
15 years 8 months ago
2007
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
193
click to vote
EACL
2006
ACL Anthology
15 years 8 months ago
2006
ACL Anthology
This paper deals with the problem of recognizing and extracting acronymdefinition pairs in Swedish medical texts. This project applies a rule-based method to solve the acronym rec...