SlideShare a Scribd company logo
Data Mining: Introduction


                    Lecture Notes for Chapter 1

                     Introduction to Data Mining
                                   by
                         Tan, Steinbach, Kumar




© Tan,Steinbach, Kumar     Introduction to Data Mining   4/18/2004   1
Why Mine Data? Commercial Viewpoint
q   Lots of data is being collected
    and warehoused
     – Web data, e-commerce
     – purchases at department/
       grocery stores
     – Bank/Credit Card
       transactions

q   Computers have become cheaper and more powerful
q   Competitive Pressure is Strong
     – Provide better, customized services for an edge (e.g. in
       Customer Relationship Management)
© Tan,Steinbach, Kumar   Introduction to Data Mining   4/18/2004   2
Why Mine Data? Scientific Viewpoint

q   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
q   Traditional techniques infeasible for raw data
q   Data mining may help scientists
     – in classifying and segmenting data
     – in Hypothesis Formation
Mining Large Data Sets - Motivation
q   There is often information “hidden” in the data that is
    not readily evident
q   Human analysts may take weeks to discover useful
    information
q   Much of the data is never analyzed at all
          4,000,000

          3,500,000

          3,000,000
                                                   The Data Gap
          2,500,000

          2,000,000

          1,500,000
                      Total new disk (TB) since 1995
          1,000,000

            500,000
                                                                               Number of
                  0
                                                                               analysts
                           1995            1996            1997            1998            1999

© Tan,Steinbach, KumarKamath, V. Kumar, “Data Mining for Mining and Engineering Applications”
From: R. Grossman, C.               Introduction to Data Scientific                        4/18/2004   4
What is Data Mining?
q Many          Definitions
    – Non-trivial extraction of implicit, previously
      unknown and potentially useful information from
      data
    – Exploration & analysis, by automatic or
      semi-automatic means, of
      large quantities of data
      in order to discover
      meaningful patterns




© Tan,Steinbach, Kumar   Introduction to Data Mining   4/18/2004   5
What is (not) Data Mining?

qWhat is not Data                    q   What is Data Mining?
Mining?
      – Look up phone                       – Certain names are more
      number in phone                       prevalent in certain US
      directory                             locations (O’Brien, O’Rurke,
                                            O’Reilly… in Boston area)
      – Query a Web                         – Group together similar
      search engine for                     documents returned by
      information about                     search engine according to
      “Amazon”                              their context (e.g. Amazon
                                            rainforest, Amazon.com,)
© Tan,Steinbach, Kumar   Introduction to Data Mining        4/18/2004   6
Origins of Data Mining
q Draws ideas from machine learning/AI, pattern
  recognition, statistics, and database systems
q Traditional Techniques
  may be unsuitable due to
                                Statistics/   Machine Learning/
   – Enormity of data               AI              Pattern
   – High dimensionality                          Recognition

     of data                            Data Mining
   – Heterogeneous,
     distributed nature                  Database
     of data                             systems



 © Tan,Steinbach, Kumar   Introduction to Data Mining   4/18/2004   7
Data Mining Tasks

  q   Prediction Methods
       – Use some variables to predict unknown or
         future values of other variables.

  q   Description Methods
       – Find human-interpretable patterns that
         describe the data.



                                    From [Fayyad, et.al.] Advances in Knowledge Discovery and Data Mining, 1996

© Tan,Steinbach, Kumar   Introduction to Data Mining                               4/18/2004           8
Data Mining Tasks...

 q Classification [Predictive]
 q Clustering [Descriptive]
 q Association Rule Discovery [Descriptive]
 q Sequential Pattern Discovery [Descriptive]
 q Regression [Predictive]
 q Deviation Detection [Predictive]




