Data Mining Study guides
10 Data Mining (CSC213) topics with plain explanations and practice questions. Free on BASMAGLY.
Data Mining (CSC213)
Lecture 1: Introduction
- What is Data Mining? Tasks: Classification, Clustering, Regression, Association Rules
Data mining is the extraction of interesting, non-obvious and useful patterns or knowledge from huge amounts of data. Its tasks are split into predictive tasks and descriptive tasks. - The KDD Process: Knowledge Discovery in Databases Steps
KDD (knowledge discovery in databases) is the overall process of turning raw data into knowledge; data mining is the pattern-finding step inside it.
Lecture 2: Data
- Types of Attributes: Nominal, Ordinal, Interval and Ratio
An attribute is a property or characteristic of an object. The four attribute types differ by which properties they support: distinctness, order, meaningful differences and meaningful ratios.
Lecture 3: Data Preprocessing
- Data Cleaning: Noise, Outliers, Missing Values and Inconsistent Data
Data cleaning removes noise and inconsistent data and fills in missing values so mining works on reliable input. - Binning: Equal-Width vs Equal-Frequency (Equal-Depth) with Examples
Binning splits sorted numeric values into bins. Equal-width bins have the same range; equal-frequency (equal-depth) bins hold approximately the same number of values. - Data Normalization: Min-Max, Z-Score and Decimal Scaling with Examples
Normalization rescales attribute values to a common range so attributes with large values do not dominate distance-based methods. - Quartiles, IQR and the 1.5 x IQR Outlier Rule
The interquartile range (IQR = Q3 - Q1) measures the spread of the middle half of the data; values beyond 1.5 x IQR from the quartiles are flagged as outliers. - Data Reduction: Sampling, Aggregation, Dimensionality Reduction and Compression
Data reduction produces a smaller representation of the data that gives the same or almost the same analytical results.
Lecture 6: Classification
- Decision Trees: Gini Index, Information Gain and How Splits Are Chosen
A decision tree classifies records with a series of attribute tests. At each node a greedy algorithm picks the test that most reduces impurity, measured by the Gini index or entropy.
Lecture 4: Similarity
- Similarity and Dissimilarity Measures and k-Nearest Neighbours
Similarity is a numerical measure of how alike two data objects are; dissimilarity is a numerical measure of how different they are. k-nearest neighbours classifies a new record by the closest training records.
BASMAGLY is an independent student project, not an official Delta University site. Check lectures and your instructor for the final word.