Sciweavers

2695 search results - page 289 / 539
» Learning Graph Matching
Sort
View
132
Voted
JMLR
2010
139views more  JMLR 2010»
14 years 10 months ago
Causal learning without DAGs
Causal learning methods are often evaluated in terms of their ability to discover a true underlying directed acyclic graph (DAG) structure. However, in general the true structure ...
David Duvenaud, Daniel Eaton, Kevin P. Murphy, Mar...
131
Voted
ICML
2007
IEEE
16 years 4 months ago
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
Arik Azran
124
Voted
IROS
2008
IEEE
125views Robotics» more  IROS 2008»
15 years 10 months ago
Neighborhood denoising for learning high-dimensional grasping manifolds
— Human control of high degree-of-freedom robotic systems, e.g. anthropomorphic robot hands, is often difficult due to the overwhelming number of variables that need to be speci...
Aggeliki Tsoli, Odest Chadwicke Jenkins
137
Voted
ECAI
2008
Springer
15 years 5 months ago
Reinforcement Learning with Classifier Selection for Focused Crawling
Focused crawlers are programs that wander in the Web, using its graph structure, and gather pages that belong to a specific topic. The most critical task in Focused Crawling is the...
Ioannis Partalas, Georgios Paliouras, Ioannis P. V...
124
Voted
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 8 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis