{"id":1219,"date":"2017-01-25T20:00:15","date_gmt":"2017-01-26T04:00:15","guid":{"rendered":"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/?p=1219"},"modified":"2017-01-25T19:16:05","modified_gmt":"2017-01-26T03:16:05","slug":"handouts-and-notes-20170127","status":"publish","type":"post","link":"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/2017\/01\/25\/handouts-and-notes-20170127\/","title":{"rendered":"Handouts and Notes 2017\/01\/27"},"content":{"rendered":"<p>Today we\u2019ll finish our kickoff exploration of graphs and move on to one or the other of the fun notes on the most &#8220;influential&#8221; node in a directed graph (AKA the Google Guide to How to Win at Search), and how to cluster nodes in an undirected graph (if an edge\u2019s weight denotes similarity)?<\/p>\n<ul>\n<li>Here are the very brief <a href=\"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/files\/2017\/01\/2017-01-25-pagerank.pdf\">&#8220;influential node&#8221; notes<\/a>.<\/li>\n<li>Here are the <a href=\"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/files\/2017\/01\/2017-01-27-clustering.pdf\">clustering notes<\/a>. (In case you&#8217;re wondering why you&#8217;re reading Chapter 4 and we&#8217;re still talking about graphs&#8230; these are also greedy algorithm notes! Graphs make an awesome domain for just about any algorithm.)<\/li>\n<li><strong>Assignment\u00a0#2 will\u00a0be posted at 5PM and due Fri 3 Feb\u00a0at 10PM<\/strong> on\u00a0GradeScope.\u00a0Be sure to <strong>indicate your whole group using GradeScope&#8217;s interface<\/strong> (not just by including the GradeScope login in your submission).<\/li>\n<li>For next time, please <strong>read Sections 4.1-4.2<\/strong>. (No pre-class quiz; the next one is due on Thursday 2 Feb.)<\/li>\n<li><strong>Just for fun<\/strong>: Our algorithm isn\u2019t Google\u2019s, 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 we\u00a0checked!), 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\u2019ll finish our kickoff exploration of graphs and move on to one or the other of the fun notes on the most &#8220;influential&#8221; node in a directed graph (AKA the Google Guide to How to Win at Search), and how to cluster nodes in an undirected graph (if an edge\u2019s weight denotes similarity)? Here &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/2017\/01\/25\/handouts-and-notes-20170127\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Handouts and Notes 2017\/01\/27&#8221;<\/span><\/a><\/p>\n","protected":false},"author":7560,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[318531,99],"tags":[],"class_list":["post-1219","post","type-post","status-publish","format-standard","hentry","category-handouts","category-readings"],"_links":{"self":[{"href":"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/wp-json\/wp\/v2\/posts\/1219","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/wp-json\/wp\/v2\/users\/7560"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/wp-json\/wp\/v2\/comments?post=1219"}],"version-history":[{"count":2,"href":"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/wp-json\/wp\/v2\/posts\/1219\/revisions"}],"predecessor-version":[{"id":1224,"href":"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/wp-json\/wp\/v2\/posts\/1219\/revisions\/1224"}],"wp:attachment":[{"href":"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/wp-json\/wp\/v2\/media?parent=1219"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/wp-json\/wp\/v2\/categories?post=1219"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.ubc.ca\/cpsc3202016w2\/wp-json\/wp\/v2\/tags?post=1219"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}