3718 search results - page 111 / 744 » On learning with dissimilarity functions |
NIPS
2001
13 years 11 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
PAAMS
2010
Springer
13 years 7 months ago
2010
Springer
This paper presents an improved version of a multiagent architecture aimed at providing solutions for monitoring the interaction between the atmosphere and the ocean. The ocean sur...
KDD
2005
ACM
14 years 10 months ago
2005
ACM
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
NIPS
2008
13 years 11 months ago
2008
We propose a general method called truncated gradient to induce sparsity in the weights of onlinelearning algorithms with convex loss functions. This method has several essential ...
GECCO
2000
Springer
14 years 1 months ago
2000
Springer
The organizational algorithm is examined as a computational approach to representing interpersonal learning. The structure of the algorithm is introduced and described in context ...