K-INFO
HU
EN
Login

Data Science - Part 1

Adatbányászat - 1
A tantárgyleírás hatályossága
Hatályosság kezdete:
2026. March 21.
Hatályosság vége:
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)
Course type lecture tutorial laboratory
hours (weekly) 0 0 2
type (linked/independent) autonomous course
Assessment type félévközi érdemjegy
Credits 2
Subject coordinator
DR. Katona Gyula
position: egyetemi tanár
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

Programme

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.

The aim of the course is to provide a basic but comprehensive introduction to data mining. By the end of the course, students will be able to build models, choose algorithms, and implement and evaluate them.  

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

  Handouts, PowerPoint presentations, relevant research papers, web page, course mailing list and Wiki. Weekly regular office hour for consultations.  

Tanulástámogató anyagok

Online források
Jiawei Han and Micheline Kamber: Data Mining: Concepts and Techniques, 2nd ed., Morgan Kaufmann Publishers, 2006.  ; Pang-Ning Tan, Michael Steinbach, Vipin Kumar: Introduction to Data Mining, Addison-Wesley, 2006.  ; T. Hastie, R. Tibshirani, J. H. Friedman: The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Springer-Verlag, 2001.  

Recommended preliminary knowledge for completing the subject

Knowledge type competencies
(azon előzetes ismeretek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
The course requires basic knowledge in calculus, probability theory, and linear algebra. Knowledge of graphs and basic algorithms is an advantage
Skill type competencies
(azon előzetes képességek és készségek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
nincs
Recommended (non-compulsory) preliminary competencies
(azon ajánlott (nem kötelező) előzetesen megszerzendő kompetenciák összessége, amelyek jelentősen hozzájárulnak a tantárgy eredményes teljesítéséhez)
The course requires basic knowledge in calculus, probability theory, and linear algebra. Knowledge of graphs and basic algorithms is an advantage
General rules
Requirements: At the end of the semester, there will be a comprehensive written test of the theory.  Grading will be based on the following criteria: Class participation & activity       30            points Comprehensive written test         70            points.  
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
Requirements valid from:
Requirements valid until:
Curriculum placement

No curriculum placements recorded for this subject version.