Download 005 Descriptive Data Analysis

Data Mining MTAT.03.183 Descrip5ve analysis, preprocessing, visualisa5on... Jaak Vilo 2012 Fall Why Data Preprocessing?
n 
Data in the real world is dirty
n  incomplete: lacking attribute values, lacking
certain attributes of interest, or containing
only aggregate data
n 
n 
noisy: containing errors or outliers
n 
n 
e.g., occupation=“ ”
e.g., Salary=“-10”
inconsistent: containing discrepancies in codes
or names
n 
n 
n 
October 24, 2012
e.g., Age=“42” Birthday=“03/07/1997”
e.g., Was rating “1,2,3”, now rating “A, B, C”
e.g., discrepancy between duplicate records
Data Mining: Concepts and Techniques
2
Why Is Data Dirty?
n 
Incomplete data may come from
n 
n 
n 
n 
Noisy data (incorrect values) may come from
n 
n 
n 
n 
Faulty data collection instruments
Human or computer error at data entry
Errors in data transmission
Inconsistent data may come from
n 
n 
n 
“Not applicable” data value when collected
Different considerations between the time when the data was
collected and when it is analyzed.
Human/hardware/software problems
Different data sources
Functional dependency violation (e.g., modify some linked data)
Duplicate records also need data cleaning
October 24, 2012
Data Mining: Concepts and Techniques
3
Why Is Data Preprocessing Important?
n 
No quality data, no quality mining results!
n 
Quality decisions must be based on quality data
n 
n 
n 
n 
e.g., duplicate or missing data may cause incorrect or even
misleading statistics.
Data warehouse needs consistent integration of quality
data
Data extraction, cleaning, and transformation comprises
the majority of the work of building a data warehouse
Garbage in, garbage out
October 24, 2012
Data Mining: Concepts and Techniques
4
High quality data requirements
n 
n 
n 
n 
n 
n 
n 
n 
n 
High-quality data needs to pass a set of quality criteria. Those
include:
Accuracy: an aggregated value over the criteria of integrity,
consistency, and density
Integrity: an aggregated value over the criteria of completeness and
validity
Completeness: achieved by correcting data containing anomalies
Validity: approximated by the amount of data satisfying integrity
constraints
Consistency: concerns contradictions and syntactical anomalies
Uniformity: directly related to irregularities and in compliance with
the set 'unit of measure'
Density: the quotient of missing values in the data and the number
of total values ought to be known
http://en.wikipedia.org/wiki/Data_cleansing
October 25, 2012
n 
Data Mining: Concepts and Techniques
5
October 24, 2012
Data Mining: Concepts and Techniques
6
Multi-Dimensional Measure of Data Quality
n 
n 
A well-accepted multidimensional view:
n  Accuracy
n  Completeness
n  Consistency
n  Timeliness
n  Believability
n  Value added
n  Interpretability
n  Accessibility
Broad categories:
n  Intrinsic, contextual, representational, and accessibility
October 24, 2012
Data Mining: Concepts and Techniques
7
Major Tasks in Data Preprocessing
n 
Data cleaning
n 
n 
Data integration
n 
n 
Normalization and aggregation
Data reduction
n 
n 
Integration of multiple databases, data cubes, or files
Data transformation
n 
n 
Fill in missing values, smooth noisy data, identify or remove
outliers, and resolve inconsistencies
Obtains reduced representation in volume but produces the same
or similar analytical results
Data discretization
n 
Part of data reduction but with particular importance, especially
for numerical data
October 24, 2012
Data Mining: Concepts and Techniques
8
Forms of Data Preprocessing
October 24, 2012
Data Mining: Concepts and Techniques
9
Chapter 2: Data Preprocessing
n 
Why preprocess the data?
n 
Descriptive data summarization
n 
Data cleaning
n 
Data integration and transformation
n 
Data reduction
n 
Discretization and concept hierarchy generation
n 
Summary
October 24, 2012
Data Mining: Concepts and Techniques
10
•  1.51 9.36 5.93 2.09 4.67 7.38 8.83 2.35 4.90 4.00 7.25 6.93 8.22 2.15 4.04 5.00 6.15 5.39 0.09 6.39 3.78 1.37 4.44 8.45 8.97 2.39 6.08 4.04 3.39 0.87 9.61 5.33 6.46 4.08 8.16 6.41 7.64 5.41 6.95 8.30 0.61 9.48 9.87 1.05 5.50 4.18 9.86 1.45 1.48 5.95 0.85 9.16 3.10 3.45 5.58 0.99 7.52 1.26 8.64 0.39 9.32 7.17 8.96 9.27 1.53 6.08 8.97 0.03 8.75 8.85 0.58 8.33 8.90 6.71 9.53 1.37 5.01 0.58 0.45 2.26 7.44 9.90 4.57 8.24 0.02 7.37 1.00 9.48 0.50 4.50 0.21 5.62 7.07 7.81 5.33 9.14 7.68 6.95 2.85 8.39 October 24, 2012
Data Mining: Concepts and Techniques
11
Characterise data use Big_University_DB mine characteris5cs as "Science_Students" in relevance to name,gender,major,birth_date,residence,pho
ne#,gpa from student where status in graduate Jaak Vilo and other authors UT: Data Mining 2009 12 Mining Data Descriptive Characteristics
n 
Motivation
n 
n 
Data dispersion characteristics
n 
n 
n 
To better understand the data: central tendency, variation
and spread
median, max, min, quantiles, outliers, variance, etc.
Numerical dimensions correspond to sorted intervals
n 
Data dispersion: analyzed with multiple granularities of
precision
n 
Boxplot or quantile analysis on sorted intervals
Dispersion analysis on computed measures
n 
Folding measures into numerical dimensions
n 
Boxplot or quantile analysis on the transformed cube
October 24, 2012
Data Mining: Concepts and Techniques
13
Measuring the Central Tendency
1 n
xi
∑
n  Mean (algebraic measure) (sample vs. population): x =
n i =1
n 
n 
n 
Weighted arithmetic mean:
N
n
∑w x
i
Trimmed mean: chopping extreme values
x=
i
i =1
n
∑w
i
Median: A holistic measure
n 
x
∑
µ=
i =1
Middle value if odd number of values, or average of the middle two
values otherwise
n 
n 
Estimated by interpolation (for grouped data):
median = L1 + (
Mode
n 
Value that occurs most frequently in the data
n 
Unimodal, bimodal, trimodal
n 
Empirical formula:
October 24, 2012
n / 2 − (∑ f )l
f median
)c
mean − mode = 3 × (mean − median )
Data Mining: Concepts and Techniques
14
• 
• 
Histograms and Probability Density FuncSons Probability Density FuncSons – 
• 
Frequency Histograms – 
– 
– 
• 
Total area under curve integrates to 1 Y-­‐axis is counts Simple interpretaSon Can't be directly related to probabiliSes or density funcSons RelaSve Frequency Histograms – 
– 
– 
– 
Divide counts by total number of observaSons Y-­‐axis is relaSve frequency Can be interpreted as probabiliSes for each range Can't be directly related to density funcSon • 
• 
Bar heights sum to 1 but won't integrate to 1 unless bar width = 1 Density Histograms – 
– 
– 
– 
Divide counts by (total number of observaSons X bar width) Y-­‐axis is density values Bar height X bar width gives probability for each range Can be directly related to density funcSon • 
Bar areas sum to 1 http://www.geog.ucsb.edu/~joel/g210_w07/lecture_notes/lect04/oh07_04_1.html
Jaak Vilo and other authors UT: Data Mining 2009 15 Jaak Vilo and other authors UT: Data Mining 2009 16 Jaak Vilo and other authors UT: Data Mining 2009 17 Jaak Vilo and other authors UT: Data Mining 2009 18 histograms •  equal sub-­‐intervals, known as `bins‘ •  break points •  bin width Jaak Vilo and other authors UT: Data Mining 2009 19 The data are (the log of) wing spans of aircraft built in from 1956 - 1984.
Jaak Vilo and other authors UT: Data Mining 2009 20 Jaak Vilo and other authors UT: Data Mining 2009 21 Jaak Vilo and other authors UT: Data Mining 2009 22 Histogram vs kernel density •  properSes of histograms with these two examples: –  they are not smooth –  depend on end points of bins –  depend on width of bins •  We can alleviate the first two problems by using kernel density es5mators. •  To remove the dependence on the end points of the bins, we centre each of the blocks at each data point rather than fixing the end points of the blocks. Jaak Vilo and other authors UT: Data Mining 2009 23 block of width 1 and height 1/12 (the dotted boxes) as they
are 12 data points, and then add them up
Jaak Vilo and other authors UT: Data Mining 2009 24 •  Blocks -­‐ it is sSll disconSnuous as we have used a disconSnuous kernel as our building block •  If we use a smooth kernel for our building block, then we will have a smooth density esSmate. Jaak Vilo and other authors UT: Data Mining 2009 25 •  It's important to choose the most appropriate bandwidth as a value that is too small or too large is not useful. •  If we use a normal (Gaussian) kernel with bandwidth or standard deviaSon of 0.1 (which has area 1/12 under the each curve) then the kernel density esSmate is said to undersmoothed as the bandwidth is too small in the figure below. •  It appears that there are 4 modes in this density -­‐ some of these are surely arSfices of the data. Jaak Vilo and other authors UT: Data Mining 2009 26 Jaak Vilo and other authors UT: Data Mining 2009 27 Jaak Vilo and other authors UT: Data Mining 2009 28 •  Choose opSmal bandwith –  Need to esSmate it •  AMISE = AsymptoSc Mean Integrated Squared Error •  opSmal bandwidth = arg min AMISE Jaak Vilo and other authors UT: Data Mining 2009 29 •  The opSmal value of the bandwidth for our dataset is about 0.25. •  From the opSmally smoothed kernel density esSmate, there are two modes. As these are the log of aircraj wing span, it means that there were a group of smaller, lighter planes built, and these are clustered around 2.5 (which is about 12 m). •  Whereas the larger planes, maybe using jet engines as these used on a commercial scale from about the 1960s, are grouped around 3.5 (about 33 m). Jaak Vilo and other authors UT: Data Mining 2009 30 Jaak Vilo and other authors UT: Data Mining 2009 31 •  The properSes of kernel density esSmators are, as compared to histograms: –  smooth –  no end points –  depend on bandwidth Jaak Vilo and other authors UT: Data Mining 2009 32 Kernel Density esSmaSon •  Ricardo GuSerrez-­‐Osuna hnp://research.cs.tamu.edu/prism/lectures/pr/pr_l7.pdf •  Tutorial and Java applet for tesSng: –  hnp://parallel.vub.ac.be/research/causalModels/tutorial/kde.html Jaak Vilo and other authors UT: Data Mining 2009 33 Jaak Vilo and other authors UT: Data Mining 2009 34 R – example (due K. Tretjakov) d = c(1,2,2,2,2,1,2,2,2,3,2,3,4,5,4,3,2,3,4,4,5,6,7); kernelsmooth <-­‐ funcSon(data, sigma, x) { result = 0; for (d in data) { result = result + exp(-­‐(x-­‐d)^2/2/sigma^2); } result/sqrt(2*pi)/sigma; } x = seq(min(d), max(d), by=0.1); y = sapply(x, funcSon(x) { kernelsmooth(d, 1, x) }); hist(d); lines(x,y); Jaak Vilo and other authors UT: Data Mining 2009 35 hnp://parallel.vub.ac.be/research/causalModels/tutorial/kde.html Jaak Vilo and other authors UT: Data Mining 2009 36 Jaak Vilo and other authors UT: Data Mining 2009 37 Jaak Vilo and other authors UT: Data Mining 2009 38 hnp://jmlr.csail.mit.edu/proceedings/papers/v2/kontkanen07a/kontkanen07a.pdf Jaak Vilo and other authors UT: Data Mining 2009 39 Jaak Vilo and other authors UT: Data Mining 2009 40 •  R tutorial –  hnp://cran.r-­‐project.org/doc/manuals/R-­‐
intro.html –  hnp://www.google.com/search?q=R+tutorial Jaak Vilo and other authors UT: Data Mining 2009 41 More links on R and kernel density •  hnp://en.wikipedia.org/wiki/Kernel_density_esSmaSon •  hnp://sekhon.berkeley.edu/stats/html/density.html •  hnp://stat.ethz.ch/R-­‐manual/R-­‐patched/library/stats/html/
density.html •  hnp://www.google.com/search?q=kernel+density+esSmaSon+R Jaak Vilo and other authors UT: Data Mining 2009 42 Jaak Vilo and other authors UT: Data Mining 2009 43 Jaak Vilo and other authors UT: Data Mining 2009 44 Jaak Vilo and other authors UT: Data Mining 2009 45 Jaak Vilo and other authors UT: Data Mining 2009 46 Symmetric vs. Skewed Data
n 
Median, mean and mode of
symmetric, positively and
negatively skewed data
October 24, 2012
Data Mining: Concepts and Techniques
47
Measuring the Dispersion of Data
n 
Quartiles, outliers and boxplots
n 
Quartiles: Q1 (25th percentile), Q3 (75th percentile)
n 
Inter-quartile range: IQR = Q3 – Q1
n  Five
n 
number summary: min, Q1, M, Q3, max
Boxplot: ends of the box are the quartiles, median is marked, whiskers, and
plot outlier individually
n 
n 
Outlier: usually, a value higher/lower than 1.5 x IQR
Variance and standard deviation (sample: s, population: σ)
n 
Variance: (algebraic, scalable computation)
1 n
1 n 2 1 n 2
2
s =
( xi − x ) =
[∑ xi − (∑ xi ) ]
∑
n − 1 i =1
n − 1 i =1
n i =1
2
n 
1
σ =
N
2
n
1
(
x
−
µ
)
=
∑
i
N
i =1
2
n
∑x
i
2
− µ2
i =1
Standard deviation s (or σ) is the square root of variance s2 (or σ2)
October 24, 2012
Data Mining: Concepts and Techniques
48
Properties of Normal Distribution Curve
n 
The normal (distribution) curve
n  From μ–σ to μ+σ: contains about 68% of the
measurements (μ: mean, σ: standard deviation)
n  From μ–2σ to μ+2σ: contains about 95% of it
n  From μ–3σ to μ+3σ: contains about 99.7% of it
October 24, 2012
Data Mining: Concepts and Techniques
49
Boxplot Analysis
n 
Five-number summary of a distribution:
Minimum, Q1, M, Q3, Maximum
n 
Boxplot
n 
n 
n 
n 
Data is represented with a box
The ends of the box are at the first and third
quartiles, i.e., the height of the box is IRQ
The median is marked by a line within the box
Whiskers: two lines outside the box extend to
Minimum and Maximum
October 24, 2012
Data Mining: Concepts and Techniques
50
Box Plots •  Tukey77: John W. Tukey, "Exploratory Data Analysis". Addison-­‐Wesley, Reading, MA. 1977. •  hnp://informaSonandvisualizaSon.de/blog/box-­‐plot •  Jaak Vilo and other authors UT: Data Mining 2009 51 Jaak Vilo and other authors UT: Data Mining 2009 52 Jaak Vilo and other authors UT: Data Mining 2009 53 Jaak Vilo and other authors UT: Data Mining 2009 54 Visualization of Data Dispersion: Boxplot Analysis
October 24, 2012
Data Mining: Concepts and Techniques
55
October 24, 2012
Data Mining: Concepts and Techniques
56
October 24, 2012
Data Mining: Concepts and Techniques
57
Violin plot
58
Violin plot - R
http://gallery.r-enthusiasts.com/graph/Violin_plot,43
59
n 
Example of plots-containing article:
n  http://www.kgs.ku.edu/Magellan/WaterLevels/
CD/Reports/OFR04_57/rep00.htm
October 24, 2012
Data Mining: Concepts and Techniques
60
Quantile-Quantile (q-q) Plots
n 
http://onlinestatbook.com/2/advanced_graphs/q-q_plots.html
October 24, 2012
Data Mining: Concepts and Techniques
61
Cumulative Distribution Function (CDF)
October 24, 2012
Data Mining: Concepts and Techniques
62
October 24, 2012
Data Mining: Concepts and Techniques
63
October 25, 2012
Data Mining: Concepts and Techniques
64
October 25, 2012
Data Mining: Concepts and Techniques
65
A Q–Q plot comparing the distributions of standardizeddaily maximum
temperatures at 25 stations in the US state of Ohio in March and in July. The
curved pattern suggests that the central quantiles are more closely spaced in
July than in March, and that the March distribution is skewed to the right
compared to the July distribution. The data cover the period 1893–2001.
October 25, 2012
Data Mining: Concepts and Techniques
66
October 25, 2012
Data Mining: Concepts and Techniques
67
Quantile Plot
n 
n 
Displays all of the data (allowing the user to assess both
the overall behavior and unusual occurrences)
Plots quantile information
n  For a data xi data sorted in increasing order, fi
indicates that approximately 100 fi% of the data are
below or equal to the value xi
October 24, 2012
Data Mining: Concepts and Techniques
68
Quantile-Quantile (Q-Q) Plot
n 
n 
Graphs the quantiles of one univariate distribution against
the corresponding quantiles of another
Allows the user to view whether there is a shift in going
from one distribution to another
http://en.wikipedia.org/wiki/Q-Q_plot
October 24, 2012
Data Mining: Concepts and Techniques
69
n 
Parametric modeling usually involves making
assumptions about the shape of data, or the
shape of residuals from a regression fit. Verifying
such assumptions can take many forms, but an
exploration of the shape using histograms and qq plots is very effective. The q-q plot does not
have any design parameters such as the number
of bins for a histogram.
October 25, 2012
Data Mining: Concepts and Techniques
70
Kemmeren et.al. (Mol. Cell, 2002)
Randomized expression data
Yeast 2-hybrid studies
Known (literature) PPI
MPK1 YLR350w
SNF4 YCL046W"
SNF7 YGR122W.
Scatter plot
n 
n 
Provides a first look at bivariate data to see clusters of
points, outliers, etc
Each pair of values is treated as a pair of coordinates and
plotted as points in the plane
October 24, 2012
Data Mining: Concepts and Techniques
72
October 24, 2012
Data Mining: Concepts and Techniques
73
Not Correlated Data
October 24, 2012
Data Mining: Concepts and Techniques
74
Numerical summary?
October 24, 2012
Data Mining: Concepts and Techniques
75
Anscombe’s quartet
October 24, 2012
Data Mining: Concepts and Techniques
76
October 24, 2012
Data Mining: Concepts and Techniques
77
Loess Curve
n 
n 
Adds a smooth curve to a scatter plot in order to
provide better perception of the pattern of dependence
Loess curve is fitted by setting two parameters: a
smoothing parameter, and the degree of the
polynomials that are fitted by the regression
October 24, 2012
Data Mining: Concepts and Techniques
78
Graphic Displays of Basic Statistical Descriptions
n 
n 
n 
n 
n 
n 
Histogram: (shown before)
Boxplot: (covered before)
Quantile plot: each value xi is paired with fi indicating
that approximately 100 fi % of data are ≤ xi
Quantile-quantile (q-q) plot: graphs the quantiles of one
univariant distribution against the corresponding quantiles
of another
Scatter plot: each pair of values is a pair of coordinates
and plotted as points in the plane
Loess (local regression) curve: add a smooth curve to a
scatter plot to provide better perception of the pattern of
dependence
October 24, 2012
Data Mining: Concepts and Techniques
79
Chapter 2: Data Preprocessing
n 
Why preprocess the data?
n 
Descriptive data summarization
n 
Data cleaning
n 
Data integration and transformation
n 
Data reduction
n 
Discretization and concept hierarchy generation
n 
Summary
October 24, 2012
Data Mining: Concepts and Techniques
80
Data Cleaning
n 
n 
Importance
n  “Data cleaning is one of the three biggest problems
in data warehousing”—Ralph Kimball
n  “Data cleaning is the number one problem in data
warehousing”—DCI survey
Data cleaning tasks
n 
Fill in missing values
n 
Identify outliers and smooth out noisy data
n 
Correct inconsistent data
n 
Resolve redundancy caused by data integration
October 24, 2012
Data Mining: Concepts and Techniques
81
Missing Data
n 
Data is not always available
n 
n 
Missing data may be due to
n 
equipment malfunction
n 
inconsistent with other recorded data and thus deleted
n 
data not entered due to misunderstanding
n 
n 
n 
E.g., many tuples have no recorded value for several
attributes, such as customer income in sales data
certain data may not be considered important at the time of
entry
not register history or changes of the data
Missing data may need to be inferred.
October 24, 2012
Data Mining: Concepts and Techniques
82
How to Handle Missing Data?
n 
Ignore the tuple: usually done when class label is missing (assuming
the tasks in classification—not effective when the percentage of
missing values per attribute varies considerably.
n 
Fill in the missing value manually: tedious + infeasible?
n 
Fill in it automatically with
n 
a global constant : e.g., “unknown”, a new class?!
n 
the attribute mean
n 
the attribute mean for all samples belonging to the same class:
smarter
n 
the most probable value: inference-based such
as Bayesian formula or decision tree
October 24, 2012
Data Mining: Concepts and Techniques
83
K-NN impute
n 
K nearest neighbours imputation
n 
Find K neighbours on available data points
n 
Estimate the missing value
n 
(Hastie, Tibshirani, Troyanskaya, … Stanford
1999-2001)
October 24, 2012
Data Mining: Concepts and Techniques
84
October 24, 2012
Data Mining: Concepts and Techniques
85
Noisy Data
n 
n 
n 
Noise: random error or variance in a measured variable
Incorrect attribute values may due to
n  faulty data collection instruments
n  data entry problems
n  data transmission problems
n  technology limitation
n  inconsistency in naming convention
Other data problems which requires data cleaning
n  duplicate records
n  incomplete data
n  inconsistent data
October 24, 2012
Data Mining: Concepts and Techniques
86
How to Handle Noisy Data?
n 
n 
n 
n 
Binning
n  first sort data and partition into (equal-frequency) bins
n  then one can smooth by bin means, smooth by bin
median, smooth by bin boundaries, etc.
Regression
n  smooth by fitting the data into regression functions
Clustering
n  detect and remove outliers
Combined computer and human inspection
n  detect suspicious values and check by human (e.g.,
deal with possible outliers)
October 24, 2012
Data Mining: Concepts and Techniques
87
Simple Discretization Methods: Binning
n 
Equal-width (distance) partitioning
n 
Divides the range into N intervals of equal size: uniform grid
n 
if A and B are the lowest and highest values of the attribute, the
width of intervals will be: W = (B –A)/N.
n 
n 
The most straightforward, but outliers may dominate presentation
n 
Skewed data is not handled well
Equal-depth (frequency) partitioning
n 
Divides the range into N intervals, each containing approximately
same number of samples
n 
Good data scaling
n 
Managing categorical attributes can be tricky
October 24, 2012
Data Mining: Concepts and Techniques
88
Binning Methods for Data Smoothing
Sorted data for price (in dollars): 4, 8, 9, 15, 21, 21, 24, 25, 26,
28, 29, 34
* Partition into equal-frequency (equi-depth) bins:
- Bin 1: 4, 8, 9, 15
- Bin 2: 21, 21, 24, 25
- Bin 3: 26, 28, 29, 34
* Smoothing by bin means:
- Bin 1: 9, 9, 9, 9
- Bin 2: 23, 23, 23, 23
- Bin 3: 29, 29, 29, 29
* Smoothing by bin boundaries:
- Bin 1: 4, 4, 4, 15
- Bin 2: 21, 21, 25, 25
- Bin 3: 26, 26, 26, 34
q 
October 24, 2012
Data Mining: Concepts and Techniques
89
Regression
y
Y1
y=x+1
Y1’
X1
October 24, 2012
Data Mining: Concepts and Techniques
x
90
Cluster Analysis
G1
G3
G2
October 25, 2012
Data Mining: Concepts and Techniques
91
Data Cleaning as a Process
n 
n 
n 
Data discrepancy detection
n  Use metadata (e.g., domain, range, dependency, distribution)
n  Check field overloading
n  Check uniqueness rule, consecutive rule and null rule
n  Use commercial tools
n  Data scrubbing: use simple domain knowledge (e.g., postal
code, spell-check) to detect errors and make corrections
n  Data auditing: by analyzing data to discover rules and
relationship to detect violators (e.g., correlation and clustering
to find outliers)
Data migration and integration
n  Data migration tools: allow transformations to be specified
n  ETL (Extraction/Transformation/Loading) tools: allow users to
specify transformations through a graphical user interface
Integration of the two processes
n  Iterative and interactive (e.g., Potter’s Wheels)
October 24, 2012
Data Mining: Concepts and Techniques
92
Chapter 2: Data Preprocessing
n 
Why preprocess the data?
n 
Data cleaning
n 
Data integration and transformation
n 
Data reduction
n 
Discretization and concept hierarchy generation
n 
Summary
October 24, 2012
Data Mining: Concepts and Techniques
93
Data Integration
n 
n 
n 
n 
Data integration:
n  Combines data from multiple sources into a coherent
store
Schema integration: e.g., A.cust-id ≡ B.cust-#
n  Integrate metadata from different sources
Entity identification problem:
n  Identify real world entities from multiple data sources,
e.g., Bill Clinton = William Clinton
Detecting and resolving data value conflicts
n  For the same real world entity, attribute values from
different sources are different
n  Possible reasons: different representations, different
scales, e.g., metric vs. British units
October 24, 2012
Data Mining: Concepts and Techniques
94
Handling Redundancy in Data Integration
n 
Redundant data occur often when integration of multiple
databases
n 
n 
n 
n 
Object identification: The same attribute or object
may have different names in different databases
Derivable data: One attribute may be a “derived”
attribute in another table, e.g., annual revenue
Redundant attributes may be able to be detected by
correlation analysis
Careful integration of the data from multiple sources may
help reduce/avoid redundancies and inconsistencies and
improve mining speed and quality
October 24, 2012
Data Mining: Concepts and Techniques
95
Normalisation
n 
Making data comparable…
October 24, 2012
Data Mining: Concepts and Techniques
96
Elements of microarray statistics
Reference
Test
M
= log2R – log2G
= log2(R/G)
A
= 1/2 (log2R + log2G)
Jaak Vilo and other authors UT: Data Mining 2009 98 Normalisation
can be used to
transform data
Expression Profiler
99
Chapter 2: Data Preprocessing
n 
Why preprocess the data?
n 
Data cleaning
n 
Data integration and transformation
n 
Data reduction
n 
Discretization and concept hierarchy generation
n 
Summary
October 24, 2012
Data Mining: Concepts and Techniques
100
Data Reduction Strategies
n 
n 
n 
Why data reduction?
n  A database/data warehouse may store terabytes of data
n  Complex data analysis/mining may take a very long time to run
on the complete data set
Data reduction
n  Obtain a reduced representation of the data set that is much
smaller in volume but yet produce the same (or almost the
same) analytical results
Data reduction strategies
n  Data cube aggregation:
n  Dimensionality reduction — e.g., remove unimportant attributes
n  Data Compression
n  Numerosity reduction — e.g., fit data into models
n  Discretization and concept hierarchy generation
October 24, 2012
Data Mining: Concepts and Techniques
101
Data Cube Aggregation
n 
n 
The lowest level of a data cube (base cuboid)
n 
The aggregated data for an individual entity of interest
n 
E.g., a customer in a phone calling data warehouse
Multiple levels of aggregation in data cubes
n 
n 
Reference appropriate levels
n 
n 
Further reduce the size of data to deal with
Use the smallest representation which is enough to
solve the task
Queries regarding aggregated information should be
answered using data cube, when possible
October 24, 2012
Data Mining: Concepts and Techniques
102
Attribute Subset Selection
n 
n 
Feature selection (i.e., attribute subset selection):
n  Select a minimum set of features such that the
probability distribution of different classes given the
values for those features is as close as possible to the
original distribution given the values of all features
n  reduce # of patterns in the patterns, easier to
understand
Heuristic methods (due to exponential # of choices):
n  Step-wise forward selection
n  Step-wise backward elimination
n  Combining forward selection and backward elimination
n  Decision-tree induction
October 24, 2012
Data Mining: Concepts and Techniques
103
Chapter 2: Data Preprocessing
n 
Why preprocess the data?
n 
Data cleaning
n 
Data integration and transformation
n 
Data reduction
n 
Discretization and concept hierarchy generation
n 
Summary
October 24, 2012
Data Mining: Concepts and Techniques
104
Discretization
n 
Three types of attributes:
n 
Nominal — values from an unordered set, e.g., color, profession
n 
Ordinal — values from an ordered set, e.g., military or academic
rank
n 
n 
Continuous — real numbers, e.g., integer or real numbers
Discretization:
n 
Divide the range of a continuous attribute into intervals
n 
Some classification algorithms only accept categorical attributes.
n 
Reduce data size by discretization
n 
Prepare for further analysis
October 24, 2012
Data Mining: Concepts and Techniques
105
Discretization and Concept Hierarchy
n 
Discretization
n 
Reduce the number of values for a given continuous attribute by
dividing the range of the attribute into intervals
n 
n 
Interval labels can then be used to replace actual data values
n 
Supervised vs. unsupervised
n 
Split (top-down) vs. merge (bottom-up)
n 
Discretization can be performed recursively on an attribute
Concept hierarchy formation
n 
Recursively reduce the data by collecting and replacing low level
concepts (such as numeric values for age) by higher level concepts
(such as young, middle-aged, or senior)
October 24, 2012
Data Mining: Concepts and Techniques
106
Segmentation by Natural Partitioning
n 
A simply 3-4-5 rule can be used to segment numeric data
into relatively uniform, “natural” intervals.
n 
If an interval covers 3, 6, 7 or 9 distinct values at the
most significant digit, partition the range into 3 equiwidth intervals
n 
If it covers 2, 4, or 8 distinct values at the most
significant digit, partition the range into 4 intervals
n 
If it covers 1, 5, or 10 distinct values at the most
significant digit, partition the range into 5 intervals
October 24, 2012
Data Mining: Concepts and Techniques
107
Example of 3-4-5 Rule
count
Step 1:
Step 2:
-$351
-$159
Min
Low (i.e, 5%-tile)
msd=1,000
profit
High(i.e, 95%-0 tile)
Low=-$1,000
$4,700
Max
High=$2,000
(-$1,000 - $2,000)
Step 3:
(-$1,000 - 0)
($1,000 - $2,000)
(0 -$ 1,000)
(-$400 -$5,000)
Step 4:
(-$400 - 0)
(-$400 -$300)
(-$300 -$200)
(-$200 -$100)
(-$100 0)
$1,838
October 24, 2012
($1,000 - $2, 000)
(0 - $1,000)
(0 $200)
($1,000 $1,200)
($200 $400)
($1,200 $1,400)
($1,400 $1,600)
($400 $600)
($600 $800)
($800 $1,000)
($1,600 ($1,800 $1,800)
$2,000)
Data Mining: Concepts and Techniques
($2,000 - $5, 000)
($2,000 $3,000)
($3,000 $4,000)
($4,000 $5,000)
108
-351,976.00 .. 4,700,896.50
Example MIN= -351,976.00
MAX=4,700,896.50
LOW = 5th percentile -159,876
HIGH = 95th percentile 1,838,761
msd = 1,000,000 (most significant digit)
LOW = -1,000,000 (round down) HIGH = 2,000,000 (round up)
3 value ranges
1. (-1,000,000 .. 0]
2. (0 .. 1,000,000]
3. (1,000,000 .. 2,000,000]
Adjust with real MIN and MAX
1.
2.
3.
4.
(-400,000 .. 0]
(0 .. 1,000,000]
(1,000,000 .. 2,000,000]
(2,000,000 .. 5,000,000]
October 24, 2012
Data Mining: Concepts and Techniques
109
Recursive …
1.1. (-400,000 .. -300,000 ]
1.2. (-300,000 .. -200,000 ]
1.3. (-200,000 .. -100,000 ]
1.4. (-100,000 .. 0 ]
2.1. (0 .. 200,000 ]
2.2. (200,000 .. 400,000 ]
2.3. (400,000 .. 600,000 ]
2.4. (600,000 .. 800,000 ]
2.5. (800,000 .. 1,000,000 ]
3.1. (1,000,000 .. 1,200,000 ]
3.2. (1,200,000 .. 1,400,000 ]
3.3. (1,400,000 .. 1,600,000 ]
3.4. (1,600,000 .. 1,800,000 ]
3.5. (1,800,000 .. 2,000,000 ]
4.1. (2,000,000 .. 3,000,000 ]
4.2. (3,000,000 .. 4,000,000 ]
4.3. (4,000,000 .. 5,000,000 ]
Jaak Vilo and other authors UT: Data Mining 2009 110 Concept Hierarchy Generation for Categorical Data
•  Specification of a partial/total ordering of attributes
explicitly at the schema level by users or experts
–  street < city < state < country
•  Specification of a hierarchy for a set of values by explicit
data grouping
–  {Urbana, Champaign, Chicago} < Illinois
•  Specification of only a partial set of attributes
–  E.g., only street < city, not others
•  Automatic generation of hierarchies (or attribute levels) by
the analysis of the number of distinct values
–  E.g., for a set of attributes: {street, city, state, country}
October 24, 2012
Data Mining: Concepts and Techniques 111
Automatic Concept Hierarchy Generation
n 
Some hierarchies can be automatically generated based
on the analysis of the number of distinct values per
attribute in the data set
n  The attribute with the most distinct values is placed
at the lowest level of the hierarchy
n  Exceptions, e.g., weekday, month, quarter, year
15 distinct values
country
province_or_ state
365 distinct values
city
3567 distinct values
street
October 24, 2012
674,339 distinct values
Data Mining: Concepts and Techniques
112
Chapter 2: Data Preprocessing
n 
Why preprocess the data?
n 
Data cleaning
n 
Data integration and transformation
n 
Data reduction
n 
Discretization and concept hierarchy
generation
n 
Summary
October 24, 2012
Data Mining: Concepts and Techniques
113
Summary
n 
n 
n 
n 
Data preparation or preprocessing is a big issue for both
data warehousing and data mining
Discriptive data summarization is need for quality data
preprocessing
Data preparation includes
n 
Data cleaning and data integration
n 
Data reduction and feature selection
n 
Discretization
A lot a methods have been developed but data
preprocessing still an active area of research
October 24, 2012
Data Mining: Concepts and Techniques
114
References
n 
D. P. Ballou and G. K. Tayi. Enhancing data quality in data warehouse environments. Communications
of ACM, 42:73-78, 1999
n 
T. Dasu and T. Johnson. Exploratory Data Mining and Data Cleaning. John Wiley & Sons, 2003
n 
T. Dasu, T. Johnson, S. Muthukrishnan, V. Shkapenyuk.
Mining Database Structure; Or, How to Build a Data Quality Browser. SIGMOD’02.
n 
H.V. Jagadish et al., Special Issue on Data Reduction Techniques. Bulletin of the Technical
Committee on Data Engineering, 20(4), December 1997
n 
D. Pyle. Data Preparation for Data Mining. Morgan Kaufmann, 1999
n 
E. Rahm and H. H. Do. Data Cleaning: Problems and Current Approaches. IEEE Bulletin of the
Technical Committee on Data Engineering. Vol.23, No.4
n 
V. Raman and J. Hellerstein. Potters Wheel: An Interactive Framework for Data Cleaning and
Transformation, VLDB’2001
n 
T. Redman. Data Quality: Management and Technology. Bantam Books, 1992
n 
Y. Wand and R. Wang. Anchoring data quality dimensions ontological foundations. Communications of
ACM, 39:86-95, 1996
n 
R. Wang, V. Storey, and C. Firth. A framework for analysis of data quality research. IEEE Trans.
Knowledge and Data Engineering, 7:623-640, 1995
October 24, 2012
Data Mining: Concepts and Techniques
115