Sciweavers

712 search results - page 35 / 143
» A mixture model for random graphs
Sort
View
PKDD
2009
Springer
155views Data Mining» more  PKDD 2009»
14 years 4 months ago
Dynamic Factor Graphs for Time Series Modeling
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...
Piotr W. Mirowski, Yann LeCun
WWW
2010
ACM
14 years 5 months ago
Tracking the random surfer: empirically measured teleportation parameters in PageRank
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
David F. Gleich, Paul G. Constantine, Abraham D. F...
ISAAC
1997
Springer
162views Algorithms» more  ISAAC 1997»
14 years 2 months ago
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
Chung Keung Poon, Vijaya Ramachandran
ICONIP
2007
13 years 11 months ago
Discovery of Linear Non-Gaussian Acyclic Models in the Presence of Latent Classes
Abstract. An effective way to examine causality is to conduct an experiment with random assignment. However, in many cases it is impossible or too expensive to perform controlled ...
Shohei Shimizu, Aapo Hyvärinen
IJON
2007
81views more  IJON 2007»
13 years 10 months ago
Statistical analysis of spatially embedded networks: From grid to random node positions
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
Nicole Voges, Ad Aertsen, Stefan Rotter