8970 search results - page 1550 / 1794 » Learning to Learn Causal Models |
135
click to vote
CIKM
2008
Springer
15 years 7 months ago
2008
Springer
We propose a framework for searching the Wikipedia with contextual information. Our framework extends the typical keyword search, by considering queries of the type q, p , where q...
160
Voted
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
185
click to vote
FASE
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
202
click to vote
ACL
2008
15 years 7 months ago
2008
This paper provides evidence that the use of more unlabeled data in semi-supervised learning can improve the performance of Natural Language Processing (NLP) tasks, such as part-o...
159
click to vote
AAAI
2010
15 years 7 months ago
2010
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...