journal article Mar 01, 2007

Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation

View at Publisher Save 10.1109/tkde.2007.46
Topics

No keywords indexed for this article. Browse by subject →

References
67
[1]
Agaev "The Matrix of Maximum Out Forests of a Digraph and Its Applications" Automation and Remote Control (2000)
[3]
Baeza-Yates (1999)
[5]
Barnett (1992)
[7]
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation

Mikhail Belkin, Partha Niyogi

Neural Computation 10.1162/089976603321780317
[8]
Ben-Israel (2003)
[11]
Buckley (1990)
[15]
Chebotarev "The Matrix-Forest Theorem and Measuring Relations in Small Social Groups" Automation and Remote Control (1997)
[16]
Chebotarev "On a Duality between Metrics and S-Proximities" Automation and Remote Control (1998)
[17]
Chebotarev "On Proximity Measures for Graph Vertices" Automation and Remote Control (1998)
[20]
Ding "Spectral Clustering"
[26]
Fouss "An Experimental Investigation of Graph Kernels on Two Collaborative Recommendation Tasks"
[28]
Metric and Euclidean properties of dissimilarity coefficients

J. C. Gower, P. Legendre

Journal of Classification 10.1007/bf01896809
[29]
Graybill (1983)
[32]
Evaluating collaborative filtering recommender systems

Jonathan L. Herlocker, Joseph A. Konstan, Loren G. Terveen et al.

ACM Transactions on Information Systems 10.1145/963770.963772
[33]
Herstein (1988)
[36]
Isaacson (1976)
[37]
Ito "Application of Kernels to Link Analysis: First Results"
[38]
Johnson (2002)
[40]
A New Status Index Derived from Sociometric Analysis

Leo Katz

Psychometrika 10.1007/bf02289026
[41]
Kemeny (1976)
[43]
Authoritative sources in a hyperlinked environment

Jon M. Kleinberg

Journal of the ACM 10.1145/324133.324140
[44]
Kondor "Diffusion Kernels on Graphs and Other Discrete Structures"
[47]
Nadler "Diffusion Maps, Spectral Clustering and Eigenfunctions of Fokker-Planck Operators" Advances in Neural Information Processing Systems 18 (2006)
[49]
Noble (1988)

Showing 50 of 67 references

Cited By
929
ACM Transactions on Information Sys...
A bag-of-paths framework for network data analysis

Kevin Françoisse, Ilkka Kivimäki · 2017

Neural Networks
Metrics
929
Citations
67
References
Details
Published
Mar 01, 2007
Vol/Issue
19(3)
Pages
355-369
License
View
Cite This Article
François Fouss, Alain Pirotte, Jean-michel Renders, et al. (2007). Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation. IEEE Transactions on Knowledge and Data Engineering, 19(3), 355-369. https://doi.org/10.1109/tkde.2007.46
Related

You May Also Like

A Survey on Transfer Learning

Sinno Jialin Pan, Qiang Yang · 2010

22,641 citations

Learning from Imbalanced Data

Haibo He, E.A. Garcia · 2009

7,496 citations

A Review on Multi-Label Learning Algorithms

Min-Ling Zhang, Zhi-Hua Zhou · 2014

2,573 citations

Knowledge Graph Embedding: A Survey of Approaches and Applications

Quan Wang, Zhendong Mao · 2017

1,991 citations