172 search results - page 7 / 35 » Learning to Predict Code-Switching Points |
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
ICTIR
2009
Springer
14 years 2 months ago
2009
Springer
We address the problem of online term recurrence prediction: for a stream of terms, at each time point predict what term is going to recur next in the stream given the term occurre...
DAGM
2004
Springer
14 years 1 months ago
2004
Springer
We present an approach to discretizing multivariate continuous data while learning the structure of a graphical model. We derive the joint scoring function from the principle of p...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
In many real-world classification problems the input contains a large number of potentially irrelevant features. This paper proposes a new Bayesian framework for determining the r...
COLT
1999
Springer
14 years 4 days ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...