Sciweavers

888 search results - page 155 / 178
» Learning to Select a Ranking Function
Sort
View
BMCBI
2008
172views more  BMCBI 2008»
13 years 8 months ago
Compo: composite motif discovery using discrete models
Background: Computational discovery of motifs in biomolecular sequences is an established field, with applications both in the discovery of functional sites in proteins and regula...
Geir Kjetil Sandve, Osman Abul, Finn Drablø...
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
11 years 10 months ago
Rank-loss support instance machines for MIML instance annotation
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
13 years 11 months ago
Controlling overfitting with multi-objective support vector machines
Recently, evolutionary computation has been successfully integrated into statistical learning methods. A Support Vector Machine (SVM) using evolution strategies for its optimizati...
Ingo Mierswa
JMLR
2011
148views more  JMLR 2011»
13 years 2 months ago
Multitask Sparsity via Maximum Entropy Discrimination
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
Tony Jebara
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
14 years 2 months ago
Three interconnected parameters for genetic algorithms
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
Pedro A. Diaz-Gomez, Dean F. Hougen