Sciweavers

336 search results - page 24 / 68
» Learning with Equivalence Constraints and the Relation to Mu...
Sort
View
ECML
1993
Springer
13 years 12 months ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman
NIPS
2008
13 years 9 months ago
Stochastic Relational Models for Large-scale Dyadic Data using MCMC
Stochastic relational models (SRMs) [15] provide a rich family of choices for learning and predicting dyadic data between two sets of entities. The models generalize matrix factor...
Shenghuo Zhu, Kai Yu, Yihong Gong
JCIT
2008
112views more  JCIT 2008»
13 years 7 months ago
On the design of metric relations
Metric distances and the more general concept of dissimilarities are widely used tools in instance-based learning methods and very especially in the nearestneighbor classification...
Lluís Belanche, Jorge Orozco
ICPR
2010
IEEE
14 years 2 months ago
Semi-Supervised Distance Metric Learning by Quadratic Programming
This paper introduces a semi-supervised distance metric learning algorithm which uses pair-wise equivalence (similarity and dissimilarity) constraints to improve the original dist...
Hakan Cevikalp
ACML
2009
Springer
13 years 11 months ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo