DATA MINING

Introductory and Advanced

Topics
Part I
Source :
Margaret H. Dunham
Department of Computer Science and Engineering
Southern Methodist University

Companion slides for the text by Dr. M.H.Dunham, Data Mining, Introductory and Advanced Topics,
Prentice Hall, 2002.
 PART I
Data Mining Outline
Introduction
Related Concepts
Data Mining Techniques
PART II
Classification
Clustering
Association Rules
PART III
Web Mining
Spatial Mining
Temporal Mining
 Introduction Outline
Goal: Provide an overview of data mining.

Define data mining

Data mining vs. databases
Basic data mining tasks
Data mining development
Data mining issues
 Introduction
Data is growing at a phenomenal
rate
Users expect more sophisticated
information
How?

UNCOVER HIDDEN INFORMATION

DATA MINING
 Data Mining Definition
Finding hidden information in a
database
Fit data to a model
Similar terms
Exploratory data analysis
Data driven discovery
Deductive learning
 Database Processing vs.
Data Mining Processing
Query Query
Well defined Poorly defined
SQL
No precise query
Data Data
language
Operational data Not operational data

Output Output
Precise Fuzzy
Subset of database Not a subset of database
Query Examples
Database
Find all credit applicants with last name of Smith.
Identify customers who have purchased more
than $10,000 in the last month.
Find all customers who have purchased milk
Data Mining
Find all credit applicants who are poor credit
risks. (classification)
Identify customers with similar buying habits.
(Clustering)
Find all items which are frequently purchased
with milk. (association rules)
Data Mining Models and Tasks
Basic Data Mining Tasks
Classification maps data into predefined groups or
classes
Supervised learning
Pattern recognition
Prediction
Regression is used to map a data item to a real
valued prediction variable.
Clustering groups similar data together into clusters.
Unsupervised learning
Segmentation
Partitioning
Basic Data Mining Tasks (contd)
Summarization maps data into subsets with
associated simple descriptions.
Characterization
Generalization
Link Analysis uncovers relationships among data.
Affinity Analysis
Association Rules
Sequential Analysis determines sequential patterns.
 Ex: Time Series Analysis
Example: Stock Market
Predict future values
Determine similar patterns over time
Classify behavior
 Data Mining vs. KDD

Knowledge Discovery in Databases (KDD):

process of finding useful information and
patterns in data.
Data Mining: Use of algorithms to extract the
information and patterns derived by the KDD
process.
 KDD Process

Modified from [FPSS96C]

Selection: Obtain data from various sources.

Preprocessing: Cleanse data.
Transformation: Convert to common format.
Transform to new format.
Data Mining: Obtain desired results.
Interpretation/Evaluation: Present results to user in
meaningful manner.
KDD Process Ex: Web Log
Selection:
Select log data (dates and locations) to use
Preprocessing:
Remove identifying URLs
Remove error logs
Transformation:
Sessionize (sort and group)
Data Mining:
Identify and count patterns
Construct data structure
Interpretation/Evaluation:
Identify and display frequently accessed sequences.
Potential User Applications:
Cache prediction
Personalization
 Data Mining Development
Similarity Measures
Hierarchical Clustering
Relational Data Model IR Systems
SQL Imprecise Queries
Association Rule Algorithms Textual Data
Data Warehousing
Scalability Techniques Web Search Engines

Bayes Theorem
Regression Analysis
EM Algorithm
K-Means Clustering
Time Series Analysis
Algorithm Design Techniques
Algorithm Analysis Neural Networks
Data Structures Decision Tree Algorithms
 KDD Issues
Human Interaction
Overfitting
Outliers
Interpretation
Visualization
Large Datasets
High Dimensionality
 KDD Issues (contd)
Multimedia Data
Missing Data
Irrelevant Data
Noisy Data
Changing Data
Integration
Application
Social Implications of
DM
Privacy
Profiling
Unauthorized use
Data Mining Metrics
Usefulness
Return on Investment (ROI)
Accuracy
Space/Time
Database Perspective on Data
Mining
Scalability
Real World Data
Updates
Ease of Use
Visualization Techniques
Graphical
Geometric
Icon-based
Pixel-based
Hierarchical
Hybrid
Related Concepts Outline
Goal: Examine some areas which are related to
data mining.
Database/OLTP Systems
Fuzzy Sets and Logic
Information Retrieval(Web Search Engines)
Dimensional Modeling
Data Warehousing
OLAP/DSS
Statistics
Machine Learning
Pattern Matching
 DB & OLTP Systems
