Data Mining
Academic year 2019–2020
"The success of companies like Google, Facebook, Amazon, and Netflix, not to mention Wall Street firms and industries from manufacturing and retail to healthcare, is increasingly driven by better tools for extracting meaning from very large quantities of data. 'Data Scientist' is now the hottest job title in Silicon Valley." – Tim O'Reilly
- Data Scientist: The Sexiest Job of the 21st Century (pdf)
- Find true love with data mining
The course will develop algorithms and statistical techniques for data analysis and mining, with emphasis on massive data sets such as large network data. It will cover the main theoretical and practical aspects behind data mining.
The goal of the course is twofold. First, it will present the main theory behind the analysis of data. Second, it will be hands-on and at the end students will become familiar with various state-of-the-art tools and techniques for analyzing data.
We will use Python for downloading data and implementing various algorithms using its rich libraries and frameworks such as Spark, Storm, Giraph, and TensorFlow for mining of large-scale data.
Prerequisites
Students who wish to take this course should be familiar with Python programming and with the MapReduce framework.
Announcements
Homework 4 is out. It is due on January 12.
Homework 3 is out. It is due on December 8.
Homework 2 is out. It is due on November 17.
Homework 1 is out. It is due on October 27.
We start classes on September 23.
Make sure to register to the class mailing list; if you haven't, email Aris.
Instructor
Aris Anagnostopoulos, Sapienza University of Rome.
Teaching Assistant (TA)
Andrea Mastropietro, Sapienza University of Rome.
When and where:
Monday 11.00–13.00, Room A3
Thursday 16.00–19.00, Room A6
Office hours
You can use the office hours for any question regarding the class material, past or current homeworks, general questions on data mining, the meaning of life, pretty much anything. Send an email to the instructor or the TA for arrangement.
Syllabus
Chapters for which no book is mentioned refer to the "Mining of Massive Datasets" (see below). For the other textbooks, we refer to with the author initials: A, ZM, ZAL, MRS.
| Date | Topic | Reading |
| September 23 | Introduction to data mining | Chapters 1.1, 1.3 Introduction to data mining |
| September 30 | Introduction to probability | A crash course on discrete probability Check the background probability chapters below |
| October 3 | Introduction to probability (cont.) | |
| October 7 | Running time of quicksort, similarity and distance measures | Book chapter on quicksort from the book of Mitzenmacher and Upfal on Probability and Computing, Chapter 3.5 |
| October 10 | Similarity and distance measures (cont.) | A Chapter 3.4 |
| October 14 | SText preprocessing, inverted index for boolean queries | MRS Chapters 1.0–1.4, 2.0–2.2 |
| October 17 | Scoring models and term weighting; use of inverted index for scoring and finding top-k documents, index construction | MRS Chapters 6.2, 7.1.0, Chapters 4.0–4.2 |
| October 21 | Index construction, brief recap of Hadoop, MapReduce, and Spark; construction of large indexes. | Quick introduction to MapReduce |
| October 24 | Near-duplicate document detection | Chapters 3.0–3.4 |
| October 28 | Near-duplicate document detection (cont.), introduction to clustering and k-means clustering | Chapters 7.0–7.1.2, 7.3.0–7.3.2. Chapter on k-means of the book of Christopher M. Bishop |
| October 31 | K-means convergence, k-means++/td> | Chapter on k-means of the book of Christopher M. Bishop. Paper by D. Arthur and S. Vassilvitskii |
| November 7 | k-means++ (cont.) | |
| November 11 | Modeling and maximum likelihood | Notes |
| November 14 | Modeling and maximum likelihood (cont.) | |
| November 18 | PCA and relationship with k-means | Notes |
| November 21 | PCA and relationship with k-means (cont.) | |
| November 25 | Introduction to neural networks | |
| November 28 | Laboratory on PyTorch | Lab notebooks |
| December 2 | Discussion about homework and introduction to word2vec | Original paper on word2vec |
| December 5 | word2vec (cont.) | |
| December 9 | Graph clustering | |
| December 12 | Centrality measures and PageRank | Chapter 5.1 |
| December 16 | Student presentations | |
| December 18 | Student presentations |
Homeworks
Check the "Examination format" section below for information about collaborating, being late, and so on.
Handing in: You must hand in the homeworks by the due date and time by an email to the TA that will contain as attachment (not links!) a .zip or .tar.gz file with all your answers and subject
[Data Mining class] Homework #
where # is the homework number. After you submit, you will receive an acknowledgement email that your homework has been received and at what date and time. If you have not received an acknowledgement email within 1 day after you submit then contact Mara.
The solutions for the theoretical exercises must contain your answers either typed up or hand written clearly and scanned.
The solutions for the programming assignments must contain the source code, instructions to run it, and the output generated (to the screen or to files).
We will not post the solutions online, but we will present them in class.
- Homework 1 (due: 27/10/2019, 23.59)
- Homework 2 (due: 17/11/2019, 23.59)
- Homework 3 (due: 8/12/2019, 23.59)
- Homework 4 (due: 12/1/2020, 23.59)
Project and survey
We will post more information during the semester..
Textbook and references
The main textbook is the "Mining of Massive Datasets," by J. Leskovec, A. Rajaraman, and J. D. Ullman. The printed version has been updated and you can download the latest version (currently 2.1) from the book's web site.
In addition, we will also use some chapters fro some other textbooks, all available online:
- C. Aggarwal, "Data Mining: The Textbook," Springer (must be downloaded from Sapienza)
- M. J. Zaki and W. Meira, Jr., "Data Mining and Analysis: Fundamental Concepts and Algorithms," Cambridge University Press
- R. Zafarani, M. A. Abbasi, and H. Liu, "Social Media Mining: An Introduction," Cambridge University Press
- C. D. Manning, P. Raghavan and H. Schütze, "Introduction to Information Retrieval," Cambridge University Press
Finally, we will cover material from various sources, which we will post online as the course proceeds.
Python resources
The main programming language that we will use in the course is Python. There are currently two main versions of Python, version 2.7 and version 3.6, which are slightly incompatible, but it is easy to translate programs from one version to the other. Even though version 3.6 is newer and better designed, version 2.7 is still more widely used and most available libraries are written for it. Therefore, in the class we will use Python 2.7.
To learn the language you can find a lot of material online. You can start from Python's documentation site: http://docs.python.org/2.7.
If you would like to buy some books, you can check the
- "Learning Python, 5th edition," by Mark Lutz. It is a bit verbose, but it presents well the features of the language.
- "Python Pocket Reference, 5th edition," by Mark Lutz. It is usefull as a quick reference if you know more or less the language and you are searching for some information.
We will use several libraries in the class. The Anaconda distribution has packaged all of them together and you can download it for free.
If you have problems with Python installation you can obtain an ubuntu virtual machine with Python preinstalled. Contact the instructor for more information.
Notes, slides, and other material
Book chapters and notes:
26/09/2019: Background reading on combinatorics, basic probability, random variables, and basic probability distributions.
Examination format
The evaluation will consist of two parts:
- 4 sets of homeworks
- A final project or a survey and presentation. Details will be given during the course
Late policy: Every homework must be returned by the due date. Homeworks that are late will lose 10% of the grade if they are up to 1 day (24h) late, 20% if they are 2 days late, 30% if they are 3 days late, and they will receive no credit if they are late for more than 3 days. However, you have a bonus of 10 late days, which you can distribute as you wish among all the homeworks. The homeworks will be discussed and graded at the end, during the final exam.
In addition, we will take into account participation during class.
Collaboration policy (read carefully!): You can discuss with other students of the course about the homeworks. However, you must understand well your solutions and the final writeup must be yours and written in isolation. In addition, even though you may discuss about how you could implement an algorithm, what type of libraries to use, and so on, the final code must be yours. You may also consult the internet for information, as long as it does not reveal the solution. If a question asks you to design and implement an algorithm for a problem, it's fine if you find information about how to resolve a problem with character encoding, for example, but it is not fine if you search for the code or the algorithm for the problem you are being asked. For the projects, you can talk with other students of the course about questions on the programming language, libraries, some API issue, and so on, but both the solutions and the programming must be yours. If we find out that you have violated the policy and you have copied in any way you will automatically fail. If you have any doubts about whether something is allowed or not, ask the instructor.