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

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

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

Previous year2022

Data Mining

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, Support, Confidence & Correlation Extension

Definition with Example

Support and Confidence

Extending to Correlation Analysis

Worked Example

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