Sciweavers

73 search results - page 2 / 15
» Random Walk on Directed Dynamic Graphs
Sort
View
ICML
2007
IEEE
14 years 6 months ago
Learning random walks to rank nodes in graphs
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
Alekh Agarwal, Soumen Chakrabarti
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
13 years 12 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
EWSN
2010
Springer
14 years 2 months ago
Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature...
Marco Zuniga, Chen Avin, Manfred Hauswirth
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 5 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
ML
2010
ACM
141views Machine Learning» more  ML 2010»
13 years 3 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen