886 search results - page 54 / 178 » Learning Distance Functions using Equivalence Relations |
COLT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Past empirical work has shown that learning multiple related tasks from data simultaneously can be advantageous in terms of predictive performance relative to learning these tasks...
103
click to vote
JMLR
2002
14 years 9 months ago
2002
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
CSCW
2004
ACM
15 years 3 months ago
2004
ACM
In this paper we examine the relationship between emergent social network characteristics in a computer-supported collaborative learning course and locus of control. An emergent c...
SDM
2004
SIAM
14 years 11 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...