Schema
(ID,Name,Address,Salary,JobNo)
Data Model
ER
Relational
Transaction
Query:
SELECT Name
FROM T
WHERE Salary > 100000

DM: Only imprecise queries

 Fuzzy Sets and Logic
Fuzzy Set: Set membership function is a real valued function
with output in the range [0,1].
f(x): Probability x is in F.
1-f(x): Probability x is not in F.
EX:
T = {x | x is a person and x is tall}
Let f(x) be the probability that x is tall
Here f is the membership function

DM: Prediction and classification are fuzzy.

Fuzzy Sets
 Classification/Prediction
is Fuzzy

Loan Reject Reject

Amnt
Accept Accept

Simple Fuzzy
 Information Retrieval
Information Retrieval (IR): retrieving desired information from
textual data.
Library Science
Digital Libraries
Web Search Engines
Traditionally keyword based
Sample query:
Find all documents about data mining.

DM: Similarity measures;

Mine text/Web data.
 Information Retrieval
(contd)
Similarity: measure of how close a query is
to a document.
Documents which are close enough are
retrieved.
Metrics:
Precision = |Relevant and Retrieved|
|Retrieved|
Recall = |Relevant and Retrieved|
|Relevant|
 IR Query Result
Measures and
Classification

IR Classification
 Dimensional Modeling
View data in a hierarchical manner more as business
executives might
Useful in decision support systems and mining
Dimension: collection of logically related attributes;
axis for modeling data.
Facts: data stored
Ex: Dimensions products, locations, date
Facts quantity, unit price

DM: May view data as dimensional.

Relational View of Data
ProdID LocID Date Quantity UnitPrice
123 Dallas 022900 5 25
123 Houston 020100 10 20
150 Dallas 031500 1 100
150 Dallas 031500 5 95
150 Fort 021000 5 80
Worth
150 Chicago 012000 20 75
200 Seattle 030100 5 50
300 Rochester 021500 200 5
500 Bradenton 022000 15 20
500 Chicago 012000 10 25
1
Dimensional Modeling Queries
Roll Up: more general dimension
Drill Down: more specific dimension
Dimension (Aggregation) Hierarchy
SQL uses aggregation
Decision Support Systems (DSS): Computer
systems and tools to assist managers in
making decisions and solving problems.
Cube view of Data
Aggregation Hierarchies
Star Schema
 Data Warehousing
Subject-oriented, integrated, time-variant, nonvolatile William
Inmon
Operational Data: Data used in day to day needs of company.
Informational Data: Supports other functions such as planning
and forecasting.
Data mining tools often access data warehouses rather than
operational data.

DM: May access data in warehouse.

 Operational vs. Informational

Operational Data Data Warehouse

Application OLTP OLAP
Use Precise Queries Ad Hoc
Temporal Snapshot Historical
Modification Dynamic Static
Orientation Application Business
Data Operational Values Integrated
Size Gigabits Terabits
Level Detailed Summarized
Access Often Less Often
Response Few Seconds Minutes
Data Schema Relational Star/Snowflake
 OLAP
Online Analytic Processing (OLAP): provides more complex
queries than OLTP.
OnLine Transaction Processing (OLTP): traditional
database/transaction processing.
Dimensional data; cube view
Visualization of operations:
Slice: examine sub-cube.
Dice: rotate cube to look at another dimension.
Roll Up/Drill Down

DM: May use OLAP queries.

 OLAP Operations

Roll Up

Drill Down

Single Cell Multiple Cells Slice Dice

Statistics
Simple descriptive models
Statistical inference: generalizing a model created
from a sample of the data to the entire dataset.
Exploratory Data Analysis:
Data can actually drive the creation of the
model
Opposite of traditional statistical view.
Data mining targeted to business user

DM: Many data mining methods come from

statistical techniques.
 Machine Learning
Machine Learning: area of AI that examines how to write
programs that can learn.
Often used in classification and prediction
Supervised Learning: learns by example.
Unsupervised Learning: learns without knowledge of correct
answers.
Machine learning often deals with small static datasets.

DM: Uses many machine learning techniques.

Pattern Matching
(Recognition)
Pattern Matching: finds
occurrences of a predefined
pattern in the data.
Applications include speech
recognition, information retrieval,
time series analysis.

DM: Type of classification.

 DM vs. Related Topics
Area Query Data Result Output
s
DB/OLT Precis Database Precis DB
P e e Objects or
Aggregati
on
IR Precis Documents Vague Document
e s
OLAP Analysi Multidimensio Precis DB
s nal e Objects or
Aggregati
on
DM Vague Preprocessed Vague KDD
Objects
Data Mining Techniques Outline
Goal: Provide an overview of basic data
mining techniques
Statistical
Point Estimation
Models Based on Summarization
Bayes Theorem
Hypothesis Testing
Regression and Correlation
Similarity Measures
Decision Trees
Neural Networks
Activation Functions
Genetic Algorithms
 Point Estimation
Point Estimate: estimate a population parameter.
May be made by calculating the parameter for a
sample.
May be used to predict value for missing data.
Ex:
R contains 100 employees
99 have salary information
Mean salary of these is $50,000
Use $50,000 as value of remaining employees salary.

Is this a good idea?

Estimation Error
Bias: Difference between expected
value and actual value.

Mean Squared Error (MSE): expected

value of the squared difference between
the estimate and the actual value:

Why square?
Root Mean Square Error (RMSE)
 Jackknife Estimate
Jackknife Estimate: estimate of parameter is
obtained by omitting one value from the set of
observed values.
Ex: estimate of mean for X={x1, , xn}
 Maximum Likelihood Estimate
(MLE)
Obtain parameter estimates that maximize the
probability that the sample data occurs for the
specific model.
Joint probability for observing the sample data by
multiplying the individual probabilities. Likelihood
function:

Maximize L.
 MLE Example
Coin toss five times: {H,H,H,H,T}
Assuming a perfect coin with H and T equally likely, the
likelihood of this sequence is:

However if the probability of a H is 0.8 then:

Expectation-
Maximization (EM)

Solves estimation with incomplete

data.
Obtain initial estimates for
parameters.
Iteratively use estimates for
missing data and continue until
convergence.
EM Example
EM Algorithm
Bayes Theorem
Posterior Probability: P(h1|xi)
Prior Probability: P(h1)
Bayes Theorem:

Assign probabilities of hypotheses given

a data value.
Bayes Theorem Example
Credit authorizations (hypotheses): h1=authorize
purchase, h2 = authorize after further identification,
h3=do not authorize, h4= do not authorize but
contact police
Assign twelve data values for all combinations of
credit and income: 1 2 3 4
Excellent x1 x2 x3 x4
Good x5 x6 x7 x8
Bad x9 x10 x11 x12

From training data: P(h1) = 60%; P(h2)=20%; P(h3)

=10%; P(h4)=10%.
 Bayes Example(contd)
Training Data:
ID Income Credit Class xi
1 4 Excellent h1 x4
2 3 Good h1 x7
3 2 Excellent h1 x2
4 3 Good h1 x7
5 4 Good h1 x8
6 2 Excellent h1 x2
7 3 Bad h2 x11
8 2 Bad h2 x10
9 3 Bad h3 x11
10 1 Bad h4 x9

 Bayes Example(contd)
