743 search results - page 26 / 149 » Solving the Multiple-Instance Problem: A Lazy Learning Appro... |
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...
CONSTRAINTS
2008
13 years 9 months ago
2008
When solving systems of nonlinear equations with interval constraint methods, it has often been observed that many calls to contracting operators do not participate actively to th...
CIS
2008
Springer
13 years 10 months ago
2008
Springer
Rival Penalized Competitive Learning (RPCL) and its variants can perform clustering analysis efficiently with the ability of selecting the cluster number automatically. Although t...
KDD
2009
ACM
14 years 1 months ago
2009
ACM
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
KDD
1994
ACM
14 years 27 days ago
1994
ACM
Semantic query optimization can dramatically speed up database query answering by knowledge intensive reformulation. But the problem of how to learn required semantic rules has no...