Sciweavers

187 search results - page 23 / 38
» Learning Hierarchical Structures with Linear Relational Embe...
Sort
View
NIPS
1990
13 years 9 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
AUSAI
2008
Springer
13 years 10 months ago
Character Recognition Using Hierarchical Vector Quantization and Temporal Pooling
In recent years, there has been a cross-fertilization of ideas between computational neuroscience models of the operation of the neocortex and artificial intelligence models of mac...
John Thornton, Jolon Faichney, Michael Blumenstein...
ICDAR
2011
IEEE
12 years 8 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...
ADCM
2008
136views more  ADCM 2008»
13 years 8 months ago
Learning and approximation by Gaussians on Riemannian manifolds
Learning function relations or understanding structures of data lying in manifolds embedded in huge dimensional Euclidean spaces is an important topic in learning theory. In this ...
Gui-Bo Ye, Ding-Xuan Zhou
ML
2010
ACM
151views Machine Learning» more  ML 2010»
13 years 7 months ago
Inductive transfer for learning Bayesian networks
In several domains it is common to have data from different, but closely related problems. For instance, in manufacturing, many products follow the same industrial process but with...
Roger Luis, Luis Enrique Sucar, Eduardo F. Morales