Transfer Learning for Human & AI

By lumping all dangling nodes of a web graph into a single node, PageRankcomputation can be proceeded with a much smaller matrix on the case that thenumber of dangling nodes is large . Thus, it saves many computational cost and operations .

Author(s) : Yongxin Dong, Jianxin You, Yuehua Feng

Links : PDF - Abstract

Code :


Keywords : dangling - nodes - lumping - - large -

• Khan Academy Linear Algebra
• Practical Deep Learning for Coders – Part 1
• How to Win a Data Science Competition on Coursera
• Complete Python Bootcamp
• Kaggle Learning
• Khan Academy Matrices
• fast.ai Machine Learning
• Python for Everybody on Coursera