Sciweavers

889 search results - page 39 / 178
» Observational Learning in Random Networks
Sort
View
IJAR
2008
119views more  IJAR 2008»
13 years 9 months ago
Adapting Bayes network structures to non-stationary domains
When an incremental structural learning method gradually modifies a Bayesian network (BN) structure to fit observations, as they are read from a database, we call the process stru...
Søren Holbech Nielsen, Thomas D. Nielsen
KIVS
2005
Springer
14 years 2 months ago
On the Distribution of Nodes in Distributed Hash Tables
: We develop a model for the distribution of nodes in ring-based DHTs like Chord that position nodes randomly or based on hash-functions. As benefit of our model we get the distri...
Heiko Niedermayer, Simon Rieche, Klaus Wehrle, Geo...
ECML
2006
Springer
14 years 1 months ago
Active Learning with Irrelevant Examples
Abstract. Active learning algorithms attempt to accelerate the learning process by requesting labels for the most informative items first. In real-world problems, however, there ma...
Dominic Mazzoni, Kiri Wagstaff, Michael C. Burl
SENSYS
2003
ACM
14 years 2 months ago
On the scaling laws of dense wireless sensor networks
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
Praveen Kumar Gopala, Hesham El Gamal
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
13 years 10 months ago
Unsupervised learning of echo state networks: balancing the double pole
A possible alternative to fine topology tuning for Neural Network (NN) optimization is to use Echo State Networks (ESNs), recurrent NNs built upon a large reservoir of sparsely r...
Fei Jiang, Hugues Berry, Marc Schoenauer