Sciweavers

733 search results - page 5 / 147
» Recommending random walks
Sort
View
ICDM
2006
IEEE
133views Data Mining» more  ICDM 2006»
15 years 3 months ago
An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
François Fouss, Luh Yen, Alain Pirotte, Mar...
WEBI
2005
Springer
15 years 3 months ago
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
François Fouss, Alain Pirotte, Marco Saeren...
75
Voted
CSC
2009
14 years 10 months ago
Improving Random Walk Performance
Random walk simulation is employed in many experimental algorithmic applications. Efficient execution on modern computer architectures demands that the random walk be implemented t...
Ilya Safro, Paul D. Hovland, Jaewook Shin, Michell...
ADHOCNOW
2010
Springer
14 years 11 months ago
Coverage-Adaptive Random Walks for Fast Sensory Data Collection
Random walks in wireless sensor networks can serve as fully local, very simple strategies for sink motion that reduce energy dissipation a lot but increase the latency of data coll...
Constantinos Marios Angelopoulos, Sotiris E. Nikol...
PAMI
2011
14 years 4 months ago
Connectedness of Random Walk Segmentation
Connectedness of random walk segmentation is examined, and novel properties are discovered, by considering electrical circuits equivalent to random walks. A theoretical analysis s...
Ming-Ming Cheng, Guo-Xin Zhang