© Tan,Steinbach, Kumar   Introduction to Data Mining   4/18/2004   9
Classification: Definition

     q   Given a collection of records (training set )
           – Each record contains a set of attributes, one of the
             attributes is the class.
     q   Find a model for class attribute as a function
         of the values of other attributes.
     q   Goal: previously unseen records should be
         assigned a class as accurately as possible.
           – A test set is used to determine the accuracy of the
             model. Usually, the given data set is divided into
             training and test sets, with training set used to build
             the model and test set used to validate it.


© Tan,Steinbach, Kumar   Introduction to Data Mining    4/18/2004   10
Classification Example
                             l             l          s
                       r ica          rica          ou
                                                   u
                   e go          e go          tin        s
                 at            at            on        as
                c           c             c          cl
     Tid Refund Marital           Taxable                              Refund Marital     Taxable
                Status            Income Cheat                                Status      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      60K          No                      No      Married    80K    ?                 Test
     7    Yes        Divorced 220K             No
                                                                  10




                                                                                                                   Set

     8    No         Single       85K          Yes
                                               No
     9    No         Married      75K
                                                              Training
                                                                                          Learn
     10   No         Single       90K          Yes                                                                Model
10



                                                                 Set                     Classifier


     © Tan,Steinbach, Kumar                      Introduction to Data Mining                          4/18/2004       11
Classification: Application 1

  q   Direct Marketing
       – Goal: Reduce cost of mailing by targeting a set of
         consumers likely to buy a new cell-phone product.
       – Approach:
               Use      the data for a similar product introduced before.
               We   know which customers decided to buy and which
                 decided otherwise. This {buy, don’t buy} decision forms the
                 class attribute.
               Collect  various demographic, lifestyle, and company-
                 interaction related information about all such customers.
                    – Type of business, where they stay, how much they earn, etc.
               Use this information as input attributes to learn a classifier
                 model.
                                                               From [Berry & Linoff] Data Mining Techniques, 1997

© Tan,Steinbach, Kumar           Introduction to Data Mining                               4/18/2004           12
Classification: Application 2

  q   Fraud Detection
       – Goal: Predict fraudulent cases in credit card
         transactions.
       – Approach:
               Use  credit card transactions and the information on its
                 account-holder as attributes.
                    – When does a customer buy, what does he buy, how often he pays on
                      time, etc
               Label past transactions as fraud or fair transactions. This
                forms the class attribute.
               Learn a model for the class of the transactions.

               Use this model to detect fraud by observing credit card
                transactions on an account.



© Tan,Steinbach, Kumar          Introduction to Data Mining            4/18/2004     13
Classification: Application 3

 q    Customer Attrition/Churn:
      – Goal: To predict whether a customer is likely
        to be lost to a competitor.
      – Approach:
              Use   detailed record of transactions with each of the
                past and present customers, to find attributes.
                   – How often the customer calls, where he calls, what time-of-the
                     day he calls most, his financial status, marital status, etc.
              Label the customers as loyal or disloyal.
              Find a model for loyalty.



                                                             From [Berry & Linoff] Data Mining Techniques, 1997

© Tan,Steinbach, Kumar         Introduction to Data Mining                               4/18/2004           14
Classification: Application 4

 q    Sky Survey Cataloging
       – Goal: To predict class (star or galaxy) of sky objects,
         especially visually faint ones, based on the telescopic
         survey images (from Palomar Observatory).
                   – 3000 images with 23,040 x 23,040 pixels per image.
       – Approach:
              Segment     the image.
              Measure     image attributes (features) - 40 of them per object.
              Model     the class based on these features.
              Success   Story: Could find 16 new high red-shift quasars,
                some of the farthest objects that are difficult to find!


                                          From [Fayyad, et.al.] Advances in Knowledge Discovery and Data Mining, 1996

© Tan,Steinbach, Kumar         Introduction to Data Mining                               4/18/2004           15
Classifying Galaxies
                                                            Courtesy: http://aps.umn.edu


               Early                Class:                  Attributes:
                                    • Stages of Formation   • 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

