Introduction to Machine Learning and Data Mining — различия между версиями

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск
Строка 8: Строка 8:
Homework 1: Spam classification.  
Homework 1: Spam classification.  
Soft deadline (up to 10 points): <s>March 9</s>
Soft deadline (up to 10 points): <s>March 9</s> <span style="color:#ff0000">March 19</span>
Hard deadline (-2 points): <s>March 15</s>
Hard deadline (-2 points): <s>March 15</s> <span style="color:#ff0000">March 25</span>
=== Lecture on 23.01.2019===
=== Lecture on 23.01.2019===

Версия 15:58, 9 марта 2019

Lecturers: Dmitry Ignatov

TAs: Ivan Zaputliaev (Module 3 and 4), Alexander Korabelnikov (Module 4).


Homework 1: Spam classification.

Soft deadline (up to 10 points): March 9 March 19

Hard deadline (-2 points): March 15 March 25

Lecture on 23.01.2019

Intro slides.

Practice: demonstration with Orange.

Lecture on 06.02.2019

Slides: Introduction to classification techniques (1-rule, kNN, Naive Bayes, Logistic Regression).

Practice: demonstration with Orange and scikit-learn.

Lecture on 22.02.2019

Practice with scikit-learn (kNN, Naive Bayes, Logistic Regression, basic quality metrics, cross-validation, error plots)

Slides: Decision trees. Entropy and information gain. ID3 algorithm. Gini impurity. Tree pruning.

Lecture on 06.03.2019

Slides: 1. Clustering. K-means, k-medoids, fuzzy c-means. The number of clusters problem and related heuristics. Hierarchical clustering. Density-based clustering: DBscan and Mean-shift. 2. Spectral Clustering for graph partition. Min-cut, Laplace matrix, Fiedler vector. Bipartite spectral clustering.