304 search results - page 24 / 61 » How good are support vector machines |
INFORMS
2000
13 years 7 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
SBBD
2000
13 years 9 months ago
2000
Dimensionalitycurse and dimensionalityreduction are two issues that have retained highinterest for data mining, machine learning, multimedia indexing, and clustering. We present a...
ML
2002
ACM
13 years 7 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
Supervised learning is a classic data mining problem where one wishes to be be able to predict an output value associated with a particular input vector. We present a new twist on...
EMNLP
2008
13 years 9 months ago
2008
We present a discriminative method for learning selectional preferences from unlabeled text. Positive examples are taken from observed predicate-argument pairs, while negatives ar...