About
About the Data Science Association
Code of Conduct
International Journal of Data Science - Call for Papers - Deadline September 1, 2023 for Next Issue
Contact
Membership
Resources
Library
Data Science News
Committees
Wisdom
You are here
Home
» Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation
Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation
On
27 Jan, 2014
By
admin
0 Comments
Attachment:
Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation.pdf
Resource Type:
Academic Paper
Tags:
Collaborative Recommendation
Pseudoinverse
Laplacian Matrix
Euclidean
Principal Components Analysis
Fiedler Vector
Statistical Relational Learning