233 search results - page 9 / 47 » Learning Regular Expressions from Noisy Sequences |
105
click to vote
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
We consider the problem of learning with instances defined over a space of sets of vectors. We derive a new positive definite kernel f(A B) defined over pairs of matrices A B base...
113
Voted
JAIR
2010
14 years 9 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
95
Voted
JAIR
2002
14 years 10 months ago
2002
We develop, analyze, and evaluate a novel, supervised, specific-to-general learner for a simple temporal logic and use the resulting algorithm to learn visual event definitions fr...
ICMLA
2004
15 years 14 days ago
2004
AdaBoost rarely suffers from overfitting problems in low noise data cases. However, recent studies with highly noisy patterns clearly showed that overfitting can occur. A natural s...
103
Voted
JMLR
2010
14 years 5 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...