Difference between revisions of "Class meeting for 10-605 2012 03 06"
From Cohen Courses
Jump to navigationJump to search| Line 14: | Line 14: | ||
=== Optional === | === Optional === | ||
* [http://www.cs.cmu.edu/~wcohen/postscript/nipsws-2007.pdf Online Stacked Graphical Learning], Zhenzhen Kou, Vitor Carvalho and William W. Cohen (2007), in SDM-2007. | * [http://www.cs.cmu.edu/~wcohen/postscript/nipsws-2007.pdf Online Stacked Graphical Learning], Zhenzhen Kou, Vitor Carvalho and William W. Cohen (2007), in SDM-2007. | ||
| − | * [http://dl.acm.org/citation.cfm?id=1150479 Samping from | + | * [http://dl.acm.org/citation.cfm?id=1150479 Samping from Large Graphs], Jure Leskovec and Christos Faloutsos, KDD 2006. |
Revision as of 18:43, 5 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
- to be posted
- Properties of natural graphs
- to be posted
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.
