Sciweavers

146 search results - page 17 / 30
» Learning with Neural Networks in the Domain of Graphs
Sort
View
IJCNN
2000
IEEE
15 years 2 months ago
Bias Learning, Knowledge Sharing
—Biasing properly the hypothesis space of a learner has been shown to improve generalization performance. Methods for achieving this goal have been proposed, that range from desi...
Joumana Ghosn, Yoshua Bengio
CORR
2010
Springer
152views Education» more  CORR 2010»
14 years 9 months ago
Neuroevolutionary optimization
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
Eva Volná
ICDAR
2011
IEEE
13 years 9 months ago
Subgraph Spotting through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
Muhammad Muzzamil Luqman, Jean-Yves Ramel, Josep L...
IJCNN
2000
IEEE
15 years 2 months ago
Piecewise Linear Homeomorphisms: The Scalar Case
The class of piecewise linear homeomorphisms (PLH) provides a convenient functional representation for many applications wherein an approximation to data is required that is inver...
Richard E. Groff, Daniel E. Koditschek, Pramod P. ...
NN
2008
Springer
152views Neural Networks» more  NN 2008»
14 years 9 months ago
Analysis of the IJCNN 2007 agnostic learning vs. prior knowledge challenge
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
Isabelle Guyon, Amir Saffari, Gideon Dror, Gavin C...