Calculate P(xi|hj) and P(xi)
Ex: P(x7|h1)=2/6; P(x4|h1)=1/6; P(x2|h1)=2/6; P(x8|h1)
=1/6; P(xi|h1)=0 for all other xi.
Predict the class for x4:
Calculate P(hj|x4) for all hj.
Place x4 in class with largest value.
Ex:
P(h1|x4)=(P(x4|h1)(P(h1))/P(x4)
=(1/6)(0.6)/0.1=1.
x4 in class h1.
Regression
Predict future values based on
past values
Linear Regression assumes
linear relationship exists.
y = c 0 + c 1 x1 + + c n xn
Find values to best fit the data
Linear Regression
 Correlation
Examine the degree to which the values for two
variables behave similarly.
Correlation coefficient r:
1 = perfect correlation
-1 = perfect but opposite correlation
0 = no correlation
 Similarity Measures
Determine similarity between two
objects.
Similarity characteristics:

Alternatively, distance measure measure

how unlike or dissimilar objects are.
Similarity Measures
 Distance Measures
Measure dissimilarity between objects
Twenty Questions Game
 Decision Trees
Decision Tree (DT):
Tree where the root and each internal node is
labeled with a question.
The arcs represent each possible answer to the
associated question.
Each leaf node represents a prediction of a
solution to the problem.
Popular technique for classification; Leaf node
indicates class to which the corresponding tuple
belongs.
Decision Tree Example
 Decision Trees
A Decision Tree Model is a computational model
consisting of three parts:
Decision Tree
Algorithm to create the tree
Algorithm that applies the tree to data
Creation of the tree is the most difficult part.
Processing is basically a search similar to that in a
binary search tree (although DT may not be binary).
Decision Tree Algorithm
 DT Advantages/Disadvantages
Advantages:
Easy to understand.
Easy to generate rules
Disadvantages:
May suffer from overfitting.
Classifies by rectangular partitioning.
Does not easily handle nonnumeric data.
Can be quite large pruning is necessary.
 Neural Networks
Based on observed functioning of human brain.

(Artificial Neural Networks (ANN)

Our view of neural networks is very simplistic.
We view a neural network (NN) from a
graphical viewpoint.
Alternatively, a NN may be viewed from the
perspective of matrices.
Used in pattern recognition, speech recognition,
computer vision, and classification.
Neural Networks
Neural Network (NN) is a directed graph F=<V,A>
with vertices V={1,2,,n} and arcs A={<i,j>|
1<=i,j<=n}, with the following restrictions:
V is partitioned into a set of input nodes, VI,
hidden nodes, VH, and output nodes, VO.
The vertices are also partitioned into layers
Any arc <i,j> must have node i in layer h-1 and
node j in layer h.
Arc <i,j> is labeled with a numeric value wij.
Node i is labeled with a function fi.
Neural Network Example
NN Node
NN Activation Functions
Functions associated with nodes in graph.
Output may be in range [-1,1] or [0,1]
NN Activation Functions
 NN Learning

Propagate input values through graph.

Compare output to desired output.
Adjust weights in graph accordingly.
Neural Networks
A Neural Network Model is a computational model
consisting of three parts:
Neural Network graph
Learning algorithm that indicates how learning
takes place.
Recall techniques that determine how
information is obtained from the network.
We will look at propagation as the recall technique.
NN Advantages
Learning
Can continue learning even after training set
has been applied.
Easy parallelization
Solves many problems
NN Disadvantages
Difficult to understand
May suffer from overfitting
Structure of graph must be determined a priori.
Input values must be numeric.
Verification difficult.
 Genetic Algorithms
Optimization search type algorithms.
Creates an initial feasible solution and iteratively
creates new better solutions.
Based on human evolution and survival of the fitness.
Must represent a solution as an individual.
Individual: string I=I1,I2,,In where Ij is in given
alphabet A.
Each character Ij is called a gene.
Population: set of individuals.
 Genetic Algorithms
A Genetic Algorithm (GA) is a computational model
consisting of five parts:
A starting set of individuals, P.
Crossover: technique to combine two parents
to create offspring.
Mutation: randomly change an individual.
Fitness: determine the best individuals.
Algorithm which applies the crossover and
mutation techniques to P iteratively using the
fitness function to determine the best
individuals in P to keep.
 Crossover Examples

000 000 000 111 000 000 00 000 111 00

111 111 111 000 111 111 11 111 000 11

Parents Children Parents Children

a) Single Crossover a) Multiple Crossover

Genetic Algorithm
GA Advantages/Disadvantages
Advantages
Easily parallelized
Disadvantages
Difficult to understand and explain to end users.
Abstraction of the problem and method to
represent individuals is quite difficult.
Determining fitness function is difficult.
Determining how to perform crossover and
mutation is difficult.