Difference between revisions of "Class meeting for 10-605 2012 03 06"
From Cohen Courses
Jump to navigationJump to search (→Slides) |
|||
| Line 4: | Line 4: | ||
* Classification in graphs: stacking for classifying WebSpam | * Classification in graphs: stacking for classifying WebSpam | ||
| − | ** | + | ** [http://www.cs.cmu.edu/~wcohen/10-605/2012-03-06-stacking.pptx Powerpoint] |
| + | ** [http://www.cs.cmu.edu/~wcohen/10-605/2012-03-06-stacking.pdf PDF] | ||
* Properties of natural graphs | * Properties of natural graphs | ||
| − | ** | + | ** [http://www.cs.cmu.edu/~wcohen/10-605/2012-03-06-graphs.pptx Powerpoint] |
| + | ** [http://www.cs.cmu.edu/~wcohen/10-605/2012-03-06-graphs.pdf PDF] | ||
=== Readings === | === Readings === | ||
Latest revision as of 09:52, 20 March 2012
This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Spring_2012.
Slides
- Classification in graphs: stacking for classifying WebSpam
- Properties of natural graphs
Readings
- Know your neighbors: web spam detection using the web topology, Carlos Castillo, Debora Donato, Aristides Gionis, Vanessa Murdock. Fabrizio Silvestri, SIGIR 2007.
- Stacked Graphical Models for Efficient Inference in Markov Random Fields, Zhenzhen Kou and William W. Cohen (2007), in SDM-2007.
Optional
- Online Stacked Graphical Learning, Zhenzhen Kou, Vitor Carvalho and William W. Cohen (2007), in SDM-2007.
- Samping from Large Graphs, Jure Leskovec and Christos Faloutsos, KDD 2006.
