Sciweavers

3716 search results - page 33 / 744
» On the monotonization of the training set
Sort
View
SIAMJO
2000
113views more  SIAMJO 2000»
13 years 9 months ago
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
Masakazu Kojima, Levent Tunçel
EMO
2009
Springer
147views Optimization» more  EMO 2009»
14 years 4 months ago
Application of MOGA Search Strategy to SVM Training Data Selection
When training Support Vector Machine (SVM), selection of a training data set becomes an important issue, since the problem of overfitting exists with a large number of training da...
Tomoyuki Hiroyasu, Masashi Nishioka, Mitsunori Mik...
EMNLP
2004
13 years 11 months ago
Monolingual Machine Translation for Paraphrase Generation
We apply statistical machine translation (SMT) tools to generate novel paraphrases of input sentences in the same language. The system is trained on large volumes of sentence pair...
Chris Quirk, Chris Brockett, William B. Dolan
AMAI
2008
Springer
13 years 10 months ago
Set based logic programming
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
Howard A. Blair, Victor W. Marek, Jeffrey B. Remme...
ANNPR
2006
Springer
14 years 1 months ago
Fast Training of Linear Programming Support Vector Machines Using Decomposition Techniques
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
Yusuke Torii, Shigeo Abe