282 search results - page 43 / 57 » Online Learning of Approximate Dependency Parsing Algorithms |
ACL
2009
13 years 5 months ago
2009
Modern models of relation extraction for tasks like ACE are based on supervised learning of relations from small hand-labeled corpora. We investigate an alternative paradigm that ...
ALGORITHMICA
2000
13 years 7 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
NIPS
2007
13 years 9 months ago
2007
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
KAIS
2008
13 years 7 months ago
2008
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...