BSc: Data Mining
================






Contents
--------


* [1 Data Mining](#Data_Mining)
	+ [1.1 Administrative details](#Administrative_details)
	+ [1.2 Prerequisites](#Prerequisites)
	+ [1.3 Course outline](#Course_outline)
	+ [1.4 Expected learning outcomes](#Expected_learning_outcomes)
	+ [1.5 Expected acquired core competences](#Expected_acquired_core_competences)
	+ [1.6 Detailed topics covered in the course](#Detailed_topics_covered_in_the_course)
	+ [1.7 Textbook](#Textbook)
	+ [1.8 Reference material](#Reference_material)
	+ [1.9 Required computer resources](#Required_computer_resources)
	+ [1.10 Evaluation](#Evaluation)



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](https://eduwiki.innopolis.university/index.php/BSc:_Mathematical_Analysis_I)
* [CSE201 — Mathematical Analysis II](https://eduwiki.innopolis.university/index.php/BSc:_Mathematical_Analysis_II)
* [CSE202 — Analytical Geometry and Linear Algebra I](https://eduwiki.innopolis.university/index.php/BSc:_Analytic_Geometry_And_Linear_Algebra_I)
* [CSE204 — Analytic Geometry And Linear Algebra II](https://eduwiki.innopolis.university/index.php/BSc:_Analytic_Geometry_And_Linear_Algebra_II)
* [CSE206 — Probability And Statistics](https://eduwiki.innopolis.university/index.php/BSc:_Probability_And_Statistics)
* [CSE117 — Data Structures and Algorithms](https://eduwiki.innopolis.university/index.php/BSc:_Data_Structures_Algorithms)
* [CSE113 — Philosophy I - (Discrete Math and Logic)](https://eduwiki.innopolis.university/index.php/BSc:Logic_and_Discrete_Mathematics)


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%)