Sciweavers

1340 search results - page 210 / 268
» Structure learning of Bayesian networks using constraints
Sort
View
CIKM
2010
Springer
15 years 2 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
NN
2002
Springer
115views Neural Networks» more  NN 2002»
15 years 4 months ago
A self-organising network that grows when required
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
Stephen Marsland, Jonathan Shapiro, Ulrich Nehmzow
CVPR
2009
IEEE
1390views Computer Vision» more  CVPR 2009»
17 years 2 days ago
Stacks of Convolutional Restricted Boltzmann Machines for Shift-Invariant Feature Learning
In this paper we present a method for learning classspecific features for recognition. Recently a greedy layerwise procedure was proposed to initialize weights of deep belief ne...
Mohammad Norouzi (Simon Fraser University), Mani R...
CVPR
2007
IEEE
16 years 7 months ago
Modeling Appearances with Low-Rank SVM
Several authors have noticed that the common representation of images as vectors is sub-optimal. The process of vectorization eliminates spatial relations between some of the near...
Lior Wolf, Hueihan Jhuang, Tamir Hazan
NIPS
2004
15 years 6 months ago
Maximising Sensitivity in a Spiking Network
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
Anthony J. Bell, Lucas C. Parra