A tantárgyleírás hatályossága
| Subject name (Hungarian, English) |
Adatbányászat - 1
Data Science - Part 1
|
||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Subject code | BMEVISZA083 | ||||||||||||
| Subject type | — | ||||||||||||
| Training Level | — | ||||||||||||
| Course types and hours (weekly/semester) |
|
||||||||||||
| Assessment type | félévközi érdemjegy | ||||||||||||
| Credits | 2 | ||||||||||||
| Subject coordinator |
DR. Katona Gyula
position: egyetemi tanár
contact:
katona.gyula@vik.bme.hu
|
||||||||||||
| Responsible department |
Számítástudományi és Információelméleti Tanszék
|
||||||||||||
| Faculty | Villamosmérnöki és Informatikai Kar | ||||||||||||
| Subject website | www.cs.bme.hu/.... | ||||||||||||
| Primary curriculum type | — | ||||||||||||
| Direct prerequisites – Strong prerequisite | none | ||||||||||||
| Direct prerequisites – Weak prerequisite | none | ||||||||||||
| Direct prerequisites – Parallel prerequisite | none | ||||||||||||
| Direct prerequisites – Milestone prerequisite | none | ||||||||||||
| Direct prerequisites – Exclusion | none |
Objectives
1. Motivations for data mining. Examples of application domains. Methodology of knowledge discovery in databases (KDD) and data mining (DM). Formulation of main problems of data mining.
2. Understanding data: preparation and exploration. Sampling.
3. Basics of classification. Concepts of training and prediction. Decision trees.
4. Models and algorithms for classification: k-NN, naïve-Bayes. Measuring quality and comparison of classification models.
5. Introduction to the WEKA data mining software. Classification with WEKA.
6. More models and algorithms for classification: neural networks, linear separation methods, support vector machine (SVM).
7. Feature selection: filter and wrapper methods. Midterm test.
8. Basics of cluster analysis. Type of variables, measuring similarity and distances. Partitioning clustering algorithms, k-means, k-medoids.
9. Hierarchical clustering algorithms. Density based clustering, DBSCAN, OPTICS. Cluster analysis with WEKA.
10. Introduction to frequent itemset mining. Applications for finding association rules.
11. Level-wise algorithms, APRIORI. Partitioning and Toivonen algorithms.
12. Pattern growth methods, FP-growth. Constraints handling.
13. Hierarchical and general association rules. Pattern mining with WEKA.
14. Sequental and subgraph patterns. Final test.
Learning outcomes
Ez a tantárgy a KKK rendeletben meghatározott, következő kompetenciák fejlesztését szolgálja:
Knowledge
No learning outcomes recorded.
Skills
No learning outcomes recorded.
Attitudes
No learning outcomes recorded.
Autonomy and responsibility
No learning outcomes recorded.
Oktatási módszertan
Tanulástámogató anyagok
Online források
Recommended preliminary knowledge for completing the subject
General rules
Assessment methods
In-term assessments
No detailed assessments provided.
Weight of in-term assessments
No weights provided.
Exam-period assessments
No detailed assessments provided.
Weight of exam elements
No weights provided.
Grade calculation
No grade thresholds provided.
Attendance requirements
No attendance requirements provided.
Rules for retake and resubmission
Not provided.
Short description
Not provided.
Detailed description
Not provided.
Recommended courses
Not provided.
Workload to complete the subject
No workload breakdown provided.
Validity of subject requirements
Curriculum placement
No curriculum placements recorded for this subject version.