Difference between revisions of "Class meeting for 10-605 Workflows For Hadoop"

From Cohen Courses
Jump to navigationJump to search
Line 4: Line 4:
  
 
* First lecture: Slides [http://www.cs.cmu.edu/~wcohen/10-605/workflows-1.pptx in Powerpoint], [http://www.cs.cmu.edu/~wcohen/10-605/workflows-1.pdf in PDF].
 
* First lecture: Slides [http://www.cs.cmu.edu/~wcohen/10-605/workflows-1.pptx in Powerpoint], [http://www.cs.cmu.edu/~wcohen/10-605/workflows-1.pdf in PDF].
 +
* Second lecture: Slides [http://www.cs.cmu.edu/~wcohen/10-605/workflows-2.pptx in Powerpoint], [http://www.cs.cmu.edu/~wcohen/10-605/workflows-2.pdf in PDF].
  
 
To be updated:
 
To be updated:
* Second lecture: Slides [http://www.cs.cmu.edu/~wcohen/10-605/2016/workflow-2.pptx in Powerpoint], [http://www.cs.cmu.edu/~wcohen/10-605/2016/workflow-2.pdf in PDF].
+
 
 
* Third lecture: Slides [http://www.cs.cmu.edu/~wcohen/10-605/2016/workflow-3.pptx in Powerpoint], [http://www.cs.cmu.edu/~wcohen/10-605/2016/workflow-3.pdf in PDF].
 
* Third lecture: Slides [http://www.cs.cmu.edu/~wcohen/10-605/2016/workflow-3.pptx in Powerpoint], [http://www.cs.cmu.edu/~wcohen/10-605/2016/workflow-3.pdf in PDF].
  

Revision as of 11:18, 14 September 2017

This is one of the class meetings on the schedule for the course Machine Learning with Large Datasets 10-605 in Fall_2017.

Slides

To be updated:

Quizzes

Readings

Also discussed

Things to Remember

  • The TFIDF representation for documents.
  • The Rocchio algorithm.
  • Why Rocchio is easy to parallelize.
  • Definition of a similarity join/soft join.
  • Why inverted indices make TFIDF representations useful for similarity joins
    • e.g., whether high-IDF words have shorter or longer indices, and more or less impact in a similarity measure