2025 question paper

Data Mining

26 questions

Q1a. A Data Warehouse is generally built using which schema for decision support? (i) Hierarchical Schema (ii) Star or Snowflake Schema (iii) Relational Schema (iv) Network Schema20252m
Module 1: Data Warehousing and Business Analysis
A Data Warehouse is generally built using which schema for decision support?

(i) Hierarchical Schema
(ii) Star or Snowflake Schema
(iii) Relational Schema
(iv) Network Schema

View this question on its own page →
Search Google Ask AI
Worked Solution
Answer: (ii) Star or Snowflake Schema

Data warehouses are optimized for read-heavy analytical queries, not transactional integrity, so they use dimensional modeling instead of normalized relational schemas.

Star Schema: one central fact table (measures/metrics) connected directly to several dimension tables (denormalized, descriptive attributes).

Snowflake Schema: same idea, but dimension tables are further normalized into sub-dimensions.

Dim_Time Dim_Product \ / \ / FACT_TABLE / \ / \ Dim_Customer Dim_Store

Both schemas are purpose-built for OLAP-style slicing, dicing, and aggregation — which is why (ii) is correct over normalized relational schema (iii), which is used in OLTP systems.

Q1b. Which of the following is NOT a component of a data warehouse? (i) Data Extraction Tools (ii) Metadata Repository (iii) Word Processing Tools (iv) Data Cleaning Tools20252m

Module 1: Data Warehousing and Business Analysis

Which of the following is NOT a component of a data warehouse?

(i) Data Extraction Tools
(ii) Metadata Repository
(iii) Word Processing Tools
(iv) Data Cleaning Tools

View this question on its own page →

Search Google Ask AI

Worked Solution

Answer: (iii) Word Processing Tools

The standard components of a data warehouse are all built around moving, cleaning, storing, and describing data:

Component	Role
Data Extraction Tools	Pull data from source/operational systems
Data Cleaning Tools	Fix inconsistencies, remove noise/duplicates
Data Transformation Tools	Convert data into the warehouse's target format
Load/Refresh Tools	Populate the warehouse and keep it updated
Metadata Repository	Stores "data about data" — schemas, mappings, lineage
OLAP Servers	Support multidimensional query/analysis

Word Processing Tools are general office-productivity software (like MS Word) — they have no functional role in the ETL/warehouse pipeline, making (iii) the odd one out.

Q1c. Data Reduction aims to: (i) Delete irrelevant data (ii) Remove all missing data (iii) Increase data redundancy (iv) Reduce data volume but produce the same analysis results20252m
Module 2: Data Mining Fundamentals and Association Rule Mining
Data Reduction aims to:

(i) Delete irrelevant data
(ii) Remove all missing data
(iii) Increase data redundancy
(iv) Reduce data volume but produce the same analysis results

View this question on its own page →
Search Google Ask AI
Worked Solution
Answer: (iv) Reduce data volume but produce the same analysis results

Data Reduction techniques shrink the size/volume of a dataset while preserving its analytical integrity, so that mining on the reduced data yields (approximately) the same results as mining on the full data — but faster and cheaper.

Common data reduction techniques:

Dimensionality reduction (PCA, attribute subset selection)

Numerosity reduction (sampling, histograms, clustering, regression models)

Data compression (wavelet transforms, lossy/lossless encoding)

Data cube aggregation

Note: this is distinct from (i) "delete irrelevant data," which is closer to feature/attribute selection — a technique used within data reduction, but the reduction's actual goal (per the standard definition) is volume reduction with result-preserving fidelity.
Q1d. Association rule mining discovers: (i) Hidden relationships among items in large datasets (ii) Regression patterns (iii) Decision tree rules (iv) Hierarchical clusters20252m
Module 2: Data Mining Fundamentals and Association Rule Mining
Association rule mining discovers:

(i) Hidden relationships among items in large datasets
(ii) Regression patterns
(iii) Decision tree rules
(iv) Hierarchical clusters

View this question on its own page →
Search Google Ask AI
Worked Solution
Answer: (i) Hidden relationships among items in large datasets

Association rule mining finds interesting co-occurrence relationships between items in large transactional datasets, expressed as rules of the form:

$\text{Item}_A \Rightarrow \text{Item}_B \quad [\text{support } s, \text{confidence } c]$

Example: {Bread, Butter} ⇒ {Milk} [support=20%, confidence=75%] — meaning 20% of all transactions contain all three items, and 75% of transactions with Bread+Butter also contain Milk.

It is not regression (ii — a prediction technique), decision-tree rules (iii — a classification technique), or hierarchical clusters (iv — a clustering technique); it's specifically about discovering frequent co-occurrence / hidden relationships among items.
Q1e. Which of the following is NOT a step in data preprocessing? (i) Data Cleaning (ii) Data Reduction (iii) Data Integration (iv) Data Encryption20252m
Module 2: Data Mining Fundamentals and Association Rule Mining
Which of the following is NOT a step in data preprocessing?

(i) Data Cleaning
(ii) Data Reduction
(iii) Data Integration
(iv) Data Encryption

View this question on its own page →
Search Google Ask AI
Worked Solution
Answer: (iv) Data Encryption

Standard data preprocessing steps in data mining are:

Data Cleaning — handle missing values, noise, outliers, inconsistencies.

Data Integration — merge data from multiple sources into a coherent store.

Data Reduction — reduce volume (dimensionality/numerosity reduction) while preserving analytical value.

Data Transformation/Discretization — normalize, aggregate, or bucket data into a mining-ready form.

Data Encryption is a security measure (protecting data confidentiality), not a data-quality or mining-readiness step — it has no role in the standard preprocessing pipeline, making it the correct "NOT a step" answer.
Q1f. Correlation analysis in association mining helps to: (i) Find causation between attributes (ii) Discover how strongly items are related beyond co-occurrence (iii) Increase support of rules (iv) Merge unrelated transactions20252m
Module 2: Data Mining Fundamentals and Association Rule Mining
Correlation analysis in association mining helps to:

(i) Find causation between attributes
(ii) Discover how strongly items are related beyond co-occurrence
(iii) Increase support of rules
(iv) Merge unrelated transactions

View this question on its own page →
Search Google Ask AI
Worked Solution
Answer: (ii) Discover how strongly items are related beyond co-occurrence

Plain support/confidence-based association rules can be misleading: a rule can have high confidence purely because the consequent is very common overall, even if there's no real relationship (this is the classic "buys coffee ⇒ buys tea" trap when both items are just individually popular).

Correlation analysis (e.g., using lift or the chi-square test) checks whether the co-occurrence of items is statistically meaningful rather than coincidental:

$\text{lift}(A, B) = \frac{P(A \cup B)}{P(A) \cdot P(B)}$

lift = 1 → A and B are independent (no real relationship, despite whatever confidence says).

lift > 1 → positively correlated (occurring together more than expected by chance).

lift < 1 → negatively correlated.

This is why correlation analysis "goes beyond" simple co-occurrence counting — it tells you whether the relationship is genuinely meaningful, not just frequent. It does not establish causation (option i) — correlation ≠ causation even in this context.
Q1g. Classification is a process of: (i) Assigning data to predefined classes (ii) Dividing data into clusters (iii) Summarizing data (iv) Cleaning data20252m
Module 3: Classification and Prediction
Classification is a process of:

