Sciweavers

4263 search results - page 304 / 853
» Learning without Coding
Sort
View
KSEM
2009
Springer
16 years 1 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
BMCBI
2004
140views more  BMCBI 2004»
15 years 6 months ago
What can we learn from noncoding regions of similarity between genomes?
Background: In addition to known protein-coding genes, large amounts of apparently non-coding sequence are conserved between the human and mouse genomes. It seems reasonable to as...
Thomas A. Down, Tim J. P. Hubbard
JMLR
2011
192views more  JMLR 2011»
15 years 1 months ago
Minimum Description Length Penalization for Group and Multi-Task Sparse Learning
We propose a framework MIC (Multiple Inclusion Criterion) for learning sparse models based on the information theoretic Minimum Description Length (MDL) principle. MIC provides an...
Paramveer S. Dhillon, Dean P. Foster, Lyle H. Unga...
PAMI
2011
15 years 1 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
ICML
2008
IEEE
16 years 7 months ago
Non-parametric policy gradients: a unified treatment of propositional and relational domains
Policy gradient approaches are a powerful instrument for learning how to interact with the environment. Existing approaches have focused on propositional and continuous domains on...
Kristian Kersting, Kurt Driessens