Download Part1

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Cluster analysis wikipedia , lookup

Nonlinear dimensionality reduction wikipedia , lookup

Transcript
I: Introduction to Data Mining
A. Short Preview
1. Initial Definition of Data Mining
2. Motivation for Data Mining
3. Examples of Data Mining Tasks
B. More detailed Survey on Data Mining
C. Course Information
Tang: Introduction to Data Mining (with modification by Ch. Eick)
Teaching Plan for the Next 5 Weeks
1.
2.
3.
4.
Introduction to Data Mining and Course
Information
Preprocessing (Han Chapter 3)
Concept Characterization (Han Chapter 5)
Classification Techniques (multiple soursce)
Tang: Introduction to Data Mining (with modification by Ch. Eick)
Knowledge Discovery in Data [and Data Mining] (KDD)




Let us find something interesting!
Definition := “KDD is the non-trivial process of identifying valid,
novel, potentially useful, and ultimately understandable patterns in
data” (Fayyad)
Frequently, the term data mining is used to refer to KDD.
Many commercial and experimental tools and tool suites are available
(see http://www.kdnuggets.com/siftware.html)
Field is more dominated by industry than by research institutions
Why Mine Data? Commercial Viewpoint

Lots of data is being collected
and warehoused
– Web data, e-commerce
– purchases at department/
grocery stores
– Bank/Credit Card
transactions

Computers have become cheaper and more powerful (
machine learning techniques become applicable)

Competitive Pressure is Strong
– Provide better, customized services for an edge (e.g. in
Customer Relationship Management)
Tang: Introduction to Data Mining (with modification by Ch. Eick)
Why Mine Data? Scientific Viewpoint

Data collected and stored at
enormous speeds (GB/hour)
– remote sensors on a satellite
– telescopes scanning the skies
– microarrays generating gene
expression data
– scientific simulations
generating terabytes of data


Traditional techniques infeasible for raw data
Data mining may help scientists
– in classifying and segmenting data
– in Hypothesis Formation
Mining Large Data Sets - Motivation



There is often information “hidden” in the data that is
not readily evident
Human analysts may take weeks to discover useful
information
Much of the data is never analyzed at all
4,000,000
3,500,000
The Data Gap
3,000,000
2,500,000
2,000,000
1,500,000
Total new disk (TB) since 1995
1,000,000
Number of
analysts
500,000
0
1995
1996
1997
1998
1999
From: R. Grossman, C. Kamath, V. Kumar, “Data Mining for Scientific and Engineering Applications”
Tang: Introduction to Data Mining (with modification by Ch. Eick)
Data Mining Tasks

Prediction Methods
– Use some variables to predict unknown or
future values of other variables.

Description Methods
– Find human-interpretable patterns that
describe the data.
Tang: Introduction to Data Mining (with modification by Ch. Eick)
Classification Example
Tid Refund Marital
Status
Taxable
Income Cheat
Refund Marital
Status
Taxable
Income Cheat
1
Yes
Single
125K
No
No
Single
75K
?
2
No
Married
100K
No
Yes
Married
50K
?
3
No
Single
70K
No
No
Married
150K
?
4
Yes
Married
120K
No
Yes
Divorced 90K
?
5
No
Divorced 95K
Yes
No
Single
40K
?
6
No
Married
No
No
Married
80K
?
60K
10
7
Yes
Divorced 220K
No
8
No
Single
85K
Yes
9
No
Married
75K
No
10
10
No
Single
90K
Yes
Training
Set
Tang: Introduction to Data Mining (with modification by Ch. Eick)
Learn
Classifier
Test
Set
Model
Classifying Galaxies
Courtesy: http://aps.umn.edu
Early
Class:
• Stages of Formation
Attributes:
• Image features,
• Characteristics of light
waves received, etc.
Intermediate
Late
Data Size:
• 72 million stars, 20 million galaxies
• Object Catalog: 9 GB
• Image Database: 150 GB
Tang: Introduction to Data Mining (with modification by Ch. Eick)
What is Clustering?


Given a set of objects, each having a set of
attributes, and a similarity measure among them,
find clusters such that
– Objects in one cluster are more similar to one
another.
– Objects in separate clusters are less similar to
one another.
Similarity Measures:
– Euclidean Distance if attributes are
continuous.
– Other Problem-specific Measures.
Tang: Introduction to Data Mining (with modification by Ch. Eick)
Clustering of S&P 500 Stock Data
 Observe Stock Movements every day.
 Clustering points: Stock-{UP/DOWN}
 Similarity Measure: Two points are more similar if the events
described by them frequently happen together on the same day.
 We used association rules to quantify a similarity measure.
Discovered Clusters
1
2
3
4
Applied-Matl-DOW N,Bay-Net work-Down,3-COM-DOWN,
Cabletron-Sys-DOWN,CISCO-DOWN,HP-DOWN,
DSC-Co mm-DOW N,INTEL-DOWN,LSI-Logic-DOWN,
Micron-Tech-DOWN,Texas-Inst-Down,Tellabs-Inc-Down,
Natl-Semiconduct-DOWN,Oracl-DOWN,SGI-DOW N,
Sun-DOW N
Apple-Co mp-DOW N,Autodesk-DOWN,DEC-DOWN,
ADV-M icro-Device-DOWN,Andrew-Corp-DOWN,
Co mputer-Assoc-DOWN,Circuit-City-DOWN,
Co mpaq-DOWN, EM C-Corp-DOWN, Gen-Inst-DOWN,
Motorola-DOW N,Microsoft-DOWN,Scientific-Atl-DOWN
Fannie-Mae-DOWN,Fed-Ho me-Loan-DOW N,
MBNA-Corp -DOWN,Morgan-Stanley-DOWN
Baker-Hughes-UP,Dresser-Inds-UP,Halliburton-HLD-UP,
Louisiana-Land-UP,Phillips-Petro-UP,Unocal-UP,
Schlu mberger-UP
Tang: Introduction to Data Mining (with modification by Ch. Eick)
Industry Group
Technology1-DOWN
Technology2-DOWN
Financial-DOWN
Oil-UP
Association Rule Discovery: Definition

Given a set of records each of which contain some
number of items from a given collection;
– Produce dependency rules which will predict
occurrence of an item based on occurrences of other
items.
TID
Items
1
2
3
4
5
Bread, Coke, Milk
Beer, Bread
Beer, Coke, Diaper, Milk
Beer, Bread, Diaper, Milk
Coke, Diaper, Milk
Rules Discovered:
Tang: Introduction to Data Mining (with modification by Ch. Eick)
{Milk} --> {Coke}
{Diaper, Milk} --> {Beer}
Sequential Pattern Discovery: Definition

Given is a set of objects, with each object associated with its own timeline of
events, find rules that predict strong sequential dependencies among
different events.
(A B)

(C)
(D E)
Rules are formed by first discovering patterns. Event occurrences in the
patterns are governed by timing constraints.
(A B)
<= xg
(C)
(D E)
>ng
<= ms
Tang: Introduction to Data Mining (with modification by Ch. Eick)
<= ws