4773 search results - page 427 / 955 » Learning from Uncertain Data |
161
click to vote
COLT
2004
Springer
16 years 10 days ago
2004
Springer
Abstract. Probabilistic finite automata (PFA) model stochastic languages, i.e. probability distributions over strings. Inferring PFA from stochastic data is an open field of rese...
185
click to vote
ROCAI
2004
Springer
16 years 9 days ago
2004
Springer
Abstract. In the field of Text Mining, a key phase in data preparation is concerned with the extraction of terms, i.e. collocation of words attached to specific concepts (e.g. Ph...
227
click to vote
FLAIRS
2008
15 years 9 months ago
2008
Hidden Markov models are a powerful technique to model and classify temporal sequences, such as in speech and gesture recognition. However, defining these models is still an art: ...
194
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
The ways in which an agent’s actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of ...
168
click to vote
ACL
2006
15 years 8 months ago
2006
Partial cognates are pairs of words in two languages that have the same meaning in some, but not all contexts. Detecting the actual meaning of a partial cognate in context can be ...