We will work with a Graph modularization problem in Excel and Gephi, than analyze the characteristics of the resulting clusters. Perhaps we will find something in the data we didn't uncover in Ch 2. Than if we have time, we can take a look at the beginning of Ch 6, Regression.
In a happy coincidence, the Cleveland Euler Project meetup will be working on Discrete Geometry problems on Friday evening at the Root cafe. Discrete Geometry is related to graph theory. This would be good for anyone wanting to get more practice with the math/algorithm side of working with Graphs.
This years GPU conference is streaming one keynote presentation a day for free, from this Tuesday to Thursday: