Sciweavers

1014 search results - page 70 / 203
» A Spectral Algorithm for Learning Hidden Markov Models
Sort
View
TIST
2011
136views more  TIST 2011»
13 years 2 months ago
Probabilistic models for concurrent chatting activity recognition
Recognition of chatting activities in social interactions is useful for constructing human social networks. However, the existence of multiple people involved in multiple dialogue...
Jane Yung-jen Hsu, Chia-chun Lian, Wan-rong Jih
ECML
1998
Springer
13 years 11 months ago
Predicate Invention and Learning from Positive Examples Only
Previous bias shift approaches to predicate invention are not applicable to learning from positive examples only, if a complete hypothesis can be found in the given language, as ne...
Henrik Boström
ACL
1994
13 years 9 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
AAAI
2006
13 years 9 months ago
Unifying Logical and Statistical AI
Intelligent agents must be able to handle the complexity and uncertainty of the real world. Logical AI has focused mainly on the former, and statistical AI on the latter. Markov l...
Pedro Domingos, Stanley Kok, Hoifung Poon, Matthew...
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
13 years 5 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis