Sciweavers

976 search results - page 108 / 196
» Training of Support Vector Machines with Mahalanobis Kernels
Sort
View
ICML
2001
IEEE
16 years 6 months ago
Learning with the Set Covering Machine
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
Mario Marchand, John Shawe-Taylor
EMNLP
2008
15 years 7 months ago
Discriminative Learning of Selectional Preference from Unlabeled Text
We present a discriminative method for learning selectional preferences from unlabeled text. Positive examples are taken from observed predicate-argument pairs, while negatives ar...
Shane Bergsma, Dekang Lin, Randy Goebel
CMIG
2010
110views more  CMIG 2010»
15 years 1 months ago
Unsupervised SVM-based gridding for DNA microarray images
This paper presents a novel method for unsupervised DNA microarray gridding based on Support Vector Machines (SVMs). Each spot is a small region on the microarray surface where cha...
Dimitris G. Bariamis, Dimitris Maroulis, Dimitrios...
NIPS
2001
15 years 7 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
ECML
2006
Springer
15 years 9 months ago
Multiple-Instance Learning Via Random Walk
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
Dong Wang, Jianmin Li, Bo Zhang