Sciweavers

275 search results - page 5 / 55
» Improved Guarantees for Learning via Similarity Functions
Sort
View
IROS
2007
IEEE
168views Robotics» more  IROS 2007»
15 years 4 months ago
Improving humanoid locomotive performance with learnt approximated dynamics via Gaussian processes for regression
Abstract— We propose to improve the locomotive performance of humanoid robots by using approximated biped stepping and walking dynamics with reinforcement learning (RL). Although...
Jun Morimoto, Christopher G. Atkeson, Gen Endo, Go...
ICML
2009
IEEE
15 years 10 months ago
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
Sushmita Roy, Terran Lane, Margaret Werner-Washbur...
62
Voted
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
15 years 10 months ago
Formulating distance functions via the kernel trick
Tasks of data mining and information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be for...
Gang Wu, Edward Y. Chang, Navneet Panda
ACL
2006
14 years 11 months ago
Automatic Learning of Textual Entailments with Cross-Pair Similarities
In this paper we define a novel similarity measure between examples of textual entailments and we use it as a kernel function in Support Vector Machines (SVMs). This allows us to ...
Fabio Massimo Zanzotto, Alessandro Moschitti
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
13 years 2 days ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...