(i) Assigning data to predefined classes
(ii) Dividing data into clusters
(iii) Summarizing data
(iv) Cleaning data

View this question on its own page →
Search Google Ask AI
Worked Solution
Answer: (i) Assigning data to predefined classes

Classification is a supervised learning task in which a model is first trained on a labelled training set (tuples for which the class label is already known), and then the learned model is used to assign new, unseen data objects to one of the predefined classes.

For example, an e-mail classifier is trained on a set of e-mails already labelled "spam" or "not-spam", and thereafter predicts the label of every incoming e-mail.

Why the others are wrong:

(ii) Dividing data into clusters — this is clustering, an unsupervised task with no predefined class labels.

(iii) Summarizing data — this describes data characterization/summarization, not classification.

(iv) Cleaning data — this is data preprocessing, not classification.

So classification is fundamentally about assigning data objects to predefined classes.
Q1h. Backpropagation algorithm is commonly used in: (i) Decision Trees (ii) Association Rules (iii) Neural Networks (iv) Hierarchical Clustering20252m
Module 3: Classification and Prediction
Backpropagation algorithm is commonly used in:

(i) Decision Trees
(ii) Association Rules
(iii) Neural Networks
(iv) Hierarchical Clustering

View this question on its own page →
Search Google Ask AI
Worked Solution
Answer: (iii) Neural Networks

Backpropagation is the standard learning (training) algorithm for multilayer feed-forward neural networks. It works in two phases:

Forward pass — the input is propagated layer by layer through the network, and the output at the output layer is computed.

Backward pass — the error (difference between actual output and expected output) is propagated backwards through the network to update each weight using the gradient descent rule:

$w_{ij} \leftarrow w_{ij} + \eta\, \delta_j \, x_{ij}$

where $\eta$ is the learning rate, $\delta_j$ is the error term of node $j$ , and $x_{ij}$ is the input arriving along weight $w_{ij}$ .

Why the others are wrong:

(i) Decision Trees use attribute-selection measures such as information gain / Gini index, not backpropagation.

(ii) Association Rules are found using algorithms like Apriori or FP-growth.

(iv) Hierarchical Clustering uses distance-based agglomeration (AGNES/DIANA), not backpropagation.

Hence backpropagation is commonly used in Neural Networks.
Q1i. Which is a partitioning clustering method? (i) Apriori (ii) ID3 (iii) Naïve Bayes (iv) k-Means20252m
Module 4: Cluster Analysis
Which is a partitioning clustering method?

(i) Apriori
(ii) ID3
(iii) Naïve Bayes
(iv) k-Means

View this question on its own page →
Search Google Ask AI
Worked Solution
Answer: (iv) k-Means

Partitioning clustering methods partition $n$ data objects into $k$ clusters (where $k$ is given in advance) such that each object belongs to the cluster whose centroid (mean) is nearest to it. k-Means is the classic partitioning algorithm:

Choose $k$ initial centroids (one per cluster).

Assign each object to the cluster of its nearest centroid.

Recompute each cluster's centroid as the mean of its member objects.

Repeat steps 2–3 until the centroids stop changing.

Input: k, dataset D Repeat until centroids converge: assign each x ∊ D to cluster of nearest centroid recompute each centroid = mean of its cluster

Why the others are wrong:

(i) Apriori — an association-rule mining algorithm (frequent itemset generation), not a clustering method.

(ii) ID3 — a decision tree classifier.

(iii) Naïve Bayes — a probabilistic classifier, not a clustering method.

Hence the partitioning clustering method among the options is k-Means.
Q1j. Spatial data mining deals with: (i) Geograph-based data (ii) Text documents (iii) Financial data only (iv) Audio signals20252m
Module 5: Mining Object, Spatial, Multimedia, Text and Web Data
Spatial data mining deals with:

(i) Geograph-based data
(ii) Text documents
(iii) Financial data only
(iv) Audio signals

View this question on its own page →
Search Google Ask AI
Worked Solution
Answer: (i) Geographic-based data

Spatial data mining is the process of discovering interesting, useful patterns from large spatial (geographic) databases — i.e., data that references objects by their location in space, such as maps, satellite imagery, GPS traces, and location-tagged records.

Examples of spatial data:

Satellite remote-sensing images (land cover, weather patterns),

Mapping data from Geographic Information Systems (GIS),

Location data from mobile phones/sensors,

Earthquake or disease-spread records with co-ordinates.

Techniques include spatial clustering (e.g., finding densely populated regions), spatial outlier detection (e.g., detecting anomalies in pollution monitors), and spatial association rules (e.g., "regions near a river usually have fertile soil").

Why the others are wrong:

(ii) Text documents — that is text mining.

(iii) Financial data only — that is financial data mining; spatial mining is not limited to financial data.

(iv) Audio signals — that is multimedia mining.

Hence spatial data mining deals with geographic-based data.
Budget App•POCKETLY
Pocketly on Android
Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.
Install Pocketly

Q2a. Define a Data Warehouse. Discuss the architecture of a Data Warehouse with a neat diagram.20257m

Module 1: Data Warehousing and Business Analysis

Define a Data Warehouse. Discuss the architecture of a Data Warehouse with a neat diagram.

View this question on its own page →

Search Google Ask AI

Worked Solution

Data Warehouse — Definition & Architecture

Definition

