{"title":"MapReduce and the New Software Stack","authors":"","doi":"10.1017/9781108684163.003","DOIUrl":"https://doi.org/10.1017/9781108684163.003","url":null,"abstract":"","PeriodicalId":424397,"journal":{"name":"Mining of Massive Datasets","volume":"63 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120821062","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Large-Scale Machine Learning","authors":"Sanjiv Kumar","doi":"10.1017/9781108684163.013","DOIUrl":"https://doi.org/10.1017/9781108684163.013","url":null,"abstract":"Course Outline: This course will explore the mathematical foundations of a rapidly evolving new field: large-scale machine learning and optimization. We will focus on recent texts in machine learning, optimization, and randomized algorithms, with the goal to understand the tradeoffs that are driving algorithmic design in this new discipline. These trade-offs will revolve around statistical accuracy, scalability, algorithmic complexity, and implementation.","PeriodicalId":424397,"journal":{"name":"Mining of Massive Datasets","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116317032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Frequent Itemsets","authors":"J. Leskovec, A. Rajaraman, Jeffrey D. Ullman","doi":"10.1017/cbo9781139924801.007","DOIUrl":"https://doi.org/10.1017/cbo9781139924801.007","url":null,"abstract":"We turn in this chapter to one of the major families of techniques for characterizing data: the discovery of frequent itemsets. This problem is often viewed as the discovery of \" association rules, \" although the latter is a more complex characterization of data, whose discovery depends fundamentally on the discovery of frequent itemsets. To begin, we introduce the \" market-basket \" model of data, which is essentially a many-many relationship between two kinds of elements, called \" items \" and \" baskets, \" but with some assumptions about the shape of the data. The frequent-itemsets problem is that of finding sets of items that appear in (are related to) many of the same baskets. The problem of finding frequent itemsets differs from the similarity search discussed in Chapter 3. Here we are interested in the absolute number of baskets that contain a particular set of items. In Chapter 3 we wanted items that have a large fraction of their baskets in common, even if the absolute number of baskets is small. The difference leads to a new class of algorithms for finding frequent item-sets. We begin with the A-Priori Algorithm, which works by eliminating most large sets as candidates by looking first at smaller sets and recognizing that a large set cannot be frequent unless all its subsets are. We then consider various improvements to the basic A-Priori idea, concentrating on very large data sets that stress the available main memory. Next, we consider approximate algorithms that work faster but are not guaranteed to find all frequent itemsets. Also in this class of algorithms are those that exploit parallelism, including the parallelism we can obtain through a MapReduce formulation. Finally, we discuss briefly how to find frequent itemsets in a data stream.","PeriodicalId":424397,"journal":{"name":"Mining of Massive Datasets","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114865623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Neural Nets and Deep Learning","authors":"J. Leskovec, A. Rajaraman, Jeffrey D. Ullman","doi":"10.1017/9781108684163.014","DOIUrl":"https://doi.org/10.1017/9781108684163.014","url":null,"abstract":"","PeriodicalId":424397,"journal":{"name":"Mining of Massive Datasets","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130624975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Advertising on the Web","authors":"","doi":"10.1017/9781108684163.009","DOIUrl":"https://doi.org/10.1017/9781108684163.009","url":null,"abstract":"","PeriodicalId":424397,"journal":{"name":"Mining of Massive Datasets","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116972715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mining Data Streams","authors":"GaberMohamed Medhat, ZaslavskyArkady, KrishnaswamyShonali","doi":"10.1017/9781108684163.005","DOIUrl":"https://doi.org/10.1017/9781108684163.005","url":null,"abstract":"The recent advances in hardware and software have enabled the capture of different measurements of data in a wide range of fields. These measurements are generated continuously and in a very high f...","PeriodicalId":424397,"journal":{"name":"Mining of Massive Datasets","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116856655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}