1454 search results - page 44 / 291 » Learning and Extending Sublanguages |
123
click to vote
PERCOM
2003
ACM
15 years 7 months ago
2003
ACM
Seeking to extend the functional capability of the elderly, we explore the use of probabilistic methods to learn and recognise human activity in order to provide monitoring suppor...
106
click to vote
ICML
2000
IEEE
15 years 6 months ago
2000
IEEE
We present feature transformations useful for exploratory data analysis or for pattern recognition. Transformations are learned from example data sets by maximizing the mutual inf...
103
click to vote
ML
2007
ACM
15 years 1 months ago
2007
ACM
This paper describes the winning entry to the Omphalos context free grammar learning competition. Our approach integrates an information theoretic constituent likelihood measure to...
122
click to vote
ALT
2005
Springer
15 years 11 months ago
2005
Springer
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...
102
click to vote
COLT
2007
Springer
15 years 8 months ago
2007
Springer
Recently, Balcan and Blum [1] suggested a theory of learning based on general similarity functions, instead of positive semi-definite kernels. We study the gap between the learnin...