© Tan,Steinbach, Kumar      Introduction to Data Mining            4/18/2004      16
Clustering Definition

 q    Given a set of data points, each having a set of
      attributes, and a similarity measure among them,
      find clusters such that
       – Data points in one cluster are more similar to
         one another.
       – Data points in separate clusters are less
         similar to one another.
 q    Similarity Measures:
       – Euclidean Distance if attributes are
         continuous.
       – Other Problem-specific Measures.

© Tan,Steinbach, Kumar   Introduction to Data Mining   4/18/2004   17
Illustrating Clustering

 ‚ Euclidean Distance Based Clustering in 3-D space.

             Intracluster distances                      Intercluster distances
                 are minimized                              are maximized




© Tan,Steinbach, Kumar     Introduction to Data Mining                  4/18/2004   18
Clustering: Application 1

  q   Market Segmentation:
      – Goal: subdivide a market into distinct subsets of
        customers where any subset may conceivably be
        selected as a market target to be reached with a
        distinct marketing mix.
      – Approach:
               Collect different attributes of customers based on their
                geographical and lifestyle related information.
               Find clusters of similar customers.

               Measure the clustering quality by observing buying patterns
                of customers in same cluster vs. those from different
                clusters.




© Tan,Steinbach, Kumar      Introduction to Data Mining        4/18/2004   19
Clustering: Application 2

 q    Document Clustering:
      – Goal: To find groups of documents that are
        similar to each other based on the important
        terms appearing in them.
      – Approach: To identify frequently occurring
        terms in each document. Form a similarity
        measure based on the frequencies of different
        terms. Use it to cluster.
      – Gain: Information Retrieval can utilize the
        clusters to relate a new document or search
        term to clustered documents.
© Tan,Steinbach, Kumar   Introduction to Data Mining   4/18/2004   20
Illustrating Document Clustering

 q   Clustering Points: 3204 Articles of Los Angeles Times.
 q   Similarity Measure: How many words are common in
     these documents (after some word filtering).
                           Category             Total          Correctly
                                               Articles         Placed
                           Financial             555              364

                            Foreign               341            260

                           National               273             36

                            Metro                 943            746

                            Sports                738            573

                         Entertainment            354            278


© Tan,Steinbach, Kumar           Introduction to Data Mining               4/18/2004   21
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                        Industry Group

             1
                     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,
                                                                               Technology1-DOWN
                       Natl-Semiconduct-DOWN,Oracl-DOWN,SGI-DOW N,
                                          Sun-DOW N


             2
                       Apple-Co mp-DOW N,Autodesk-DOWN,DEC-DOWN,
                        ADV-M icro-Device-DOWN,Andrew-Corp-DOWN,
                           Co mputer-Assoc-DOWN,Circuit-City-DOWN,
                                                                               Technology2-DOWN
                      Co mpaq-DOWN, EM C-Corp-DOWN, Gen-Inst-DOWN,
                     Motorola-DOW N,Microsoft-DOWN,Scientific-Atl-DOWN


             3
                             Fannie-Mae-DOWN,Fed-Ho me-Loan-DOW N,
                             MBNA-Corp -DOWN,Morgan-Stanley-DOWN                Financial-DOWN


             4
                         Baker-Hughes-UP,Dresser-Inds-UP,Halliburton-HLD-UP,
                            Louisiana-Land-UP,Phillips-Petro-UP,Unocal-UP,          Oil-UP
                                           Schlu mberger-UP




© Tan,Steinbach, Kumar                    Introduction to Data Mining                             4/18/2004   22
Association Rule Discovery: Definition

 q    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        Bread, Coke, Milk
                                                           Rules Discovered:
  2        Beer, Bread
                                                             {Milk} --> {Coke}
  3        Beer, Coke, Diaper, Milk                          {Diaper, Milk} --> {Beer}
  4        Beer, Bread, Diaper, Milk
  5        Coke, Diaper, Milk




