502 search results - page 50 / 101 » Learning from General Label Constraints |
ICMLA
2008
13 years 10 months ago
2008
In this work, a new learning paradigm called target selection is proposed, which can be used to test for associations between a single genetic variable and a multidimensional, qua...
WSDM
2012
ACM
12 years 4 months ago
2012
ACM
Recent research has made significant advances in automatically constructing knowledge bases by extracting relational facts (e.g., Bill Clinton-presidentOf-US) from large text cor...
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
Many applications of supervised learning require good generalization from limited labeled data. In the Bayesian setting, we can try to achieve this goal by using an informative pr...
COLT
2005
Springer
14 years 2 months ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
TNN
2010
13 years 3 months ago
2010
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...