Here is a sample solution to the categorization notes. As always, please use this to help you catch up on and understand points from working them in class, but not to avoid grappling with the questions yourself!
Handouts and Notes 2017/01/30
Today we’ll start work on our categorization problem. Just one new note: read Sections 4.3-4.4 for Wednesday. (The next pre-class quiz isn’t due until Thursday.)
Assignment 2 (complete as of Fri 1600 tutorial)
The full assignment #2 link is below. Please be sure you read the Piazza post on how to submit on GradeScope!
Thu 11 AM Quiz Question
Here is the Thu 11AM quiz question.
REMINDER: We won’t be posting more quiz questions this week; instead, we’ll post the full assignment at the end of the last tutorial tomorrow.
Handouts and Notes 2017/01/27
Today we’ll finish our kickoff exploration of graphs and move on to one or the other of the fun notes on the most “influential” 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’s weight denotes similarity)?
- Here are the very brief “influential node” notes.
- Here are the clustering notes. (In case you’re wondering why you’re reading Chapter 4 and we’re still talking about graphs… these are also greedy algorithm notes! Graphs make an awesome domain for just about any algorithm.)
- Assignment #2 will be posted at 5PM and due Fri 3 Feb at 10PM on GradeScope. Be sure to indicate your whole group using GradeScope’s interface (not just by including the GradeScope login in your submission).
- For next time, please read Sections 4.1-4.2. (No pre-class quiz; the next one is due on Thursday 2 Feb.)
- Just for fun: Our algorithm isn’t Google’s, but it computes the same PageRank quantity.
- Just for fun: UBC CS’s most cited paper (last we checked!), by David Lowe, looks at how to find similar features between images using the SIFT algorithm.
Wed 1PM Quiz Question
Here is the Wed 1PM quiz question.
Tue 1PM Quiz Question
Here is the Tue 1PM quiz question.
Handouts and Notes for 2017/01/25
We’re continuing to play with graphs today. We may finish. Just in case, we also include a tiny set of fun notes on some mysterious definition of “the most important node” in a graph. Surely this definition isn’t the starting point for a modern juggernaut of the computing industry!
- Here is the fun handout on the “most important node” in a weighted, directed graph. (Note: There’s no sample solution to this, as it’s just a way to emphasize the value of exploring a problem and looking for a promising metric of what’s “good”.)
- Remember to attend your tutorial quiz this week. Also, you can get started on the assignment pieces as they’re posted after each tutorial. (The full assignment, with LaTeX source, will be posted after the last tutorial.)
- Finish reading Chapter 3 (so, 3.5 and 3.6, on directed graphs) for Friday.
- The pre-class quiz for Tuesday was rescheduled to Thursday. (Sorry for the mixed-up early deadline. Here’s hoping the extension comes as a pleasant surprise!)
Sample Solution to Graph Play Notes
Here is a sample solution to our graph play notes (about articulation points and diameter).
Quiz/Assignment 2 Pre-Reading
Here are problem domains to help you prepare for Quiz 2 (and therefore for Assignment 2). We recommend you spend a few minutes reading through all of them before your tutorial!