889 search results - page 19 / 178 » Observational Learning in Random Networks |
105
click to vote
ICML
2007
IEEE
16 years 1 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...
112
Voted
NIPS
2008
15 years 1 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 ...
102
Voted
WWW
2010
ACM
15 years 18 days 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 ...
134
click to vote
MSWIM
2006
ACM
15 years 6 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...
83
Voted
ICONIP
2007
15 years 1 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...