© Tan,Steinbach, Kumar       Introduction to Data Mining                       4/18/2004   23
Association Rule Discovery: Application 1


 q   Marketing and Sales Promotion:
     – Let the rule discovered be
                {Bagels, … } --> {Potato Chips}
     – Potato Chips as consequent => Can be used to
       determine what should be done to boost its sales.
     – Bagels in the antecedent => Can be used to see
       which products would be affected if the store
       discontinues selling bagels.
     – Bagels in antecedent and Potato chips in consequent
       => Can be used to see what products should be sold
       with Bagels to promote sale of Potato chips!


© Tan,Steinbach, Kumar   Introduction to Data Mining   4/18/2004   24
Association Rule Discovery: Application 2

 q    Supermarket shelf management.
      – Goal: To identify items that are bought
        together by sufficiently many customers.
      – Approach: Process the point-of-sale data
        collected with barcode scanners to find
        dependencies among items.
      – A classic rule --
              If a customer buys diaper and milk, then he is very
               likely to buy beer.
              So, don’t be surprised if you find six-packs stacked
               next to diapers!
© Tan,Steinbach, Kumar    Introduction to Data Mining   4/18/2004   25
Association Rule Discovery: Application 3

 q   Inventory Management:
      – Goal: A consumer appliance repair company wants to
         anticipate the nature of repairs on its consumer
         products and keep the service vehicles equipped with
         right parts to reduce on number of visits to consumer
         households.
      – Approach: Process the data on tools and parts
         required in previous repairs at different consumer
         locations and discover the co-occurrence patterns.




© Tan,Steinbach, Kumar   Introduction to Data Mining   4/18/2004   26
Sequential Pattern Discovery: Definition

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

q   Rules are formed by first disovering patterns. Event occurrences in the
    patterns are governed by timing constraints.


                         (A B)               (C) (D E)
                                  <= xg             >ng   <= ws


                                             <= ms




© Tan,Steinbach, Kumar      Introduction to Data Mining             4/18/2004    27
Sequential Pattern Discovery: Examples

 q   In telecommunications alarm logs,
       – (Inverter_Problem Excessive_Line_Current)
              (Rectifier_Alarm) --> (Fire_Alarm)
 q   In point-of-sale transaction sequences,
       – Computer Bookstore:
             (Intro_To_Visual_C) (C++_Primer) -->
                                   (Perl_for_dummies,Tcl_Tk)
       – Athletic Apparel Store:
             (Shoes) (Racket, Racketball) --> (Sports_Jacket)




© Tan,Steinbach, Kumar      Introduction to Data Mining         4/18/2004   28
Regression

 q   Predict a value of a given continuous valued variable
     based on the values of other variables, assuming a
     linear or nonlinear model of dependency.
 q   Greatly studied in statistics, neural network fields.
 q   Examples:
       – Predicting sales amounts of new product based on
         advetising expenditure.
       – Predicting wind velocities as a function of
         temperature, humidity, air pressure, etc.
       – Time series prediction of stock market indices.



© Tan,Steinbach, Kumar   Introduction to Data Mining   4/18/2004   29
Deviation/Anomaly Detection
q Detect significant deviations from normal behavior
q Applications:

   – Credit Card Fraud Detection



     – Network Intrusion
       Detection



    Typical network traffic at University level may reach over 100 million connections per
                                               day
© Tan,Steinbach, Kumar        Introduction to Data Mining                  4/18/2004         30
Challenges of Data Mining

 q   Scalability
 q   Dimensionality
 q   Complex and Heterogeneous Data
 q   Data Quality
 q   Data Ownership and Distribution
 q   Privacy Preservation
 q   Streaming Data




© Tan,Steinbach, Kumar   Introduction to Data Mining   4/18/2004   31

More Related Content

PPTX
Data mining
PPT
Ch5 alternative classification
PPT
PPTX
Computer Aided Process Planning

Similar to Chap1 intro (20)

