Sciweavers

701 search results - page 121 / 141
» Self Bounding Learning Algorithms
Sort
View
115
Voted
ICML
2008
IEEE
16 years 1 months ago
On the quantitative analysis of deep belief networks
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
Ruslan Salakhutdinov, Iain Murray
94
Voted
ICML
2008
IEEE
16 years 1 months ago
Laplace maximum margin Markov networks
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
Jun Zhu, Eric P. Xing, Bo Zhang
JMLR
2006
124views more  JMLR 2006»
15 years 13 days ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
125
Voted
BMCBI
2010
176views more  BMCBI 2010»
15 years 18 days ago
Reverse engineering gene regulatory network from microarray data using linear time-variant model
nd: Gene regulatory network is an abstract mapping of gene regulations in living cells that can help to predict the system behavior of living organisms. Such prediction capability...
Mitra Kabir, Nasimul Noman, Hitoshi Iba
NN
2002
Springer
115views Neural Networks» more  NN 2002»
15 years 4 days 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