Machine Learning and Data Analysis
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
AE4M33SAD | Z,ZK | 6 | 2+2c | Czech |
- Lecturer:
- Filip Železný (gar.)
- Tutor:
- Filip Železný (gar.)
- Supervisor:
- Department of Cybernetics
- Synopsis:
-
The course explains machine learning methods helpful for getting insight into data by automatically discovering interpretable data models such as graph- and rule-based. Emphasis is given to the modeling of relational data. The course will also address a theoretical framework explaining why/when the explained algorithms can in principle be expected to work.
- Requirements:
-
Topics contained in course A4B33RPZ.
For details see http://cw.felk.cvut.cz/doku.php/courses/m33sad/start
- Syllabus of lectures:
-
1. Cluster analysis, k-means algorithm, hierarchical clustering
2. Principal and independent component analysis.
3. Frequent itemset mining. the Apriori algorithm, association rules.
4. Frequent sequence mining. Episode rules. Sequence models.
5. Frequent subgraph search.
6. Learning from texts and web, applications.
7. Computational learning theory, concept space, PAC learning
8. PAC learning of logic forms
9. Classification rule learning. Algorithms AQ, CN2.
10. Inductive logic programming, least generalization, inverse entailment
11. Learning from logic interpretations, relational decision trees, relational features
12. Statistical relational learning: probablistic relational models
13. Statistical relational learning: Markov logic
14. Summary.
- Syllabus of tutorials:
-
1. Entry test (prerequisite course RPZ). SW tools for machine learning (RapidMiner, WEKA)
2. Data preprocessing, missing and outlying values, clustering
3. Hierarchical clustering, principal component analysis
4. Frequent itemset mining, association rules
5. Frequent sequence/subgraph mining.
6. Learning from texts.
7. Test (first half of the course). Learning Curve.
8. Underfitting and overfitting, ensemble classification, error estimates, cross-validation
9. Model selection and assessment, ROC analysis
10. Project work
11. Project work
12. Inductive logic programming: the Aleph system
13. Statistical relational learning: the Alchemy system
14. Credits
- Study Objective:
-
Learn principles of selected methods of data analysis methods and classifier learning, and elements of learning theory.
- Study materials:
-
T. Mitchell: Machine Learning, McGraw Hill, 1997
P. Langley: Elements of Machine Learning, Morgan Kaufman 1996
T. Hastie et al: The elements of Statistical Learning, Springer 2001
S. Džeroski, N. Lavrač: Relational Data Mining, Springer 2001
L. Getoor, B. Taskar (eds): Introduction to Statistical Relational
Learning, MIT Press 2007
V. Mařík et al. (eds): Umělá inteligence II, III, IV (Czech)
- Note:
- Time-table for winter semester 2011/2012:
- Time-table is not available yet
- Time-table for summer semester 2011/2012:
- Time-table is not available yet
- The course is a part of the following study plans:
-
- Open Informatics - Artificial Intelligence (compulsory course of the specialization)
- Open Informatics - Computer Vision and Image Processing (compulsory course of the specialization)