Difference between revisions of "BSc: Data Mining"
Jump to navigation
Jump to search
(Created page with "= Data Mining = * <span>'''Course name:'''</span> Data Mining * <span>'''Course number:'''</span> XYZ * <span>'''Knowledge area:'''</span> Data Science == Administrative det...") |
|||
(4 intermediate revisions by 3 users not shown) | |||
Line 21: | Line 21: | ||
== Prerequisites == |
== Prerequisites == |
||
− | * Mathematical Analysis I |
+ | * [https://eduwiki.innopolis.university/index.php/BSc:_Mathematical_Analysis_I CSE201 — Mathematical Analysis I] |
− | * Mathematical Analysis II |
+ | * [https://eduwiki.innopolis.university/index.php/BSc:_Mathematical_Analysis_II CSE201 — Mathematical Analysis II] |
− | * |
+ | * [https://eduwiki.innopolis.university/index.php/BSc:_Analytic_Geometry_And_Linear_Algebra_I CSE202 — Analytical Geometry and Linear Algebra I] |
− | * Analytic Geometry |
+ | * [https://eduwiki.innopolis.university/index.php/BSc:_Analytic_Geometry_And_Linear_Algebra_II CSE204 — Analytic Geometry And Linear Algebra II] |
− | * Probability |
+ | * [https://eduwiki.innopolis.university/index.php/BSc:_Probability_And_Statistics CSE206 — Probability And Statistics] |
− | * Data Structures and Algorithms |
+ | * [https://eduwiki.innopolis.university/index.php/BSc:_Data_Structures_Algorithms CSE117 — Data Structures and Algorithms] |
+ | * [https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics CSE113 — Philosophy I - (Discrete Math and Logic)] |
||
− | * Data Structures and Algorithms II |
||
− | * Discrete Math and Logic |
||
== Course outline == |
== Course outline == |
Latest revision as of 15:59, 26 April 2022
Data Mining
- Course name: Data Mining
- Course number: XYZ
- Knowledge area: Data Science
Administrative details
- Faculty: Computer Science and Engineering
- Year of instruction: 3rd year of BS
- Semester of instruction: 2nd semester
- No. of Credits: 4 ECTS
- Total workload on average: 144 hours overall.
- Class lecture hours: 2 per week.
- Class tutorial hours: 0
- Lab hours: 2 per week.
- Individual lab hours: 2 per week
- Frequency: weekly throughout the semester.
- Grading mode: letters: A, B, C, D.
Prerequisites
- CSE201 — Mathematical Analysis I
- CSE201 — Mathematical Analysis II
- CSE202 — Analytical Geometry and Linear Algebra I
- CSE204 — Analytic Geometry And Linear Algebra II
- CSE206 — Probability And Statistics
- CSE117 — Data Structures and Algorithms
- CSE113 — Philosophy I - (Discrete Math and Logic)
Course outline
This course is designed for undergraduate students to provide core techniques of data processing and applications. Data Mining is an analytic process, which explores large data sets (also known as big data) to discover consistent patterns. This computational process involves a use of methods at the intersection of artificial intelligence, machine learning, statistics, and database systems. This course will discuss advanced algorithms for classification, clustering, association analysis, and mining social network analysis. The subjects are treated both theoretically and practically through lab sessions.
Expected learning outcomes
- Understand the entire chain of data processing
- Understand principle theories, models, tools and techniques
- Analyze and apply adequate models for new problems
- Understand new data mining tasks and provide solutions in different domains
- Design an appropriate model to cope with new requirements
Expected acquired core competences
- Latest trends, algorithms, technologies in big data
- Ability to determine appropriate approaches towards new challenges
- Proficiency in data analysis and performance evaluations
- Application of models, combination of multiple approaches, adaptation to interdisciplinary fields
Detailed topics covered in the course
- Foundations of interaction design
- Data Preprocessing
- Data Warehouse
- Association Rules
- Frequent Pattern mining
- Classification
- Clustering
- Recommendation Systems
- Mining graphs
- Mining data streams
- Neural Networks
- Outlier Detection
- Dimensionality Deduction
Textbook
- Jiawei Han, Micheline Kamber and Jian Pei. Data Mining: Concepts and Techniques (3nd Edition)
Reference material
- Jure Leskovec, Anand Rajaraman and Jeffrey D. Ullman. Mining of Massive Datasets
Required computer resources
NA
Evaluation
- Individual Assignments (30%)
- Course Project (20%)
- Mid-term Exam (20%)
- Final Exam (30%)