180 search results - page 33 / 36 » Learning random walks to rank nodes in graphs |
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
A plausible representation of relational information among entities in dynamic systems such as a living cell or a social community is a stochastic network which is topologically r...
PC
2007
13 years 7 months ago
2007
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
NIPS
2004
13 years 8 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...