158 search results - page 8 / 32 » A Dynamic Adaptation of AD-trees for Efficient Machine Learn... |
AAAI
2011
12 years 7 months ago
2011
A common approach in machine learning is to use a large amount of labeled data to train a model. Usually this model can then only be used to classify data in the same feature spac...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
We apply Stochastic Meta-Descent (SMD), a stochastic gradient optimization method with gain vector adaptation, to the training of Conditional Random Fields (CRFs). On several larg...
JMLR
2006
13 years 7 months ago
2006
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
LREC
2008
13 years 9 months ago
2008
This paper presents various strategies for improving the extraction performance of less prominent relations with the help of the rules learned for similar relations, for which lar...
ML
2010
ACM
13 years 6 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...