Sciweavers

2190 search results - page 186 / 438
» Learning with the Set Covering Machine
Sort
View
IWCLS
2007
Springer
14 years 4 months ago
A Principled Foundation for LCS
In this paper we explicitly identify the probabilistic model underlying LCS by linking it to a generalisation of the common Mixture-of-Experts model. Having an explicit representa...
Jan Drugowitsch, Alwyn Barry
ICALT
2006
IEEE
14 years 4 months ago
Understanding Dynamic Situations through Context Explanation
This article presents advantages of using context to set up a pedagogical assistance for recognition of collectives situations in Virtual Environment for Training (VET). We are fo...
Romain Benard, Pierre De Loor, Jacques Tisseau
COLT
2000
Springer
14 years 2 months ago
On the Convergence Rate of Good-Turing Estimators
Good-Turing adjustments of word frequencies are an important tool in natural language modeling. In particular, for any sample of words, there is a set of words not occuring in tha...
David A. McAllester, Robert E. Schapire
COLT
2008
Springer
14 years 6 days ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
EDUTAINMENT
2008
Springer
14 years 5 days ago
A Sufficient Condition for Uniform Convergence of Stationary p-Subdivision Scheme
Subdivision is a convenient tool to construct objective curves and surfaces directly from given scattered points. Stationary p-subdivision schemes are highly efficient in the acqui...
Yi-Kuan Zhang, Ke Lu, Jiangshe Zhang, Xiaopeng Zha...