PAHSU · Third Year B.Tech. Computer Science and Engineering · NEP 2020
Data Mining
CSEPEC-02A · Programme Elective II · Semester VI · 4 credits · ISE 30 + ESE 70
One of the Programme Elective II options.
Unit 1: Introduction to Data Mining
8 hoursData mining and its relation to machine learning and AI; structured, unstructured and semi-structured data; the data mining process from problem definition to deployment; types and basic tasks of data mining; major issues and applications; KDD.
Examined in the 70-mark end-semester paper
- Data mining and the KDD process
- Data mining functionalities and task primitives
- Attribute and data types
Unit 2: Data Preprocessing
7 hoursThe need to preprocess data; data cleaning, integration, reduction, transformation and discretisation.
Examined in the 70-mark end-semester paper
Unit 3: Mining Frequent Patterns and Classification
8 hoursFrequent pattern mining and its algorithms: Apriori and FP-growth, and their challenges; classification: decision trees (CART, ID3), naive Bayes, k-nearest neighbours, support vector machines and random forests.
Examined in the 70-mark end-semester paper
- Frequent itemsets and association rules
- FP-growth algorithm
- Decision tree induction
- Bayes and naive Bayes classification
- k-nearest neighbour classification
- Support vector machines and regression models for prediction
- Ensembles: bagging and boosting
Unit 4: Cluster Analysis: Basic Concepts and Methods
8 hoursRequirements for cluster analysis and the basic methods; partitioning: k-means and k-medoids; hierarchical: agglomerative and divisive; BIRCH; evaluating clusterings.
Examined in the 70-mark end-semester paper
- Cluster analysis: K-means and K-medoids
- Hierarchical and density-based clustering
- Evaluating clusters
Unit 5: Association Rules
6 hoursLarge itemsets; the Apriori, sampling, partitioning and parallel and distributed algorithms; incremental rules; advanced association-rule techniques; measuring the quality of rules.
Examined in the 70-mark end-semester paper
- Apriori algorithm
- Sampling, partitioning and parallel association rule algorithms
- Correlation analysis and constraint-based association mining
Unit 6: Outlier Detection and Web Mining
8 hoursWeb content, usage and structure mining; web crawlers; outliers and outlier analysis: statistical, clustering-based and classification-based approaches.
Examined in the 70-mark end-semester paper
- Web mining and recommender systems
- Statistical outlier detection
- Distance and density-based outlier detection
Unit contents are summarised from the official PAHSU syllabus . AiCanCode.org is not affiliated with Punyashlok Ahilyadevi Holkar Solapur University (PAHSU).