Sciweavers

1658 search results - page 41 / 332
» Learning Unknown Graphs
Sort
View
ICML
2007
IEEE
16 years 2 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
ICML
2008
IEEE
16 years 2 months ago
The skew spectrum of graphs
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
Risi Imre Kondor, Karsten M. Borgwardt
ICIC
2007
Springer
15 years 8 months ago
Human-Like Learning Methods for a "Conscious" Agent
In most contexts, learning is essential for the long-term autonomy of an agent. We describes here some essential and fundamental learning mechanisms implemented in a cognitive auto...
Usef Faghihi, Daniel Dubois, Mohamed Gaha, Roger N...
ISCIS
2003
Springer
15 years 7 months ago
A New Continuous Action-Set Learning Automaton for Function Optimization
In this paper, we study an adaptive random search method based on continuous action-set learning automaton for solving stochastic optimization problems in which only the noisecorr...
Hamid Beigy, Mohammad Reza Meybodi
ICMCS
2007
IEEE
180views Multimedia» more  ICMCS 2007»
15 years 8 months ago
Discrete Regularization for Perceptual Image Segmentation via Semi-Supervised Learning and Optimal Control
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...
Hongwei Zheng, Olaf Hellwich