PPT-CSCI 6900: Mining Massive Datasets

Shannon Quinn with thanks to William Cohen of Carnegie Mellon and Jure Leskovec of Stanford Big Data Astronomy Sloan Digital Sky Survey New Mexico 2000 140TB over 10 years Large Synoptic Survey Telescope. MapReduce. Shannon Quinn. Today. Naïve . Bayes. with huge feature sets. i.e. ones that don’t fit in memory. Pros and cons of possible approaches. Traditional “DB” (actually, key-value store). Course Introduction. Mining of Massive Datasets. Jure Leskovec, . Anand. . Rajaraman. , Jeff Ullman . Stanford University. http://www.mmds.org . Note to other teachers and users of these . slides:. We . Shannon Quinn. (with content graciously and viciously borrowed from William Cohen’s 10-605. Machine Learning with Big Data and Stanford’s MMDS MOOC . http://www.mmds.org/. ). “Big Data”. Astronomy. MMDS . Secs. . 3.2-3.4. . Slides adapted from: . J. . Leskovec. , A. . Rajaraman. , J. Ullman: Mining of Massive Datasets, . http://www.mmds.org. October 2014. Task: Finding . Similar Documents. Goal:. (Part 1). Mining of Massive Datasets. Jure Leskovec, . Anand. . Rajaraman. , Jeff Ullman . Stanford University. http://www.mmds.org . Note to other teachers and users of these . slides:. We . would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs. (Part . 2). Mining of Massive Datasets. Jure Leskovec, . Anand. . Rajaraman. , Jeff Ullman . Stanford University. http://www.mmds.org . Note to other teachers and users of these . slides:. We . would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs. SVD & CUR. Mining of Massive Datasets. Jure Leskovec, . Anand. . Rajaraman. , Jeff Ullman . Stanford University. http://www.mmds.org . Note to other teachers and users of these . slides:. We . would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs. Jure Leskovec, . Anand. . Rajaraman. , Jeff Ullman . Stanford University. http://www.mmds.org . Note to other teachers and users of these . slides:. We . would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs. 2). Mining of Massive Datasets. Jure Leskovec, . Anand. . Rajaraman. , Jeff Ullman . Stanford University. http://www.mmds.org . Note to other teachers and users of these . slides:. We . would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs. t. e. n. t. -based Systems & Collaborative Filtering. Mining of Massive Datasets. Jure Leskovec, . Anand. . Rajaraman. , Jeff Ullman . Stanford University. http://www.mmds.org . Note to other teachers and users of these . Mining of Massive Datasets. Jure Leskovec, . Anand. . Rajaraman. , Jeff Ullman . Stanford University. http://www.mmds.org . Note to other teachers and users of these . slides:. We . would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs. Decision Trees on MapReduce CS246: Mining Massive Datasets Jure Leskovec, Stanford University http://cs246.stanford.edu Decision Tree Learning Give one attribute (e.g., lifespan), try to predict the value of new people’s lifespans by means of some of the other available attribute Frequent Itemset Mining & Association Rules Mining of Massive Datasets Jure Leskovec, Anand Rajaraman , Jeff Ullman Stanford University http://www.mmds.org Note to other teachers and users of these Ranking Nodes on the Graph. Web pages are not equally “important”. www.joe-schmoe.com. vs. . www.stanford.edu. . Since there is large diversity . in the connectivity of the . web graph we can .