Data analysis (Software Engineering) 2019
Scores
Slack Invite Link
Anonymous feedback form: here
Previous Course Page
Course repo
Содержание
Course description
In this class we consider the main problems of data mining and machine learning: classification, clustering, regression, dimensionality reduction, ranking, collaborative filtering. We will also study mathematical methods and concepts which data analysis is based on as well as formal assumptions behind them and various aspects of their implementation.
A significant attention is given to practical skills of data analysis that will be developed on seminars by studying the Python programming language and relevant libraries for scientific computing.
The knowledge of linear algebra, real analysis and probability theory is required.
The class consists of:
- Lectures and seminars
- Practical and theoretical homework assignments
- A machine learning competition (more information will be available later)
- Midterm theoretical colloquium
- Final exam
Colloquium
Colloquium will be held on the 1th and 2nd of April during seminars and lecture
You may not use any materials during colloquium, except single A4 prepared before the exam and handwritten personally by you (from two sides). You will have 2 questions from question list with 20 minutes for preparation and may receive additional questions or tasks.
We are having serious time limits, so come at your seminar or earlier seminar.
Course Schedule (3rd module)
Seminars
Dates: Mondays (21.01, 28.01, 04.02, 11.02, 18.02, 25.02, 18.03)
- Group BPI-161, 10:30-11:50, Room 507
- Group BPI-162, 12:10-13:30, Room 311
- Group BPI-163, 13:40-15:00, Room 435
Lectures
Dates: Tuesdays (15.01, 22.01, 29.01, 05.02, 12.02, 19.02, 12.03, 19.03)
- 9:00-10:20, Room 317
Complete Schedule of Software Engineering
Lecture materials
Lecture 1. Introduction to data science and machine learning
Slides
Lecture 2. Cross-validation. Metric-based models. KNN
Slides
Lecture 3. Decision Trees
Slides
Lecture 4. Linear Regression, Gradient-based optimization
Slides
Lecture 5. Regularization, Linear Classification
Slides
Lecture 6. Supervised Quality Measures
Slides
Lecture 7. Support Vector Machines. Kernel Trick
Slides
Seminars
Seminar 1. Introduction to Data Analysis in Python
Practice in class
Practical task 1, upload link, Due Date: 29.01.2019 23:59
Additional materials: 1, 2
Seminar 2. Metric-based methods
Practice in class
Theoretical task 1
Practical task 2
Seminar 3. Decision Trees
Practice in class, titanic.csv
Theoretical task 2
Practical task 3, data.csv, upload link Due Date: 19.02.2019 23:59
Seminar 4. Linear Regression
Practice in class, dataset.csv
Theoretical task 3, upload link Due Date: 24.02.2019 23:59
Seminar 5. Linear Classification
Practice in class
Practical task 4, audit_risk.csv, upload link Due Date: 10.03.2019 23:59
Theoretical task 4, upload link Due Date: 04.03.2019 23:59
Seminar 6. Supervised quality measures
Practice in class
Theoretical task 5, upload link Due Date: 24.03.2019 23:59
To ease examination process for our course assistants, please, put your subgroup number in the beginning of solution filenames
Example: 165-1-shestakov-andrey.ipynb
Evaluation criteria
The course lasts during the 3rd and 4th modules. Knowledge of students is assessed by evaluation of their home assignments and exams. Home assignments divide into theoretical tasks and practical tasks. There are two exams during the course – after the 3rd module and after the 4th module respectively. Each of the exams evaluates theoretical knowledge and understanding of the material studied during the respective module.
Grade takes values 4,5,…10. Grades, corresponding to 1,2,3 are assumed unsatisfactory. Exact grades are calculated using the following rule:
- score ≥ 35% => 4,
- score ≥ 45% => 5,
- ...
- score ≥ 95% => 10,
where score is calculated using the following rule:
score = 0.7 * S_{cumulative} + 0.3 * S_{exam2}
cumulative score = 0.8 * S_{homework} + 0.2 * S_{exam1} + 0.2 * S_{competition}
- S_{homework} – proportion of correctly solved homework,
- S_{exam1} – proportion of successfully answered theoretical questions during exam after module 3,
- S_{exam2} – proportion of successfully answered theoretical questions during exam after module 4,
- S_{competition} – score for the competition in machine learning (it's also from 0 to 1).
Participation in machine learning competition is optional and can give students extra points.
"Automative" passing of the course based on cumulative score may be issued.
Plagiarism
In case of discovered plagiarism zero points will be set for the home assignemets - for both works, which were found to be identical. In case of repeated plagiarism by one and the same person a report to the dean will be made.
Deadlines
Assignments sent after late deadlines will not be scored (assigned with zero score) in the absence of legitimate reasons for late submission which do not include high load on other classes.
Structure of emails and homework submissions
Practical assignments must be implemented in jupyter notebook format, theoretical ones in pdf. Practical assignments must use Python 3 (or Python 3 compatible). Use your surname as a filename for assignments (e.g. Ivanov.ipynb). Do not archive your assignments.
Assignments can be performed in either Russian or English.
Assignments can be submitted only once!
Useful links
Machine learning, Stats, Maths
- Machine learning course from Evgeny Sokolov on Github
- machinelearning.ru
- Video-lectures of K. Vorontsov on machine learning
- Some books for ML1
- Some books for ML2
- Math for ML
- One of classic ML books. Elements of Statistical Learning (Trevor Hastie, Robert Tibshirani, Jerome Friedman)
- Linear Algebra Immersive book
Python
- Official website
- Libraries: NumPy, Pandas, SciKit-Learn, Matplotlib.
- A little example for the begginers: краткое руководство с примерами по Python 2
- Python from scratch: A Crash Course in Python for Scientists
- Lectures Scientific Python
- A book: Wes McKinney «Python for Data Analysis»
- Коллекция интересных IPython ноутбуков