PDF
Data Mining
PDF
Introduction to Data Mining for Newbies
PDF
Introduction to Machine Learning and Data Mining
PDF
Use of Health Information
PPT
UNIT 2: Part 1: Data Warehousing and Data Mining
PPT
chap1_intro.ppt
PPT
chap1_introT Data Mining
PPTX
Data Mining: an Introduction
PPTX
lec01-IntroductionToDataMining.pptx
PPT
Introduction to Data Mining (Why Mine Data? Commercial Viewpoint)
PDF
Module-1-IntroductionToDataMining (Data Mining)
PPTX
1. Introduction to Data Mining (12).pptx
PPT
inmlk;lklkjlk;lklkjlklkojhhkljkbjlkjhbtroDM.ppt
PPT
introDM.ppt
PPT
introDMintroDMintroDMintroDMintroDMintroDM.ppt
PDF
Data Mining
PPT
Introduction to Data Mining
PPT
(Talk in Powerpoint Format)
PPT
chap4_basic_classification(2).ppt
Data Mining
Introduction to Data Mining for Newbies
Introduction to Machine Learning and Data Mining
Use of Health Information
UNIT 2: Part 1: Data Warehousing and Data Mining
chap1_intro.ppt
chap1_introT Data Mining
Data Mining: an Introduction
lec01-IntroductionToDataMining.pptx
Introduction to Data Mining (Why Mine Data? Commercial Viewpoint)
Module-1-IntroductionToDataMining (Data Mining)
1. Introduction to Data Mining (12).pptx
inmlk;lklkjlk;lklkjlklkojhhkljkbjlkjhbtroDM.ppt
introDM.ppt
introDMintroDMintroDMintroDMintroDMintroDM.ppt
Data Mining
Introduction to Data Mining
(Talk in Powerpoint Format)
chap4_basic_classification(2).ppt
Ad

Recently uploaded (20)

PDF
project resource management chapter-09.pdf
PDF
Encapsulation_ Review paper, used for researhc scholars
PDF
DP Operators-handbook-extract for the Mautical Institute
PDF
From MVP to Full-Scale Product A Startup’s Software Journey.pdf
PDF
Heart disease approach using modified random forest and particle swarm optimi...
PDF
Profit Center Accounting in SAP S/4HANA, S4F28 Col11
PPTX
KOM of Painting work and Equipment Insulation REV00 update 25-dec.pptx
PDF
Mushroom cultivation and it's methods.pdf
PPTX
A Presentation on Touch Screen Technology
PDF
Web App vs Mobile App What Should You Build First.pdf
PDF
MIND Revenue Release Quarter 2 2025 Press Release
PPTX
Tartificialntelligence_presentation.pptx
PDF
gpt5_lecture_notes_comprehensive_20250812015547.pdf
PPTX
Programs and apps: productivity, graphics, security and other tools
PPTX
TechTalks-8-2019-Service-Management-ITIL-Refresh-ITIL-4-Framework-Supports-Ou...
PDF
Building Integrated photovoltaic BIPV_UPV.pdf
PDF
WOOl fibre morphology and structure.pdf for textiles
PDF
Zenith AI: Advanced Artificial Intelligence
PDF
Hybrid model detection and classification of lung cancer
PPTX
OMC Textile Division Presentation 2021.pptx
project resource management chapter-09.pdf
Encapsulation_ Review paper, used for researhc scholars
DP Operators-handbook-extract for the Mautical Institute
From MVP to Full-Scale Product A Startup’s Software Journey.pdf
Heart disease approach using modified random forest and particle swarm optimi...
Profit Center Accounting in SAP S/4HANA, S4F28 Col11
KOM of Painting work and Equipment Insulation REV00 update 25-dec.pptx
Mushroom cultivation and it's methods.pdf
A Presentation on Touch Screen Technology
Web App vs Mobile App What Should You Build First.pdf
MIND Revenue Release Quarter 2 2025 Press Release
Tartificialntelligence_presentation.pptx
gpt5_lecture_notes_comprehensive_20250812015547.pdf
Programs and apps: productivity, graphics, security and other tools
TechTalks-8-2019-Service-Management-ITIL-Refresh-ITIL-4-Framework-Supports-Ou...
Building Integrated photovoltaic BIPV_UPV.pdf
WOOl fibre morphology and structure.pdf for textiles
Zenith AI: Advanced Artificial Intelligence
Hybrid model detection and classification of lung cancer
OMC Textile Division Presentation 2021.pptx
Ad

