Introduction to Data mining Evolution of Database Technology

Introduction to Data mining

Evolution of Database Technology • 1960 s: – Data collection, database creation, IMS and network DBMS • 1970 s: – Relational data model, relational DBMS implementation • 1980 s: – RDBMS, advanced data models (extended-relational, OO, deductive, etc. ) and application-oriented DBMS (spatial, scientific, engineering, etc. ) • 1990 s— 2000 s: – Data mining and data warehousing, multimedia databases, and Web databases

A definition “Data Mining is the process of extracting previously unknown, valid and actionable information from large databases and then using the information to make crucial business decisions”

Data mining is supported by three sufficiently mature technologies: • Massive data collections Commercial databases (using high performance engines) are growing at exceptional rates • Powerful multiprocessor computers cost-effective parallel multiprocessor computer technology • Data mining algorithms under development for decades, in research areas such as statistics, artificial intelligence, and machine learning, but now implemented as mature, reliable, understandable tools that consistently outperform older statistical methods

Why Mine Data? Scientific Viewpoint. . . • Data collected and stored at enormous speeds (Gbyte/hour) – – remote sensor on a satellite telescope scanning the skies microarrays generating gene expression data scientific simulations generating terabytes of data • Traditional techniques are infeasible for raw data • Data mining for data reduction. . – cataloging, classifying, segmenting data – Helps scientists in Hypothesis Formation

Motivation: The Sizes Databases today are huge: – More than 1, 000 entities/records/rows – From 10 to 10, 000 fields/attributes/variables – Giga-bytes and tera-bytes Databases a growing at an unprecedented rate The corporate world is a cut-throat world – Decisions must be made rapidly – Decisions must be made with maximum knowledge

Motivation for doing Data Mining • Investment in Data Collection/Data Warehouse – Add value to the data holding – Competitive advantage – More effective decision making OLTP =) Data Warehouse =) Decision Support – Work to add value to the data holding – Support high level and long term decision making – Fundamental move in use of Databases

Data Mining vs. Database • • • DB’s user knows what is looking for. DM’s user might/might not know what is looking for. DB’s answer to query is 100% accurate, if data correct. DM’s effort is to get the answer as accurate as possible. DB’s data are retrieved as stored. DM’s data need to be cleaned (some what) before producing results. DB’s results are subset of data. DM’s results are the analysis of the data. The meaningfulness of the results is not the concern of Database as it is the main issue in Data Mining.

Data Mining vs. KDD • Knowledge Discovery in Databases (KDD) is the process of finding useful information and patterns in the data. • Data Mining is the use of algorithms to find the useful information in the KDD process. • KDD process is: » Data cleaning & integration (Data Pre-processing) » Creating a common data repository for all sources, such as data warehouse. Data mining » Visualization for the generated results

Need for Data mining • Corporations have huge databases containing a wealth of information • Business databases potentially constitute a goldmine of valuable business information • Very little functionality in database systems to support data mining applications • Data mining: The efficient discovery of previously unknown patterns in large databases

Data mining is not • Brute-force crunching of bulk data • “Blind” application of algorithms • Going to find relationships where none exist • Presenting data in different ways • A database intensive task • A difficult to understand technology requiring an advanced degree in computer science

Data Mining: On What Kind of Data? • Relational databases • Data warehouses • Transactional databases • Advanced DB and information repositories – – – Object-oriented and object-relational databases Spatial databases Time-series data and temporal data Text databases and multimedia databases Heterogeneous and legacy databases WWW

Data Mining Tasks. . . • • • Classification [Predictive] Clustering [Descriptive] Association Rule Discovery [Descriptive] Sequential Pattern Discovery [Descriptive] Regression [Predictive] Deviation Detection [Predictive]

Association Rules • Given: – A database of customer transactions – Each transaction is a set of items • Find all rules X => Y that correlate the presence of one set of items X with another set of items Y – Example: 98% of people who purchase diapers and baby food also buy beer. – Any number of items in the consequent/antecedent of a rule – Possible to specify constraints on rules (e. g. , find only rules involving expensive imported products)

Confidence and Support • A rule must have some minimum user-specified confidence 1 & 2 => 3 has 90% confidence if when a customer bought 1 and 2, in 90% of cases, the customer also bought 3. • A rule must have some minimum user-specified support 1 & 2 => 3 should hold in some minimum percentage of transactions to have business value

Example • Example: • For minimum support = 50%, minimum confidence = 50%, we have the following rules 1 => 3 with 50% support and 66% confidence 3 => 1 with 50% support and 100% confidence

Problem Decomposition Example For minimum support = 50% = 2 transactions and minimum confidence = 50% For the rule 1 => 3: • Support = Support({1, 3}) = 50% • Confidence = Support({1, 3})/Support({1}) = 66%

