252-0535-00L Machine Learning
Semester | Autumn Semester 2017 |
Lecturers | J. M. Buhmann |
Periodicity | yearly recurring course |
Language of instruction | English |
Courses
Number | Title | Hours | Lecturers | |||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
252-0535-00 V | Machine Learning Vorlesung: Donnerstag im ML D 28 mit Videoübertragung im ML E 12 Freitag im HG F 1 mit Videoübertragung im HG F 3 | 3 hrs |
| J. M. Buhmann | ||||||||||||
252-0535-00 U | Machine Learning | 2 hrs |
| J. M. Buhmann | ||||||||||||
252-0535-00 A | Machine Learning Project Work, no fixed presence required. | 2 hrs | J. M. Buhmann |
Catalogue data
Abstract | Machine learning algorithms provide analytical methods to search data sets for characteristic patterns. Typical tasks include the classification of data, function fitting and clustering, with applications in image and speech analysis, bioinformatics and exploratory data analysis. This course is accompanied by practical machine learning projects. |
Learning objective | Students will be familiarized with the most important concepts and algorithms for supervised and unsupervised learning; reinforce the statistics knowledge which is indispensible to solve modeling problems under uncertainty. Key concepts are the generalization ability of algorithms and systematic approaches to modeling and regularization. A machine learning project will provide an opportunity to test the machine learning algorithms on real world data. |
Content | The theory of fundamental machine learning concepts is presented in the lecture, and illustrated with relevant applications. Students can deepen their understanding by solving both pen-and-paper and programming exercises, where they implement and apply famous algorithms to real-world data. Topics covered in the lecture include: - Bayesian theory of optimal decisions - Maximum likelihood and Bayesian parameter inference - Classification with discriminant functions: Perceptrons, Fisher's LDA and support vector machines (SVM) - Ensemble methods: Bagging and Boosting - Regression: least squares, ridge and LASSO penalization, non-linear regression and the bias-variance trade-off - Non parametric density estimation: Parzen windows, nearest nieghbour - Dimension reduction: principal component analysis (PCA) and beyond |
Lecture notes | No lecture notes, but slides will be made available on the course webpage. |
Literature | C. Bishop. Pattern Recognition and Machine Learning. Springer 2007. R. Duda, P. Hart, and D. Stork. Pattern Classification. John Wiley & Sons, second edition, 2001. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning: Data Mining, Inference and Prediction. Springer, 2001. L. Wasserman. All of Statistics: A Concise Course in Statistical Inference. Springer, 2004. |
Prerequisites / Notice | The course requires solid basic knowledge in analysis, statistics and numerical methods for CSE as well as practical programming experience for solving assignments. Students should at least have followed one previous course offered by the Machine Learning Institute (e.g., CIL or LIS) or an equivalent course offered by another institution. |
Performance assessment
Performance assessment information (valid until the course unit is held again) | |
Performance assessment as a semester course | |
ECTS credits | 8 credits |
Examiners | J. M. Buhmann |
Type | session examination |
Language of examination | English |
Repetition | The performance assessment is only offered in the session after the course unit. Repetition only possible after re-enrolling. |
Mode of examination | written 180 minutes |
Additional information on mode of examination | 70% schriftliche Sessionsprüfung, 30% Projekt; Das Projekt hat eine Bonuswirkung und muss bei Repetition neu durchgeführt werden. // 70% written session examination, 30% project; The project counts as a bonus and has to be rerun in case of a repetition. The practical projects are an integral part (60 hours of work, 2 credits) of the course. Participation is mandatory. Failure to participate results in a failing grade for the overall examination of Machine Learning (252-0535-00L). Students who do not participate in the projects are required to de-register from the exam and will otherwise be treated as a no show. |
Written aids | Two A4-pages (i.e. one A4-sheet of paper), either handwritten or 11 point minimum font size. |
This information can be updated until the beginning of the semester; information on the examination timetable is binding. |
Learning materials
Main link | Information |
Only public learning materials are listed. |
Groups
No information on groups available. |
Restrictions
There are no additional restrictions for the registration. |