A Data Warehouse is a subject-oriented, integrated, time-variant, and non-volatile collection of data organized to support management decision-making (Bill Inmon's definition). It consolidates data from multiple heterogeneous operational sources into one consistent store optimized for analysis rather than transactions.

Architecture Diagram

┌───────────────┐   ┌───────────────┐   ┌───────────────┐
│  Source: RDBMS│   │ Source: Files │   │ Source: ERP   │
└───────┬───────┘   └───────┬───────┘   └───────┬───────┘
        │                   │                   │
        └────────┬──────────┴──────────┬────────┘
                  ▼                     
        ┌─────────────────────┐
        │   ETL / Data Staging │  Extract, clean, transform,
        │        Area          │  integrate, load
        └──────────┬───────────┘
                    ▼
        ┌─────────────────────┐
        │   Metadata           │◀── describes structure,
        │   Repository          │    source mappings, lineage
        └──────────┬───────────┘
                    ▼
        ┌─────────────────────┐
        │   Data Warehouse      │  (central repository —
        │   (Fact + Dimension   │   star/snowflake schema)
        │    tables)             │
        └──────────┬───────────┘
                    ▼
     ┌──────────────┼──────────────┐
     ▼              ▼              ▼
┌─────────┐   ┌───────────┐  ┌───────────┐
│ Data     │   │  OLAP      │  │  Reporting/│
│ Marts    │   │  Server    │  │  Mining   │
│ (dept-   │   │ (ROLAP/    │  │  Tools    │
│ specific)│   │  MOLAP)    │  │           │
└─────────┘   └───────────┘  └───────────┘
                    │
                    ▼
             End Users / Analysts

Key Layers

Source layer – operational systems (RDBMS, flat files, ERP, external feeds).
ETL/Staging layer – extraction, cleaning, transformation, integration, and loading of data.
Metadata repository – records schema definitions, source-to-target mappings, and data lineage.
Warehouse storage layer – central repository modeled as fact tables (measures) linked to dimension tables (context), often broken into smaller data marts for individual departments.
OLAP/access layer – ROLAP, MOLAP, or HOLAP servers that let users slice, dice, drill down, and roll up.
Front-end tools – reporting, dashboards, ad-hoc query tools, and data mining applications used by decision-makers.

This layered design keeps the warehouse decoupled from source systems (so analytics never slows down production databases) while giving analysts a single, consistent, historical view of the business.

Q2b. What is OLAP? Explain the main components of a Data Warehouse system.20257m
Module 1: Data Warehousing and Business Analysis
What is OLAP? Explain the main components of a Data Warehouse system.

View this question on its own page →
Search Google Ask AI
Worked Solution
What is OLAP?

OLAP (Online Analytical Processing) is a category of software technology that enables analysts to interactively examine multidimensional data from multiple perspectives — slicing, dicing, drilling down, rolling up, and pivoting — to support fast, complex analytical queries over large historical datasets (as opposed to OLTP, which handles fast simple transactions).

Main Components of a Data Warehouse System

┌────────────┐ ┌───────────────┐ ┌────────────────┐ ┌──────────┐ │ Source │───▶│ Extraction/ │───▶│ Data │───▶│ OLAP / │ │ Systems │ │ Transform/ │ │ Warehouse │ │ Query │ │ │ │ Load (ETL) │ │ Storage │ │ Tools │ └────────────┘ └───────────────┘ └────────────────┘ └──────────┘ │ │ ▼ ▼ ┌───────────────┐ ┌────────────────┐ │ Metadata │ │ Data Marts │ │ Repository │ │ (subject-wise) │ └───────────────┘ └────────────────┘

Source/Operational Systems — OLTP databases, external feeds, legacy files that supply raw data.

Extraction, Transformation, Loading (ETL) tools — pull data out of sources, clean/standardize it, and load it into the warehouse.

Metadata Repository — stores "data about data": schema definitions, source mappings, transformation rules, and refresh schedules.

Data Warehouse (central repository) — the integrated, subject-oriented store, typically organized as fact and dimension tables.

Data Marts — smaller, department/subject-specific subsets of the warehouse (e.g., Sales mart, HR mart) for faster, focused access.

OLAP Servers — ROLAP (relational), MOLAP (multidimensional), or HOLAP (hybrid) engines that serve multidimensional queries.

Front-End Analysis/Reporting Tools — dashboards, query tools, data mining tools used by business analysts and decision-makers to consume the data.

Together, these components move data from scattered operational systems into a single, query-optimized structure, and then expose it through OLAP for fast, flexible analysis.

Q3a. What is Data Mining? How does it differ from Data Warehousing? List and briefly describe any three functionalities of Data Mining.20257m

Module 2: Data Mining Fundamentals and Association Rule Mining

What is Data Mining? How does it differ from Data Warehousing? List and briefly describe any three functionalities of Data Mining.

View this question on its own page →

Search Google Ask AI

Worked Solution

Data Mining vs Data Warehousing + 3 Functionalities

What is Data Mining?

Data mining is the process of discovering interesting, previously unknown, and potentially useful patterns and knowledge from large volumes of data using statistical, machine learning, and database techniques.

Data Mining vs Data Warehousing

Aspect	Data Warehousing	Data Mining
Purpose	Store integrated, historical data for querying/reporting	Discover hidden patterns/knowledge from that data
Process	ETL (extract, transform, load) + storage in fact/dimension tables	Applies algorithms (classification, clustering, association)
Output	Organized, queryable repository	Patterns, rules, predictive models
User interaction	User explores via OLAP (roll-up, drill-down, slice, dice)	System (semi-)automatically extracts patterns
Relationship	Provides clean, integrated data as input to mining	Consumes warehouse data to produce insight

Raw Sources ──ETL──▶ Data Warehouse ──mining algorithms──▶ Data Mining (patterns/knowledge)

In short: a data warehouse is the organized store; data mining is the analysis engine that runs on top of it (though mining can also run on data outside a warehouse).

Three Functionalities of Data Mining

Classification — assigns data objects to predefined categories/classes based on a model learned from labeled training data (e.g., classifying an email as spam/not spam using decision trees, naïve Bayes, or neural networks).
Clustering — groups data objects into clusters such that objects within a cluster are similar to each other, and dissimilar to objects in other clusters, without using predefined labels (e.g., segmenting customers by purchase behavior using k-means).
Association Rule Mining — discovers interesting relationships (rules) between items that co-occur frequently in transactional data (e.g., {Bread, Butter} ⇒ {Milk} [support=20%, confidence=75%] in market-basket analysis).

(Other functionalities include: characterization, discrimination, prediction/regression, outlier analysis, and evolution/trend analysis.)

Q3b. Explain in detail the concept of Data Reduction and Data Discretization. Explain the major steps involved in Data Preprocessing.20257m
Module 2: Data Mining Fundamentals and Association Rule Mining
Explain in detail the concept of Data Reduction and Data Discretization. Explain the major steps involved in Data Preprocessing.

View this question on its own page →
Search Google Ask AI
Worked Solution
Data Reduction, Data Discretization & Preprocessing Steps

Data Reduction

Obtains a reduced representation of a dataset that is much smaller in volume, yet closely maintains the integrity/analytical value of the original data — so mining on the reduced data is far more efficient and produces (nearly) the same results.

Techniques:

Dimensionality reduction — reduces the number of attributes (PCA, attribute subset selection/wrapper methods).

Numerosity reduction — replaces data with a smaller representation: parametric (regression models) or non-parametric (histograms, clustering, sampling, data cube aggregation).

Data compression — encoding transformations (wavelet transforms, lossy/lossless compression) to shrink storage size.

Original Data (large) ──[reduction techniques]──▶ Reduced Data (small, representative)

Data Discretization

Converts continuous attribute values into a small number of interval labels or categories, reducing the number of distinct values and making the data suitable for algorithms that work with categorical data.

Methods:

Binning — equal-width or equal-frequency bins.

Histogram analysis — partitioning based on data distribution.

Entropy-based discretization — splits chosen to maximize class purity (supervised).

Concept hierarchy generation — organizes discretized values into multi-level hierarchies (e.g., Age → {Young, Middle-aged, Senior} → further grouped).

Continuous: 18, 22, 25, 40, 45, 60, 65 Discretized: [18-30)="Young", [30-55)="Middle-aged", [55-70)="Senior"

Major Steps in Data Preprocessing

Raw Data │ ▼ 1. Data Cleaning ────▶ handle missing values, noise, outliers, inconsistencies │ ▼ 2. Data Integration ──▶ merge multiple heterogeneous sources into one dataset │ ▼ 3. Data Reduction ────▶ shrink volume via dimensionality/numerosity reduction │ ▼ 4. Data Transformation/Discretization ──▶ normalize, aggregate, bucket into │ mining-ready form ▼ Clean, Integrated, Reduced, Transformed Data → ready for Mining

Data Cleaning — fills missing values, smooths noisy data, identifies/removes outliers, resolves inconsistencies.

Data Integration — combines data from multiple databases/files/sources, resolving entity and schema conflicts.

Data Reduction — reduces data volume while preserving analytical results (as described above).

Data Transformation (including Discretization) — normalizes, aggregates, and converts continuous attributes into discrete categories for algorithms that need them.

These four steps together turn messy, real-world raw data into a clean dataset ready for accurate and efficient mining.
Q4a. Define Association Rule Mining with an example. Discuss constraint-based association mining with examples.20257m
Module 2: Data Mining Fundamentals and Association Rule Mining
Define Association Rule Mining with an example. Discuss constraint-based association mining with examples.

View this question on its own page →
Search Google Ask AI
Worked Solution
Association Rule Mining — Definition, Example & Constraint-Based Mining

Definition

Association rule mining searches for interesting co-occurrence relationships among items in a large transactional (or relational) database. The discovered rules have the form

$A \Rightarrow B \quad [\text{support } s,\; \text{confidence } c]$

where $A$ and $B$ are disjoint itemsets. Support measures how frequently the rule applies, and confidence measures how reliably $B$ appears whenever $A$ appears:

$\text{support}(A \Rightarrow B) = P(A \cup B) = \frac{\text{no. of transactions containing } A \cup B}{\text{total transactions}}$

$\text{confidence}(A \Rightarrow B) = P(B \mid A) = \frac{\text{support}(A \cup B)}{\text{support}(A)}$

Example

From a supermarket's transaction database:

TID Items bought

1 Bread, Butter, Milk

2 Bread, Butter

3 Beer, Diaper

4 Bread, Milk

5 Butter, Milk

The rule {Bread} ⇒ {Butter}:

$\text{support} = \frac{2}{5} = 40\%$ (Bread and Butter appear together in T1, T2)

$\text{confidence} = \frac{2}{3} \approx 66.7\%$ (of the 3 transactions containing Bread, 2 also contain Butter)

A rule is strong if it exceeds user-specified minimum support ( $\text{minsup}$ ) and minimum confidence ( $\text{minconf}$ ).

Constraint-Based Association Mining

In large databases, plain Apriori/FP-growth can generate an overwhelming number of rules, many of which are uninteresting. Constraint-based mining lets the analyst push user-specified constraints into the mining process so that only rules satisfying the constraints are discovered — this both prunes the search space (better efficiency) and focuses the results to what the user wants.

Kinds of constraints:

Rule constraints — limit the form of the rule, e.g., only rules of the form $\text{Sugar} \Rightarrow X$ or rules with 3 or more items in the antecedent.

Itemset constraints — require specific items to be present or absent, e.g., only itemsets containing snacks or only itemsets that exclude expensive-items.

Support/confidence (interestingness) thresholds — standard minsup/minconf or other measures like lift, e.g., support ≥ 2% AND lift ≥ 1.5.

Aggregate constraints — conditions on aggregated values. e.g., "rules for which the average price of items in the rule exceeds $10".

Example:

"Find association rules involving at least one item from the 'Dairy' category whose support is at least 10%."

If the constraint is anti-monotone (e.g., $min(price) \ge 10$ ), the Apriori pruning property applies — once an itemset violates it, all supersets violate it too, so entire subtrees of the search can be pruned.

Benefit: mining on the constrained space returns far fewer but highly targeted rules, and does so much faster than mining everything and filtering afterwards. Constraint checking is usually pushed inside the candidate-generation step of Apriori or the FP-tree construction step, so only constrained-valid candidates are counted.
Q4b. What are "Support" and "Confidence" in Association Rule Mining? Explain how Association Mining can be extended to Correlation Analysis. Give suitable examples.20257m
Module 2: Data Mining Fundamentals and Association Rule Mining
What are "Support" and "Confidence" in Association Rule Mining? Explain how Association Mining can be extended to Correlation Analysis. Give suitable examples.

View this question on its own page →
Search Google Ask AI
Worked Solution
Association Rule Mining: Definition, Support, Confidence & Correlation Extension

Definition with Example

Association Rule Mining discovers interesting relationships (rules) between items that frequently co-occur in a transactional dataset. A rule has the form:

$A \Rightarrow B \quad [\text{support } s,\ \text{confidence } c]$

Example: In supermarket transaction data, the rule
$\{\text{Bread, Butter}\} \Rightarrow \{\text{Milk}\} \quad [s=20\%, c=75\%]$
means: 20% of all transactions contain Bread, Butter, and Milk together, and 75% of the transactions that contain Bread and Butter also contain Milk.

Support and Confidence

Support — the fraction of transactions in the database that contain the itemset:
$support(A \Rightarrow B) = P(A \cup B) = \frac{\text{transactions containing } A \cup B}{\text{total transactions}}$
It measures how frequently the rule applies — i.e., its statistical significance.

Confidence — the conditional probability that a transaction containing A also contains B:
$confidence(A \Rightarrow B) = P(B \mid A) = \frac{support(A \cup B)}{support(A)}$
It measures the strength/reliability of the rule.

A rule is called strong if it satisfies both a minimum support threshold and a minimum confidence threshold.

Extending to Correlation Analysis

Support and confidence alone can be misleading — a rule can have high confidence purely because the consequent B is very common overall, even if A and B have no real relationship (the classic "coffee ⇒ tea" trap when both are individually popular). To check whether A and B are genuinely related, we compute lift:

$lift(A, B) = \frac{P(A \cup B)}{P(A) \cdot P(B)} = \frac{confidence(A \Rightarrow B)}{support(B)}$

lift = 1 → A and B are statistically independent — the "association" is coincidental.

lift > 1 → A and B are positively correlated (occur together more than expected by chance) — a genuinely useful rule.

lift < 1 → A and B are negatively correlated (occurrence of A discourages B).

Worked Example

Suppose in 5000 transactions: 3000 contain "computer games", 3750 contain "videos", and 2000 contain both.

$support(\text{games} \Rightarrow \text{videos}) = 2000/5000 = 40\%$

$confidence(\text{games} \Rightarrow \text{videos}) = 2000/3000 = 66.7\%$ (looks "strong")

$lift = \dfrac{2000/5000}{(3000/5000)(3750/5000)} = \dfrac{0.4}{0.6 \times 0.75} = \dfrac{0.4}{0.45} \approx 0.89$

Since lift < 1, buying games actually negatively correlates with buying videos — the high confidence was misleading because videos are popular on their own (75% of all customers buy them anyway). This shows why correlation analysis (lift) is essential beyond raw support/confidence.

Support/Confidence ──▶ "Looks like a strong rule" (66.7% confidence) + Lift check ──▶ Reveals TRUE relationship (lift=0.89 < 1 → negatively correlated!)
Q5a. Define Classification and Prediction in data mining. Describe the concept of Bayesian Classification with a simple example.20257m
Module 3: Classification and Prediction
Define Classification and Prediction in data mining. Describe the concept of Bayesian Classification with a simple example.

View this question on its own page →
Search Google Ask AI
Worked Solution
Classification & Prediction + Naïve Bayesian Classification

Classification and Prediction — Definitions

Classification is a supervised learning process that builds a model from labelled training data and then uses it to assign new/unseen objects to discrete, predefined class labels (e.g., predict whether a loan is low-risk or high-risk). Its output is categorical.

Prediction is the general task of estimating unknown values. When the value being predicted is numeric/continuous (e.g., predicting the price of a house), it is called prediction or regression; when the unknown value is a categorical class label, it is classification. Prediction is governed by a mean squared error style loss, whereas classification deals with accuracy/error rate.

Bayesian Classification

Bayesian classification is a statistical classification technique based on Bayes' Theorem. It assigns a tuple $X$ to the class $C_i$ for which the posterior probability $P(C_i \mid X)$ is maximum:

$P(C_i \mid X) = \frac{P(X \mid C_i)\, P(C_i)}{P(X)}$

Because $P(X)$ is the same for all classes, the maximum a posteriori (MAP) decision rule is:

$\text{choose } C_i \text{ such that } P(X \mid C_i)\, P(C_i) \text{ is maximum}$

$P(C_i)$ — prior probability of class $C_i$ (estimated from training-data frequencies).

$P(X \mid C_i)$ — likelihood of observing $X$ given the class.

Naïve Bayes — a Simple Example

The naïve assumption is that all attributes are conditionally independent given the class, so:

$P(X \mid C_i) = \prod_{k=1}^{n} P(x_k \mid C_i)$

Example: Classify a fruit by its attributes.

Fruit Colour Shape Taste

Apple Red Round Sweet

Apple Green Round Sweet

Mango Yellow Oval Sweet

Mango Yellow Oval Sour

Let a new fruit have attributes $X = (\text{Colour} = \text{Yellow},\ \text{Shape} = \text{Oval})$ . We compute:
$P(\text{Mango}) = 2/4 = 0.5$ , $P(\text{Apple}) = 0.5$ .

$P(Yellow \mid Mango) = 2/2 = 1$ , $P(Oval \mid Mango) = 2/2 = 1$

$P(Yellow \mid Apple) = 0/2 = 0$ , so $P(X \mid Apple) = 0$ .

Score mango = $0.5 \times (1 \times 1) = 0.5$ ; apple score $= 0$ . Since $0.5 > 0$ , the new fruit is classified as Mango.

Advantages: simple, fast, easily handles high-dimensional data, works well in spam filtering and text classification. Limitation: the independence assumption is often violated in real data.
Q5b. Explain the working of the Decision Tree method for classification.20257m
Module 3: Classification and Prediction
Explain the working of the Decision Tree method for classification.

View this question on its own page →
Search Google Ask AI
Worked Solution
Working of the Decision Tree Method for Classification

What is a Decision Tree?

A decision tree is a flow-chart-like tree structure in which:

each internal node denotes a test on an attribute,

each branch represents an outcome of that test,

each leaf node holds a class label (the prediction),

the topmost node is the root.

Step-by-Step Construction (Tree Induction)

Attribute selection — the best-splitting attribute is chosen at each node using an attribute-selection measure such as Information Gain (used by ID3), Gain Ratio (C4.5), or Gini Index (CART). The attribute that best separates the training tuples (maximally reduces impurity) is selected.

Partition/branching — the training set is split according to the distinct values of the chosen attribute.

Recursion — the selection-and-split process is repeated on each branch using the remaining attributes.

Stopping criteria — a node becomes a leaf when all its tuples belong to the same class, or no attribute remains, or the tuples are too few / other stopping rules apply. The node is labelled with the majority class.

Pruning — the fully grown tree is pruned (pre- or post-pruning) to remove branches that overfit the noise, thereby improving generalisation.

To illustrate the attribute-selection idea: given a training set with classes, first compute the entropy of the target attribute $E(S)=-\sum p_i \log_2 p_i$ . For each candidate attribute, compute the weighted entropy after splitting by it and take the difference (the information gain); the attribute with the maximum gain becomes the splitting attribute at that node.

Example Dataset

Outlook Temperature Play?

Sunny Hot No

Overcast Cool Yes

Rain Mild Yes

Sunny Mild Yes

Here the root split is chosen on Outlook (it gives the highest information gain). The resulting tree:

[Outlook] / | \ sunny overcast rain | | | [Temp] Yes Yes / \ Hot Mild | | No Yes

Classification (Prediction) Phase

A new, unseen tuple is routed from the root down a path whose attribute tests match its values until it reaches a leaf; the class label stored in that leaf is the predicted class.

Advantages

Easy to understand and interpret; can be directly converted to IF–THEN rules.

Handles both numeric and categorical attributes.

Requires little data preparation and no domain knowledge.

Limitations

Greedy induction — a small change in data can yield a different tree.

Without pruning it tends to overfit the training data.

Can be unstable; splitting bias (favours attributes with many values).
Q6a. Discuss the working of Support Vector Machines and their applications in data mining.20257m
Module 3: Classification and Prediction
Discuss the working of Support Vector Machines and their applications in data mining.

View this question on its own page →
Search Google Ask AI
Worked Solution
Support Vector Machines (SVM) — Working & Applications

Working

An SVM is a supervised classification technique that finds the optimal separating hyperplane which best separates the data into two classes and maximises the margin — the distance between the hyperplane and the nearest training points, called support vectors.

Hyperplane: w·x + b = 0 class −1 │ class +1 o o o │ + + + + o o o │ + + o (margin) + + ──────────────────────────── ↑ margin ↑ support vectors

For linearly separable data, the decision boundary is:

$w \cdot x + b = 0, \quad f(x) = \operatorname{sign}(w \cdot x + b)$

Maximising the margin $2/\|w\|$ is solved as a constrained convex optimisation problem (using the Lagrangian dual). The separating hyperplane depends only on the support vectors, so the model is sparse.

Key ideas:

Maximal margin — choosing the hyperplane with the largest margin gives the best generalisation.

Soft margin — real data is often not perfectly separable; slack variables $\xi_i \ge 0$ allow a few misclassified (or margin-violating) points, penalised by a cost parameter $C$ :

$\min \frac{1}{2}\|w\|^2 + C\sum_i \xi_i$

Kernel trick — for non-linear data, a kernel function $K(x_i, x_j)$ (linear, polynomial, RBF/Gaussian, sigmoid) implicitly maps the data into a higher-dimensional feature space where a linear hyperplane can separate the classes:

$f(x) = \operatorname{sign}\left(\sum_{i} \alpha_i y_i K(x_i, x) + b\right)$

Applications in Data Mining

Text / document categorisation — spam detection, topic classification (works extremely well on high-dimensional text features).

Image recognition — handwritten-digit recognition, face detection.

Bioinformatics — classification of gene-expression data, protein function prediction.

Financial data mining — credit scoring, fraud detection, bankruptcy prediction.

Web mining — web-page classification, personalized recommendations.

Anomaly/outlier detection — one-class SVM for network intrusion detection and fault monitoring.

Advantages

Strong theoretical guarantees (maximal-margin → good generalisation), effective in high dimensions, robust to overfitting because only support vectors matter.

Limitations

Sensitive to kernel choice and parameters; training is slow on huge datasets; the basic method is binary (multi-class handled by one-vs-all / one-vs-one decomposition).

TID	Items bought
1	Bread, Butter, Milk
2	Bread, Butter
3	Beer, Diaper
4	Bread, Milk
5	Butter, Milk

Fruit	Colour	Shape	Taste
Apple	Red	Round	Sweet
Apple	Green	Round	Sweet
Mango	Yellow	Oval	Sweet
Mango	Yellow	Oval	Sour

Outlook	Temperature	Play?
Sunny	Hot	No
Overcast	Cool	Yes
Rain	Mild	Yes
Sunny	Mild	Yes

Q6b. Differentiate between Partitioning and Hierarchical Clustering methods. Explain Outlier Analysis and its importance in data mining.20257m

Module 4: Cluster Analysis

Differentiate between Partitioning and Hierarchical Clustering methods. Explain Outlier Analysis and its importance in data mining.

View this question on its own page →

Search Google Ask AI

Worked Solution

Partitioning vs Hierarchical Clustering & Outlier Analysis

Partitioning vs Hierarchical Clustering

Partitioning clustering (e.g., k-Means, k-Medoids) partitions $n$ objects into a fixed number $k$ of clusters such that each object belongs to the cluster whose centroid/medoid is nearest. The clusters are then iteratively refined to improve the squared-error objective (SSE); the output is a single, flat, non-nested set of $k$ clusters.

Hierarchical clustering (AGNES agglomerative / DIANA divisive) produces a nested hierarchy (dendrogram). Agglomerative (bottom-up) methods start with each object in its own cluster and repeatedly merge the most similar pairs; divisive (top-down) methods start with one cluster and repeatedly split.

Aspect	Partitioning	Hierarchical
Number of clusters $k$	must be specified in advance	decided later by cutting the dendrogram
Output form	single flat set of $k$ clusters	nested dendrogram
Similarity	distance to centroid/medoid	inter-cluster distance (single/complete/average link)
Scalability	works well on large datasets ( $O(nkt)$ for k-Means)	expensive ( $O(n^2)$ to $O(n^3)$ ), best for small data
Flexibility	iteratively re-partitions; centroids move	merge/split is irreversible (greedy, no backtracking)
Data stored	centroids / medoids only	pairwise distances

Summary: Partitioning is fast and scalable but needs $k$ and is sensitive to initial centroids; hierarchical clustering needs no $k$ , gives richer (nested) information via the dendrogram, but is computationally heavier and cannot undo an earlier merge.

Outlier Analysis

Outliers are data observations that deviate considerably from the general behaviour or distribution of the rest of the data. They can arise from noise/errors (measurement or data-entry mistakes) or may be genuinely interesting events (fraud, intrusion, novelty).

Detection approaches:

Statistical (distribution-based) — assume the data fits a known distribution; objects that fall in the low-probability tails (e.g., beyond $3\sigma$ ) are outliers.
Distance-based — an object is an outlier if most of its neighbours are farther than a threshold (i.e., it has few neighbours within a radius).
Density-based — points lying in low-density regions are outliers (e.g., Local Outlier Factor, LOF).
Clustering-based — objects that do not belong to any cluster, or variation far from their cluster centre, are flagged as outliers.

Importance in data mining:

Outliers can skew the results of clustering, regression, and classification — they heavily influence means, centroids, and learned decision boundaries, degrading accuracy.
Outlier detection is itself a worthwhile mining task: used for fraud detection (unauthorised credit-card transactions), network intrusion detection, medical anomaly detection, and data-quality cleaning (identify and remove noisy records before modelling).
Robust statistical techniques/ensembles often must first isolate outliers so that subsequent models are dependable.

Budget App•POCKETLY
Pocketly on Android
Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.
Install Pocketly

Q7a. What is Spatial Data Mining? Give examples of spatial applications. Discuss the major types of Web Mining: Web Content, Web Structure, and Web Usage Mining.20257m

Module 5: Mining Object, Spatial, Multimedia, Text and Web Data

What is Spatial Data Mining? Give examples of spatial applications. Discuss the major types of Web Mining: Web Content, Web Structure, and Web Usage Mining.

View this question on its own page →

Search Google Ask AI

Worked Solution

Spatial Data Mining & Types of Web Mining

What is Spatial Data Mining?

Spatial data mining is the process of discovering interesting, useful, and previously unknown patterns from large spatial (geographic) databases — data in which objects are described by their location in space (e.g., maps, satellite imagery, GPS traces).

The distinguishing feature is that ordinary mining techniques must be extended to account for spatial relationships such as distance, adjacency, overlap, and containment between neighbouring objects. Common tasks include:

Spatial clustering — grouping geographically close objects (e.g., identifying high-crime zones).
Spatial outlier detection — finding locations whose attribute values differ sharply from their neighbourhood (e.g., an unusually high-pollution monitor).
Spatial association rules — e.g., "regions that are close to a city centre and near a transport hub tend to have high land value".
Spatial trend / classification — predicting categorical values from spatial features.

Examples of spatial applications:

Satellite remote-sensing (land-use/land-cover classification, weather & vegetation monitoring).
GIS (Geographic Information Systems) for urban planning and route optimisation.
Location-based services (traffic prediction, targeted advertising) using mobile GPS data.
Environmental monitoring (earthquake prediction, pollution mapping, disease-spread tracking).

Web Mining and its Major Types

Web mining is the application of data-mining techniques to discover useful patterns from web data — the content of web pages, the hyperlink structure of the web, and usage records of how users interact with websites. Its three major types are:

Web Content Mining — discovers useful information from the content of web pages (text, images, structured data). It includes retrieval (search), classification and clustering of pages, and extraction of structured information (e.g., product metadata). Techniques involve NLP, text mining, and wrapper induction.
Web Structure Mining — analyses the hyperlink topology — that is the graph of pages and links — to infer authority, ranking, and communities. Examples: Google's PageRank, HITS (hyperlink-induced topic search). Two aspects: intra-document structure and inter-document hyperlinks.
Web Usage Mining — mines the log records generated by servers, browsers, and proxies when users browse a website — that is, how users access the site. Its goal is usage patterns (frequent navigation paths, sessions) for applications such as personalisation, pre-fetching, improving site design, and e-commerce recommendation.

Summary table:

Type	Data source	Goal
Content mining	Page content (text, media)	Extract/classify useful information
Structure mining	Hyperlink graph	Discover authority/hub pages, communities
Usage mining	Server/browser logs, cookies	Understand & predict user behaviour

Q7b. Define Text Mining and state its main challenges. Explain the challenges and techniques involved in mining the World Wide Web.20257m
Module 5: Mining Object, Spatial, Multimedia, Text and Web Data
Define Text Mining and state its main challenges. Explain the challenges and techniques involved in mining the World Wide Web.

View this question on its own page →
Search Google Ask AI
Worked Solution
Text Mining & Mining the World Wide Web

Text Mining — Definition and Challenges

Text mining (text data mining / knowledge discovery in text) is the process of discovering interesting, novel, and useful knowledge from large collections of unstructured text documents (e.g., web pages, news articles, e-mails, research papers). It applies techniques from data mining, machine learning, NLP (natural language processing), and information retrieval to go beyond simple keyword searches.

Main challenges of text mining:

Unstructured nature — text has no fixed schema; information must first be extracted/structured.

High dimensionality — documents contain thousands of distinct words/phrases; representing them as features creates very sparse, huge vectors.

Ambiguity and semantics — words often have multiple meanings (polysemy) and synonyms; understanding context is difficult.

Noisy content — typographical errors, abbreviations, stop words, and slang degrade quality.

Multilingual / varied sources — different languages, formats, and lengths make consistent analysis hard.

Evolving language — new words, terms, and jargon appear continuously.

Mining the World Wide Web — Challenges and Techniques

Challenges in mining the WWW (beyond traditional data mining):

Huge, dynamic, and heterogeneous data — billions of pages, changing constantly.

Unstructured and semi-structured content — most pages are free text or loosely structured HTML rather than rigid database tables.

Link/authority biases — some pages attract more links regardless of true worth; link spam and hidden text mislead naive metrics.

Redundancy & duplication — the same information on many mirrors and machine-generated pages.

Heterogeneous formats — HTML, PDF, images, video, XML, etc.

Techniques.

Information retrieval / indexing — term weighting (TF-IDF), Boolean/phrase queries, inverted indexes and search engines.

Web structure mining — using the hyperlink graph (PageRank, HITS) to rank and find authoritative sources.

Web usage mining — analysing server logs, sessions, and cookies to understand user access patterns.

Web content mining — page-based (text/HTML tags, wrapper induction) and search-based (meta-search / aggregation of multiple engines) approaches.

Important: because the web is so noisy, dynamic, and huge, knowledge discovery there relies on a combination of IR (to narrow candidates), NLP (to interpret text), and graph analysis (to respect the link structure of pages). It is harder than mining a well-structured relational database because the source data are largely unstructured and continuously changing.

Q8a. Define Data Warehouse and list its key features. What is the difference between OLTP and OLAP systems?20257m

Module 1: Data Warehousing and Business Analysis

Define Data Warehouse and list its key features. What is the difference between OLTP and OLAP systems?

View this question on its own page →

Search Google Ask AI

Worked Solution

Data Warehouse — Definition, Key Features & OLTP vs OLAP

Definition

A Data Warehouse is a subject-oriented, integrated, time-variant, and non-volatile collection of data used to support management's decision-making process (Bill Inmon).

Key Features

Subject-oriented — organized around major business subjects (Sales, Customer, Product), not individual applications.
Integrated — data pulled from multiple heterogeneous sources is made consistent (naming conventions, units, encoding).
Time-variant — stores historical data with a time dimension; every record is time-stamped, enabling trend analysis.
Non-volatile — once loaded, data is not updated/deleted by users; it's read-only for analysis, refreshed only via scheduled batch loads.
Summarized/denormalized — data is often pre-aggregated and stored in star/snowflake schemas for fast querying.

OLTP vs OLAP

Feature	OLTP	OLAP
Purpose	Run day-to-day operations	Support analysis & decisions
Data	Current, detailed	Historical, summarized
Schema	Normalized (E-R)	Denormalized (star/snowflake)
Query type	Simple, short transactions	Complex, multidimensional queries
Operations	Insert/Update/Delete	Roll-up, drill-down, slice, dice
Response time	Milliseconds	Seconds to minutes (large scans)
Users	Large number of clerks/staff	Fewer analysts/executives
Design goal	Concurrency, integrity	Query throughput, aggregation speed

     OLTP                              OLAP
┌───────────┐  periodic ETL       ┌───────────────┐
│ Live       │ ───────────────▶  │  Data          │
│ Transaction│                     │  Warehouse     │──▶ Analysis/Reports
│ System     │                     │  (subject-     │
└───────────┘                     │  oriented)     │
                                    └───────────────┘

In short: OLTP powers the business (fast writes, current state), while OLAP powers understanding the business (fast reads, historical trends) — the data warehouse exists specifically to bridge them without letting analytical load slow down live transactions.

Q8b. What is Data Cleaning? Why is it needed? What is Data Integration? Describe its role in Data Mining.20257m
Module 2: Data Mining Fundamentals and Association Rule Mining
What is Data Cleaning? Why is it needed? What is Data Integration? Describe its role in Data Mining.

View this question on its own page →
Search Google Ask AI
Worked Solution
Data Cleaning & Data Integration

What is Data Cleaning? Why is it needed?

Data Cleaning (data scrubbing) is the preprocessing step that detects and fixes (or removes) inaccurate, incomplete, noisy, or inconsistent data before mining.

Typical cleaning tasks:

Missing values — filled via ignoring the tuple, manual entry, global constant, attribute/class mean, or predicted values (regression/Bayesian/decision-tree inference).

Noisy data — smoothed using binning, regression, or clustering (to detect and remove outliers).

Inconsistent data — resolved using domain knowledge, functional dependencies, or manual correction (e.g., fixing "NY" vs "New York" mismatches).

Why it's needed: real-world data is "dirty" — incomplete (missing attribute values), noisy (containing errors/outliers), and inconsistent (discrepancies across records). Mining on dirty data produces unreliable, misleading, or outright wrong patterns — "garbage in, garbage out." Clean data is a prerequisite for trustworthy analysis.

Dirty Data ──[Data Cleaning]──▶ Clean Data ──▶ reliable mining results │ ├─ missing values ├─ noise/outliers └─ inconsistencies

What is Data Integration? Its Role in Data Mining

Data Integration merges data from multiple heterogeneous sources (different databases, flat files, ERP systems, external feeds) into a single, coherent data store for mining.

Key challenges handled during integration:

Entity identification problem — recognizing that the same real-world entity may be represented differently across sources (e.g., "customer_id" in one DB vs "cust_no" in another) — requires matching schema and metadata.

Redundancy and correlation analysis — an attribute may be redundant if it can be derived from another attribute (present in a different source under a different name); correlation tests (Pearson r for numeric, chi-square for categorical) help detect and eliminate such redundancy.

Detection and resolution of data value conflicts — the same real-world entity may have different attribute values in different sources due to different scales, encodings, or units (e.g., weight in kg vs lbs).

Source A (RDBMS) ──┐ Source B (Files) ──┼──▶ [Data Integration: entity matching, redundancy Source C (ERP) ──┘ removal, conflict resolution] ──▶ Unified Dataset

Role in Data Mining

Data integration ensures that the mining algorithms operate on a single, consistent view of the data rather than fragmented, conflicting sources. Without proper integration:

Duplicate records (from unresolved entity matches) can bias frequency-based mining (e.g., inflating support counts in association rule mining).

Conflicting values for the same entity can corrupt classification/clustering models.

Redundant attributes can slow down mining and distort distance/similarity-based algorithms.

In short: data cleaning ensures the data is accurate, while data integration ensures the data is complete and consistent across sources — together they form the foundation that makes all downstream mining results trustworthy.
Q9a. Define Classification and Prediction. List the major issues in Classification and Prediction.20257m
Module 3: Classification and Prediction
Define Classification and Prediction. List the major issues in Classification and Prediction.

View this question on its own page →
Search Google Ask AI
Worked Solution
Classification and Prediction — Definitions & Major Issues

Definitions

Classification is a supervised learning process. A model (classifier) is first built from a labelled training set — tuples whose class labels are known — using a learning algorithm (e.g., decision tree, naïve Bayes, neural network, SVM). The learned classifier is then used to assign new, unseen tuples to one of the discrete, predefined classes. It is a two-step process: model construction (training) followed by model usage (classification). Its output is categorical, and its quality is measured by classification accuracy (the percentage of correctly classified test tuples).

Prediction is the broader task of estimating unknown values from historical data.

When the unknown value is numeric/continuous, it is called prediction or regression (e.g., predicting house prices) and is judged by error measures such as mean squared error.

When the unknown value is categorical, the task reduces to classification.

Thus classification is a special case of prediction for discrete labels, while regression is prediction for continuous values.

Major Issues in Classification and Prediction

Three major groups of issues must be addressed:

1. Preparing the data:

Missing/incomplete data — tuples with missing attribute values may need filling, or the tuple discarded.

Noise and outliers — remove/smooth noisy points and outliers so they do not distort the model.

Attribute relevance & redundancy — irrelevant (e.g., a student ID) or redundant attributes must be removed to avoid overfitting and slow training.

Normalisation / scaling — techniques like min-max or z-score normalisation prevent attributes with larger numeric ranges from dominating distance-based approaches.

2. Data availability and system storage:

With very large datasets, some algorithms cannot hold all data in memory; techniques such as focused sampling and incremental/streaming induction are needed.

Training and test data must be carefully partitioned (e.g., holdout or $k$ -fold cross-validation) so the estimated accuracy is reliable.

3. Model quality — accuracy, speed and interpretability:

Misclassification costs / false positives vs false negatives — in medicine or fraud detection a wrong prediction has different costs, so accuracy alone may not suffice.

Speed — time to build the model (training) and to apply it on new objects (testing).

Linearity vs non-linearity — whether a linear model suffices or a non-linear model is required.

Robustness to noise and outliers — the model should not change drastically because of noisy data.

Interpretability — the model should be understandable to the user where necessary (e.g., decision-tree rules vs a black-box neural net).

Overfitting / generalisation — comparing model performance on unseen test data (holdout) so the learner does not memorise the training data.

In short, the main issues come down to clean, well-scaled data, a sound training/test framework, and a model that balances accuracy, speed, and interpretability.
Q9b. Define Clustering. Discuss Model-Based Clustering techniques.20257m
Module 4: Cluster Analysis
Define Clustering. Discuss Model-Based Clustering techniques.

View this question on its own page →
Search Google Ask AI
Worked Solution
Clustering & Model-Based Clustering

Definition of Clustering

Clustering is the process of grouping a set of data objects into classes (clusters) so that objects within the same cluster are as similar to one another as possible, and objects in different clusters are as dissimilar as possible. It is an unsupervised learning task because no class labels are assumed known in advance. Similarity/dissimilarity is usually measured by a distance (Euclidean, Manhattan, etc.) or by correlation.

Example: grouping customers by purchasing behaviour into clusters such as "low spenders", "regular buyers", "occasional big-ticket buyers", etc.

Clustering is used for data compression, outlier detection, market segmentation, bioinformatics (gene grouping), and as a pre-processing step for other mining tasks.

Model-Based Clustering Techniques

Model-based methods assume that the data fit a probabilistic (statistical mixture) model, and try to find the best fit of the data to the assumed model, usually by maximising the likelihood of the model having generated the observed data. Each cluster is modelled by a probability distribution (e.g., a Gaussian) rather than by a centroid alone.

1. Statistical approach — Expectation–Maximization (EM) for Gaussian mixtures (GMM).
Assume the data come from a mixture of $K$ Gaussian distributions; each cluster is one component distribution with its own mean $\mu_k$ and covariance $\Sigma_k$ , mixed with weight $\pi_k$ . EM iterates two steps:

E-step (expectation): compute for every point its probability (responsibility) of belonging to each cluster using Bayes' rule:

$\text{responsibility}(i,k) = \frac{\pi_k \, p(x_i \mid \mu_k, \Sigma_k)}{\sum_j \pi_j p(x_i \mid \mu_j, \Sigma_j)}$

M-step (maximisation): re-estimate the parameters $\pi_k$ , $\mu_k$ , $\Sigma_k$ by maximising the expected likelihood, using each point's responsibility values as weights.

The two steps are repeated until the likelihood (or the parameters) converges. Each object is assigned to the cluster for which its responsibility is highest.

2. Neural-network/symbolic models (self-organising maps, SOM).
Each cluster corresponds to a node (neuron) with a prototype; competitive learning adjusts the winning neuron and its neighbourhood, producing clusters on a low-dimensional map.

3. Fuzzy / probabilistic clustering (fuzzy c-means).
Instead of a hard assignment, every point receives a degree of membership in every cluster (between 0 and 1), a fuzzy generalisation of model-based membership.

4. Model selection.
The appropriate number of clusters $K$ can be chosen using statistical criteria such as BIC (Bayesian Information Criterion) or AIC, comparing how well models with different $K$ fit the data.

Advantages of model-based clustering:

Can model clusters of different shapes, sizes and orientations (through each cluster's covariance), unlike k-Means.

Provides a probabilistic interpretation — each object has posterior membership probabilities.

Offers a sound statistical basis (likelihood), and $K$ need not be fixed exactly — model-selection criteria guide the choice.

Limitations:

A parametric form must be assumed; if the assumption is wrong, the results may be poor.

EM can converge to a local optimum, is sensitive to initial parameters, and is computationally heavier than simple partitioning methods.

cluster 1 cluster 2 (Gaussian: μ1, Σ1) (Gaussian: μ2, Σ2) ~~~~~︿~~~~ ~~~~~︿~~~~ EM assigns each point to the most likely bell curve (posterior probability) → soft membership

Previous year2024 Next year2026

AI LearningWeb Platform

Coursify — Personal AI Course Generator

Struggling with a difficult subject or concept? Turn any engineering topic into a structured course with interactive lessons, quizzes, and research-backed explanations.

Try Coursify Free

Data Mining

Pocketly on Android

Data Warehouse — Definition & Architecture

Definition

Architecture Diagram

Key Layers

What is OLAP?

Main Components of a Data Warehouse System

Data Mining vs Data Warehousing + 3 Functionalities

What is Data Mining?

Data Mining vs Data Warehousing

Three Functionalities of Data Mining

Data Reduction, Data Discretization & Preprocessing Steps

Data Reduction

Data Discretization

Major Steps in Data Preprocessing

Association Rule Mining — Definition, Example & Constraint-Based Mining

Definition

Example

Constraint-Based Association Mining

Association Rule Mining: Definition, Support, Confidence & Correlation Extension

Definition with Example

Support and Confidence

Extending to Correlation Analysis

Worked Example

Classification & Prediction + Naïve Bayesian Classification

Classification and Prediction — Definitions

Bayesian Classification

Naïve Bayes — a Simple Example

Working of the Decision Tree Method for Classification

What is a Decision Tree?

Step-by-Step Construction (Tree Induction)

Example Dataset

Classification (Prediction) Phase

Advantages

Limitations

Support Vector Machines (SVM) — Working & Applications

Working

Applications in Data Mining

Advantages

Limitations

Partitioning vs Hierarchical Clustering & Outlier Analysis

Partitioning vs Hierarchical Clustering

Outlier Analysis

Pocketly on Android

Spatial Data Mining & Types of Web Mining

What is Spatial Data Mining?

Web Mining and its Major Types

Text Mining & Mining the World Wide Web

Text Mining — Definition and Challenges

Mining the World Wide Web — Challenges and Techniques

Data Warehouse — Definition, Key Features & OLTP vs OLAP

Definition

Key Features

OLTP vs OLAP

Data Cleaning & Data Integration

What is Data Cleaning? Why is it needed?

What is Data Integration? Its Role in Data Mining

Role in Data Mining

Classification and Prediction — Definitions & Major Issues

Definitions

Major Issues in Classification and Prediction

Clustering & Model-Based Clustering

Definition of Clustering

Model-Based Clustering Techniques

Coursify — Personal AI Course Generator