The Apriori Algorithm • Fk : Set of frequent itemsets of size k • Ck : Set of candidate itemsets of size k F 1 = {large items} for ( k=1; Fk != 0; k++) do { Ck+1 = New candidates generated from Fk foreach transaction t in the database do Increment the count of all candidates in Ck+1 that are contained in t Fk+1 = Candidates in Ck+1 with minimum support } Answer = Uk Fk

Key Observation • Every subset of a frequent itemset is also frequent => a candidate itemset in Ck+1 can be pruned if even one of its subsets is not contained in Fk

Apriori - Example Database D C 1 F 1 C 2 F 2 Scan D C 2 Scan D

Partitioning • Divide database into partitions D 1, D 2, …, Dp • Apply Apriori to each partition • Any large itemset must be large in at least one partition.

Partitioning Algorithm 1. 2. 3. 4. 5. Divide D into partitions D 1, D 2, …, Dp; For I = 1 to p do Li = Apriori(Di); C = L 1 … L p; Count C on D to generate L;

Partitioning Example L 1 ={{Bread}, {Jelly}, {Peanut. Butter}, {Bread, Jelly}, {Bread, Peanut. Butter}, {Jelly, Peanut. Butter}, {Bread, Jelly, Peanut. Butter}} D 1 D 2 S=10% L 2 ={{Bread}, {Milk}, {Peanut. Butter}, {Bread, Milk}, {Bread, Peanut. Butter}, {Milk, Peanut. Butter}, {Bread, Milk, Peanut. Butter}, {Beer, Bread}, {Beer, Milk}}

Partitioning Adv/Disadv • Advantages: – Adapts to available main memory – Easily parallelized – Maximum number of database scans is two. • Disadvantages: – May have many candidates during second scan.

Classification • Given: – Database of tuples, each assigned a class label • Develop a model/profile for each class – Example profile (good credit): – (25 <= age <= 40 and income > 40 k) or (married = YES) • Sample applications: – Credit card approval (good, bad) – Bank locations (good, fair, poor) – Treatment effectiveness (good, fair, poor)

Decision Tree • • • Flow-chart like tree structure Each node denotes a test on an attribute value Each branch denotes outcome of the test Tree leaves represent classes or class distribution Decision tree can be easily converted into set of classification rules

Classification Example Tid 0 1 Job Self Industry Age Salary 30 30 K C 35 40 K C Class 2 Univ. 50 70 K C 3 Self 45 60 K B 4 Univ. 30 5 Industry 35 60 K A 6 Self 35 60 K A 7 Self 30 70 K A 70 K Training Data Set B (<=50 K) Sal (>50 K) Age c Class C (>40) (<=40) Job (Univ. , Industry) Class B Class C (Self) Class A Sample Decision Tree

Example Decision Tree l l a ric go c e at a ric in c t on u o u s ss Splitting Attributes a cl Refund Yes No NO Mar. St Single, Divorced Tax. Inc < 80 K NO Married NO > 80 K YES The splitting attribute at a node is determined based on the Gini index.

Decision Trees • Pros – Fast execution time – Generated rules are easy to interpret by humans – Scale well for large data sets – Can handle high dimensional data • Cons – Cannot capture correlations among attributes – Consider only axis-parallel cuts

Regression Mapping a data item to a real-value E. g. , linear regression Risk score=0. 01*(Balance)0. 3*(Age)+4*(House. Owned)

Clustering – Identifies natural groups or clusters of instances. Example: customer segmentation – Unsupervised learning: Different from classification – clusters are not predefined but are formed based on the data – Objects in each cluster are very similar to each other and are different from those in other clusters.

Specific Data Mining Applications:

What data mining has done for. . . The US Internal Revenue Service needed to improve customer service and. . . Scheduled its workforce to provide faster, more accurate answers to questions.

What data mining has done for. . . The US Drug Enforcement Agency needed to be more effective in their drug “busts” and analyzed suspects’ cell phone usage to focus investigations.

What data mining has done for. . . HSBC need to cross-sell more effectively by identifying profiles that would be interested in higher yielding investments and. . . Reduced direct mail costs by 30% while garnering 95% of the campaign’s revenue.

Privacy Issues • • • DM applications derive demographics about customers via – Credit card use – Store card – Subscription – Book, video, etc rental – and via more sources… As the DM results are deemed to be a good estimate or prediction, one has to be sensitive to the results not to violate privacy.

Final Comments • Data Mining can be used in any organization that needs to find patterns or relationships in their data. • DM analysts can have a reasonable level of assurance that their Data Mining efforts will render useful, repeatable, and valid results.

Questions?