Chap1 intro

  • 1. Data Mining: Introduction Lecture Notes for Chapter 1 Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 1
  • 2. Why Mine Data? Commercial Viewpoint q Lots of data is being collected and warehoused – Web data, e-commerce – purchases at department/ grocery stores – Bank/Credit Card transactions q Computers have become cheaper and more powerful q Competitive Pressure is Strong – Provide better, customized services for an edge (e.g. in Customer Relationship Management) © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 2
  • 3. Why Mine Data? Scientific Viewpoint q 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 q Traditional techniques infeasible for raw data q Data mining may help scientists – in classifying and segmenting data – in Hypothesis Formation
  • 4. Mining Large Data Sets - Motivation q There is often information “hidden” in the data that is not readily evident q Human analysts may take weeks to discover useful information q Much of the data is never analyzed at all 4,000,000 3,500,000 3,000,000 The Data Gap 2,500,000 2,000,000 1,500,000 Total new disk (TB) since 1995 1,000,000 500,000 Number of 0 analysts 1995 1996 1997 1998 1999 © Tan,Steinbach, KumarKamath, V. Kumar, “Data Mining for Mining and Engineering Applications” From: R. Grossman, C. Introduction to Data Scientific 4/18/2004 4
  • 5. What is Data Mining? q Many Definitions – Non-trivial extraction of implicit, previously unknown and potentially useful information from data – Exploration & analysis, by automatic or semi-automatic means, of large quantities of data in order to discover meaningful patterns © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 5
  • 6. What is (not) Data Mining? qWhat is not Data q What is Data Mining? Mining? – Look up phone – Certain names are more number in phone prevalent in certain US directory locations (O’Brien, O’Rurke, O’Reilly… in Boston area) – Query a Web – Group together similar search engine for documents returned by information about search engine according to “Amazon” their context (e.g. Amazon rainforest, Amazon.com,) © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 6
  • 7. Origins of Data Mining q Draws ideas from machine learning/AI, pattern recognition, statistics, and database systems q Traditional Techniques may be unsuitable due to Statistics/ Machine Learning/ – Enormity of data AI Pattern – High dimensionality Recognition of data Data Mining – Heterogeneous, distributed nature Database of data systems © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 7
  • 8. Data Mining Tasks q Prediction Methods – Use some variables to predict unknown or future values of other variables. q Description Methods – Find human-interpretable patterns that describe the data. From [Fayyad, et.al.] Advances in Knowledge Discovery and Data Mining, 1996 © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 8
  • 9. Data Mining Tasks... q Classification [Predictive] q Clustering [Descriptive] q Association Rule Discovery [Descriptive] q Sequential Pattern Discovery [Descriptive] q Regression [Predictive] q Deviation Detection [Predictive] © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 9
  • 10. Classification: Definition q Given a collection of records (training set ) – Each record contains a set of attributes, one of the attributes is the class. q Find a model for class attribute as a function of the values of other attributes. q Goal: previously unseen records should be assigned a class as accurately as possible. – A test set is used to determine the accuracy of the model. Usually, the given data set is divided into training and test sets, with training set used to build the model and test set used to validate it. © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 10
  • 11. Classification Example l l s r ica rica ou u e go e go tin s at at on as c c c cl Tid Refund Marital Taxable Refund Marital Taxable Status Income Cheat Status 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 60K No No Married 80K ? Test 7 Yes Divorced 220K No 10 Set 8 No Single 85K Yes No 9 No Married 75K Training Learn 10 No Single 90K Yes Model 10 Set Classifier © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 11
  • 12. Classification: Application 1 q Direct Marketing – Goal: Reduce cost of mailing by targeting a set of consumers likely to buy a new cell-phone product. – Approach:  Use the data for a similar product introduced before.  We know which customers decided to buy and which decided otherwise. This {buy, don’t buy} decision forms the class attribute.  Collect various demographic, lifestyle, and company- interaction related information about all such customers. – Type of business, where they stay, how much they earn, etc.  Use this information as input attributes to learn a classifier model. From [Berry & Linoff] Data Mining Techniques, 1997 © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 12
  • 13. Classification: Application 2 q Fraud Detection – Goal: Predict fraudulent cases in credit card transactions. – Approach:  Use credit card transactions and the information on its account-holder as attributes. – When does a customer buy, what does he buy, how often he pays on time, etc  Label past transactions as fraud or fair transactions. This forms the class attribute.  Learn a model for the class of the transactions.  Use this model to detect fraud by observing credit card transactions on an account. © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 13
  • 14. Classification: Application 3 q Customer Attrition/Churn: – Goal: To predict whether a customer is likely to be lost to a competitor. – Approach:  Use detailed record of transactions with each of the past and present customers, to find attributes. – How often the customer calls, where he calls, what time-of-the day he calls most, his financial status, marital status, etc.  Label the customers as loyal or disloyal.  Find a model for loyalty. From [Berry & Linoff] Data Mining Techniques, 1997 © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 14
  • 15. Classification: Application 4 q Sky Survey Cataloging – Goal: To predict class (star or galaxy) of sky objects, especially visually faint ones, based on the telescopic survey images (from Palomar Observatory). – 3000 images with 23,040 x 23,040 pixels per image. – Approach:  Segment the image.  Measure image attributes (features) - 40 of them per object.  Model the class based on these features.  Success Story: Could find 16 new high red-shift quasars, some of the farthest objects that are difficult to find! From [Fayyad, et.al.] Advances in Knowledge Discovery and Data Mining, 1996 © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 15
  • 16. Classifying Galaxies Courtesy: http://aps.umn.edu Early Class: Attributes: • Stages of Formation • 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 © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 16
  • 17. Clustering Definition q Given a set of data points, each having a set of attributes, and a similarity measure among them, find clusters such that – Data points in one cluster are more similar to one another. – Data points in separate clusters are less similar to one another. q Similarity Measures: – Euclidean Distance if attributes are continuous. – Other Problem-specific Measures. © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 17
  • 18. Illustrating Clustering ‚ Euclidean Distance Based Clustering in 3-D space. Intracluster distances Intercluster distances are minimized are maximized © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 18
  • 19. Clustering: Application 1 q Market Segmentation: – Goal: subdivide a market into distinct subsets of customers where any subset may conceivably be selected as a market target to be reached with a distinct marketing mix. – Approach:  Collect different attributes of customers based on their geographical and lifestyle related information.  Find clusters of similar customers.  Measure the clustering quality by observing buying patterns of customers in same cluster vs. those from different clusters. © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 19
  • 20. Clustering: Application 2 q Document Clustering: – Goal: To find groups of documents that are similar to each other based on the important terms appearing in them. – Approach: To identify frequently occurring terms in each document. Form a similarity measure based on the frequencies of different terms. Use it to cluster. – Gain: Information Retrieval can utilize the clusters to relate a new document or search term to clustered documents. © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 20
  • 21. Illustrating Document Clustering q Clustering Points: 3204 Articles of Los Angeles Times. q Similarity Measure: How many words are common in these documents (after some word filtering). Category Total Correctly Articles Placed Financial 555 364 Foreign 341 260 National 273 36 Metro 943 746 Sports 738 573 Entertainment 354 278 © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 21
  • 22. 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 Industry Group 1 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, Technology1-DOWN Natl-Semiconduct-DOWN,Oracl-DOWN,SGI-DOW N, Sun-DOW N 2 Apple-Co mp-DOW N,Autodesk-DOWN,DEC-DOWN, ADV-M icro-Device-DOWN,Andrew-Corp-DOWN, Co mputer-Assoc-DOWN,Circuit-City-DOWN, Technology2-DOWN Co mpaq-DOWN, EM C-Corp-DOWN, Gen-Inst-DOWN, Motorola-DOW N,Microsoft-DOWN,Scientific-Atl-DOWN 3 Fannie-Mae-DOWN,Fed-Ho me-Loan-DOW N, MBNA-Corp -DOWN,Morgan-Stanley-DOWN Financial-DOWN 4 Baker-Hughes-UP,Dresser-Inds-UP,Halliburton-HLD-UP, Louisiana-Land-UP,Phillips-Petro-UP,Unocal-UP, Oil-UP Schlu mberger-UP © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 22
  • 23. Association Rule Discovery: Definition q 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 Bread, Coke, Milk Rules Discovered: 2 Beer, Bread {Milk} --> {Coke} 3 Beer, Coke, Diaper, Milk {Diaper, Milk} --> {Beer} 4 Beer, Bread, Diaper, Milk 5 Coke, Diaper, Milk © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 23
  • 24. Association Rule Discovery: Application 1 q Marketing and Sales Promotion: – Let the rule discovered be {Bagels, … } --> {Potato Chips} – Potato Chips as consequent => Can be used to determine what should be done to boost its sales. – Bagels in the antecedent => Can be used to see which products would be affected if the store discontinues selling bagels. – Bagels in antecedent and Potato chips in consequent => Can be used to see what products should be sold with Bagels to promote sale of Potato chips! © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 24
  • 25. Association Rule Discovery: Application 2 q Supermarket shelf management. – Goal: To identify items that are bought together by sufficiently many customers. – Approach: Process the point-of-sale data collected with barcode scanners to find dependencies among items. – A classic rule --  If a customer buys diaper and milk, then he is very likely to buy beer.  So, don’t be surprised if you find six-packs stacked next to diapers! © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 25
  • 26. Association Rule Discovery: Application 3 q Inventory Management: – Goal: A consumer appliance repair company wants to anticipate the nature of repairs on its consumer products and keep the service vehicles equipped with right parts to reduce on number of visits to consumer households. – Approach: Process the data on tools and parts required in previous repairs at different consumer locations and discover the co-occurrence patterns. © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 26
  • 27. Sequential Pattern Discovery: Definition q 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) q Rules are formed by first disovering patterns. Event occurrences in the patterns are governed by timing constraints. (A B) (C) (D E) <= xg >ng <= ws <= ms © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 27
  • 28. Sequential Pattern Discovery: Examples q In telecommunications alarm logs, – (Inverter_Problem Excessive_Line_Current) (Rectifier_Alarm) --> (Fire_Alarm) q In point-of-sale transaction sequences, – Computer Bookstore: (Intro_To_Visual_C) (C++_Primer) --> (Perl_for_dummies,Tcl_Tk) – Athletic Apparel Store: (Shoes) (Racket, Racketball) --> (Sports_Jacket) © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 28
  • 29. Regression q Predict a value of a given continuous valued variable based on the values of other variables, assuming a linear or nonlinear model of dependency. q Greatly studied in statistics, neural network fields. q Examples: – Predicting sales amounts of new product based on advetising expenditure. – Predicting wind velocities as a function of temperature, humidity, air pressure, etc. – Time series prediction of stock market indices. © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 29
  • 30. Deviation/Anomaly Detection q Detect significant deviations from normal behavior q Applications: – Credit Card Fraud Detection – Network Intrusion Detection Typical network traffic at University level may reach over 100 million connections per day © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 30
  • 31. Challenges of Data Mining q Scalability q Dimensionality q Complex and Heterogeneous Data q Data Quality q Data Ownership and Distribution q Privacy Preservation q Streaming Data © Tan,Steinbach, Kumar Introduction to Data Mining 4/18/2004 31