889 search results - page 19 / 178 » Observational Learning in Random Networks |
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
Hierarchical models have been extensively studied in various domains. However, existing models assume fixed model structures or incorporate structural uncertainty generatively. In...
NIPS
2008
13 years 11 months ago
2008
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirected Markov ...
WWW
2010
ACM
13 years 9 months ago
2010
ACM
Relational autocorrelation is ubiquitous in relational domains. This observed correlation between class labels of linked instances in a network (e.g., two friends are more likely ...
MSWIM
2006
ACM
14 years 3 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
ICONIP
2007
13 years 11 months ago
2007
One of the authors has proposed a simple learning algorithm for recurrent neural networks, which requires computational cost and memory capacity in practical order O(n2 )[1]. The a...