Sciweavers

259 search results - page 2 / 52
» A Hybrid Convergent Method for Learning Probabilistic Networ...
Sort
View
HIS
2003
13 years 6 months ago
A Hybrid Approach for Learning Parameters of Probabilistic Networks from Incomplete Databases
– Probabilistic Inference Networks are becoming increasingly popular for modeling and reasoning in uncertain domains. In the past few years, many efforts have been made in learni...
S. Haider
APIN
1999
107views more  APIN 1999»
13 years 4 months ago
Massively Parallel Probabilistic Reasoning with Boltzmann Machines
We present a method for mapping a given Bayesian network to a Boltzmann machine architecture, in the sense that the the updating process of the resulting Boltzmann machine model pr...
Petri Myllymäki
CDC
2010
IEEE
196views Control Systems» more  CDC 2010»
12 years 12 months ago
Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema
The asymptotic behavior of stochastic gradient algorithms is studied. Relying on some results of differential geometry (Lojasiewicz gradient inequality), the almost sure pointconve...
Vladislav B. Tadic
ICML
2007
IEEE
14 years 5 months ago
Best of both: a hybridized centroid-medoid clustering heuristic
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
Nizar Grira, Michael E. Houle
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
13 years 6 months ago
Towards memoryless model building
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
David Iclanzan, Dumitru Dumitrescu