{"id":684,"date":"2016-09-28T15:30:22","date_gmt":"2016-09-28T22:30:22","guid":{"rendered":"https:\/\/blogs.ubc.ca\/cpsc320\/?p=684"},"modified":"2016-09-28T15:30:22","modified_gmt":"2016-09-28T22:30:22","slug":"lecture-notes-20160928","status":"publish","type":"post","link":"https:\/\/blogs.ubc.ca\/cpsc320\/2016\/09\/28\/lecture-notes-20160928\/","title":{"rendered":"Lecture Notes 2016\/09\/28"},"content":{"rendered":"<p>Today we&#8217;ll move on to two new questions about graphs: how do you find the most &#8220;influential&#8221; nodes in a directed graph (if an edge confers a small amount of influence from its tail to its head) AKA the Google Guide to How to Win at Search, and how do you cluster nodes in a graph (if an edge&#8217;s weight denotes similarity)?<\/p>\n<ul>\n<li>Here are<strong> <a href=\"https:\/\/blogs.ubc.ca\/cpsc320\/files\/2016\/09\/2016-09-28-pagerank-and-clustering.pdf\">today&#8217;s notes<\/a><\/strong>.<\/li>\n<li><strong><a href=\"https:\/\/blogs.ubc.ca\/cpsc320\/2016\/09\/28\/assignmentquiz-2-wed-noon-edition-and-full-version\/\">Your assignment<\/a> is posted and due Thu 6 Oct at 10PM<\/strong> on handin (under assn2). (Note the later due time!)<\/li>\n<li>For next time, please <strong>read Sections 4.1-4.2<\/strong>. (No pre-class quiz.)<\/li>\n<li><strong>Just for fun<\/strong>: We&#8217;ll try a little in-class experiment. Here&#8217;s\u00a0a\u00a0<strong><a href=\"http:\/\/goo.gl\/forms\/Mbg7E03iPV\">form for our experimental results<\/a><\/strong>.<\/li>\n<li><strong>Just for fun<\/strong>: Our algorithm isn&#8217;t Google&#8217;s, but it computes <strong>the same <a href=\"https:\/\/en.wikipedia.org\/wiki\/PageRank\">PageRank quantity<\/a><\/strong>.<\/li>\n<li><strong>Just for fun<\/strong>: <a href=\"http:\/\/www.cs.ubc.ca\/~lowe\/papers\/ijcv04.pdf\">UBC CS\u2019s most cited\u00a0paper<\/a> (last I checked!), by David Lowe, looks at how to find similar features between images using the SIFT algorithm.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Today we&#8217;ll move on to two new questions about graphs: how do you find the most &#8220;influential&#8221; nodes in a directed graph (if an edge confers a small amount of influence from its tail to its head) AKA the Google Guide to How to Win at Search, and how do you cluster nodes in a &hellip; <a href=\"https:\/\/blogs.ubc.ca\/cpsc320\/2016\/09\/28\/lecture-notes-20160928\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Lecture Notes 2016\/09\/28&#8221;<\/span><\/a><\/p>\n","protected":false},"author":7560,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[318531,99],"tags":[],"class_list":["post-684","post","type-post","status-publish","format-standard","hentry","category-handouts","category-readings"],"_links":{"self":[{"href":"https:\/\/blogs.ubc.ca\/cpsc320\/wp-json\/wp\/v2\/posts\/684","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.ubc.ca\/cpsc320\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.ubc.ca\/cpsc320\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.ubc.ca\/cpsc320\/wp-json\/wp\/v2\/users\/7560"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.ubc.ca\/cpsc320\/wp-json\/wp\/v2\/comments?post=684"}],"version-history":[{"count":1,"href":"https:\/\/blogs.ubc.ca\/cpsc320\/wp-json\/wp\/v2\/posts\/684\/revisions"}],"predecessor-version":[{"id":686,"href":"https:\/\/blogs.ubc.ca\/cpsc320\/wp-json\/wp\/v2\/posts\/684\/revisions\/686"}],"wp:attachment":[{"href":"https:\/\/blogs.ubc.ca\/cpsc320\/wp-json\/wp\/v2\/media?parent=684"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.ubc.ca\/cpsc320\/wp-json\/wp\/v2\/categories?post=684"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.ubc.ca\/cpsc320\/wp-json\/wp\/v2\/tags?post=684"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}