https://wiki.extremist.software/index.php?action=history&feed=atom&title=Machine_Learning%2FKaggle_Social_Network_Contest%2Flit_review 2026-04-07T05:31:46Z Revision history for this page on the wiki MediaWiki 1.39.13 https://wiki.extremist.software/index.php?title=Machine_Learning/Kaggle_Social_Network_Contest/lit_review&diff=14385&oldid=prev 2010-11-20T04:30:45Z

<p>Created page with &#039;This page contains links to relevant articles and summaries of the papers. == Papers == === Supervised Random Walks === * title: &quot;Supervised Random Walks: Predicting and Recom…&#039;</p> <p><b>New page</b></p><div>This page contains links to relevant articles and summaries of the papers.<br /> <br /> == Papers ==<br /> <br /> === Supervised Random Walks === <br /> * title: &quot;Supervised Random Walks: Predicting and Recommending Links in Social Networks&quot;<br /> * authors: Lars Backstrom and Jure Leskovec<br /> * [http://arxiv.org/abs/1011.4071 paper]<br /> * &#039;&#039;&#039;Summary&#039;&#039;&#039;<br /> ** develop an algorithm based on Supervised Random Walks<br /> ** uses network structure info combined with node and edge level attributes to guide the walk<br /> ** learn a function to weight edges s.t. random walker more likely to visit nodes to which new links will be created (equivalent to missing nodes for our application)<br /> ** they develop a good training algorithm.<br /> ** test it on a facebook network and on co-author network<br /> ** compare to decision trees, logistic regression and unsupervised techniques.</div>

Jjhale