Sciweavers

172 search results - page 20 / 35
» Learning Generative Models of Similarity Matrices
Sort
View
ICML
2010
IEEE
13 years 11 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
ECML
2006
Springer
14 years 1 months ago
Learning Stochastic Tree Edit Distance
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...
Marc Bernard, Amaury Habrard, Marc Sebban
ECML
1991
Springer
14 years 1 months ago
Learning by Analogical Replay in PRODIGY: First Results
Robust reasoning requires learning from problem solving episodes. Past experience must be compiled to provide adaptation to new contingencies and intelligent modification of solut...
Manuela M. Veloso, Jaime G. Carbonell
ICRA
2010
IEEE
137views Robotics» more  ICRA 2010»
13 years 8 months ago
Robot reinforcement learning using EEG-based reward signals
Abstract— Reinforcement learning algorithms have been successfully applied in robotics to learn how to solve tasks based on reward signals obtained during task execution. These r...
Iñaki Iturrate, Luis Montesano, Javier Ming...
ICANN
2009
Springer
14 years 2 months ago
Learning Complex Population-Coded Sequences
The sequential structure of complex actions is apparently at an abstract “cognitive” level in several regions of the frontal cortex, independent of the control of the immediate...
Kiran V. Byadarhaly, Mithun Perdoor, Suresh Vasa, ...