Sciweavers

2190 search results - page 320 / 438
» Learning with the Set Covering Machine
Sort
View
89
Voted
ML
2008
ACM
15 years 22 days ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
101
Voted
ML
2008
ACM
128views Machine Learning» more  ML 2008»
15 years 22 days ago
QG/GA: a stochastic search for Progol
Most search techniques within ILP require the evaluation of a large number of inconsistent clauses. However, acceptable clauses typically need to be consistent, and are only found ...
Stephen Muggleton, Alireza Tamaddoni-Nezhad
KAIS
2006
121views more  KAIS 2006»
15 years 22 days ago
Using discriminant analysis for multi-class classification: an experimental investigation
Abstract. Many supervised machine learning tasks can be cast as multi-class classification problems. Support vector machines (SVMs) excel at binary classification problems, but the...
Tao Li, Shenghuo Zhu, Mitsunori Ogihara
SIGIR
2008
ACM
15 years 21 days ago
Automatically identifying localizable queries
Personalization of web search results as a technique for improving user satisfaction has received notable attention in the research community over the past decade. Much of this wo...
Michael J. Welch, Junghoo Cho
134
Voted
ML
2007
ACM
192views Machine Learning» more  ML 2007»
15 years 9 days ago
Annealing stochastic approximation Monte Carlo algorithm for neural network training
We propose a general-purpose stochastic optimization algorithm, the so-called annealing stochastic approximation Monte Carlo (ASAMC) algorithm, for neural network training. ASAMC c...
Faming Liang