Data Mining and Decision Trees

1. Lecture 2 CS157B Data Mining and Decision Trees Prof. Sin-Min Lee Department of Computer Science

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

4. What Is Data Mining? • Data mining (knowledge discovery in databases): • Extraction of interesting (non-trivial,implicit, previously unknown and potentially useful)information or patterns from data in large databases • Alternative names and their “inside stories”: • Data mining: a misnomer? • Knowledge discovery(mining) in databases (KDD), knowledge extraction, data/pattern analysis, data archeology, data dredging, information harvesting, business intelligence, etc. • What is not data mining? • (Deductive) query processing. • Expert systems or small ML/statistical programs

5. Why Data Mining? — Potential Applications • Database analysis and decision support • Market analysis and management • target marketing, customer relation management, market basket analysis, cross selling, market segmentation • Risk analysis and management • Forecasting, customer retention, improved underwriting, quality control, competitive analysis • Fraud detection and management • Other Applications • Text mining (news group, email, documents) and Web analysis. • Intelligent query answering

6. Market Analysis and Management (1) • Where are the data sources for analysis? • Credit card transactions, loyalty cards, discount coupons, customer complaint calls, plus (public) lifestyle studies • Target marketing • Find clusters of “model” customers who share the same characteristics: interest, income level, spending habits, etc. • Determine customer purchasing patterns over time • Conversion of single to a joint bank account: marriage, etc. • Cross-market analysis • Associations/co-relations between product sales • Prediction based on the association information

7. Market Analysis and Management (2) • Customer profiling • data mining can tell you what types of customers buy what products (clustering or classification) • Identifying customer requirements • identifying the best products for different customers • use prediction to find what factors will attract new customers • Provides summary information • various multidimensional summary reports • statistical summary information (data central tendency and variation)

8. Corporate Analysis and Risk Management • Finance planning and asset evaluation • cash flow analysis and prediction • contingent claim analysis to evaluate assets • cross-sectional and time series analysis (financial-ratio, trend analysis, etc.) • Resource planning: • summarize and compare the resources and spending • Competition: • monitor competitors and market directions • group customers into classes and a class-based pricing procedure • set pricing strategy in a highly competitive market

9. Fraud Detection and Management (1) • Applications • widely used in health care, retail, credit card services, telecommunications (phone card fraud), etc. • Approach • use historical data to build models of fraudulent behavior and use data mining to help identify similar instances • Examples • auto insurance: detect a group of people who stage accidents to collect on insurance • money laundering: detect suspicious money transactions (US Treasury's Financial Crimes Enforcement Network) • medical insurance: detect professional patients and ring of doctors and ring of references

10. Fraud Detection and Management (2) • Detecting inappropriate medical treatment • Australian Health Insurance Commission identifies that in many cases blanket screening tests were requested (save Australian $1m/yr). • Detecting telephone fraud • Telephone call model: destination of the call, duration, time of day or week. Analyze patterns that deviate from an expected norm. • British Telecom identified discrete groups of callers with frequent intra-group calls, especially mobile phones, and broke a multimillion dollar fraud. • Retail • Analysts estimate that 38% of retail shrink is due to dishonest employees.

11. Other Applications • Sports • IBM Advanced Scout analyzed NBA game statistics (shots blocked, assists, and fouls) to gain competitive advantage for New York Knicks and Miami Heat • Astronomy • JPL and the Palomar Observatory discovered 22 quasars with the help of data mining • Internet Web Surf-Aid • IBM Surf-Aid applies data mining algorithms to Web access logs for market-related pages to discover customer preference and behavior pages, analyzing effectiveness of Web marketing, improving Web site organization, etc.

12. Data Mining: A KDD Process Knowledge Pattern Evaluation • Data mining: the core of knowledge discovery process. Data Mining Task-relevant Data Selection Data Warehouse Data Cleaning Data Integration Databases

13. Steps of a KDD Process • Learning the application domain: • relevant prior knowledge and goals of application • Creating a target data set: data selection • Data cleaning and preprocessing: (may take 60% of effort!) • Data reduction and transformation: • Find useful features, dimensionality/variable reduction, invariant representation. • Choosing functions of data mining • summarization, classification, regression, association, clustering. • Choosing the mining algorithm(s) • Data mining: search for patterns of interest • Pattern evaluation and knowledge presentation • visualization, transformation, removing redundant patterns, etc. • Use of discovered knowledge

14. Area 1: Risk Analysis • Insurance companies and banks use data mining for risk analysis. • And insurance company searches in its own insurants and claims databases for relationships between personal characteristics and claim behavior.

15. Continued • The company is especially interested in the characteristics of insurants with a high deviating claim behavior. • With data mining, these so-called risk-profiles can be discovered and the company can use this information to adapt its premium polity.

16. Area 2: Direct Marketing • Data mining can also be used to discover the relationship between one’s personal characteristics, e.g. age, gender, hometown, and the probability that one will respond to a mailing. • Such relationships can be used to select those customers from the mailing database that have the highest probability of responding to a mailing.

17. This allows the company to mail its prospects selectively, thus maximizing the response. • For example: 1. Company X sends a mailing to a number of prospects. 2. The response is 2%.

18. What Data Mining can do • Enables companies to determine relationships among “internal” and “external” factors. • Predict cross-sell opportunities and make recommendations • Segment markets and personalize communications. • Predicts outcomes of future situations

19. The process Of Data Mining • There are 3 main steps in the Data Mining process: • Preparation: data is selected from the warehouse and “cleansed”. • Processing: algorithms are used to process the data. This step uses modeling to make predictions. • Analysis: output is evaluated.

20. Reasons for growing popularity • Growing data volume- enormous amount of existing and appearing data that require processing. • Limitations of Human Analysis- humans lacking objectiveness when analyzing dependencies for data. • Low cost of Machine Learning- the data mining process has a lower cost than hiring highly trained professionals to analyze data.

21. Data Mining Techniques • Association Rule- is to discover interesting associations between attributes that are contained in a database. • Clustering- finds appropriate groupings of elements for a set of data. • Sequential patterns-looking for patterns where one event leads to another later event. • Classification- looking for new patterns.

22. Applications of Data Mining • Data Mining is applied in the following areas: • Prediction of the Stock Market: predicting the future trends. • Bankruptcy prediction: prediction based on computer generated rules, using models • Foreign Exchange Market: Data Mining is used to identify trading rules. • Fraud Detection: construction of algorithms and models that will help recognize a variety of fraud patterns.

23. Results of Data Mining Include: • Forecasting what may happen in the future • Classifying people or things into groups by recognizing patterns • Clustering people or things into groups based on their attributes • Associating what events are likely to occur together • Sequencing what events are likely to lead to later events

24. 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

25. 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.

26. 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.

27. 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.

28. Data Mining process model -DM

29. Search in State Spaces

35. Decision Trees • A decision tree is a special case of a state-space graph. • It is a rooted tree in which each internal node corresponds to a decision, with a subtree at these nodes for each possible outcome of the decision. • Decision trees can be used to model problems in which a series of decisions leads to a solution. • The possible solutions of the problem correspond to the paths from the root to the leaves of the decision tree.

36. Decision Trees • x • x • x • x • x • x • x • x • x • x • x • x • Q • Q • x • x • x • x • x • x • x • x • x • x • x • x • x • x • x • Example: The n-queens problem • How can we place n queens on an nn chessboard so that no two queens can capture each other? A queen can move any number of squares horizontally, vertically, and diagonally. Here, the possible target squares of the queen Q are marked with an x.

37. Let us consider the 4-queens problem. • Question: How many possible configurations of 44 chessboards containing 4 queens are there? • Answer: There are 16!/(12!4!) = (13141516)/(234) = 13754 = 1820 possible configurations. • Shall we simply try them out one by one until we encounter a solution? • No, it is generally useful to think about a search problem more carefully and discover constraints on the problem’s solutions. • Such constraints can dramatically reduce the size of the relevant state space.

38. Obviously, in any solution of the n-queens problem, there must be exactly one queen in each column of the board. Otherwise, the two queens in the same column could capture each other. Therefore, we can describe the solution of this problem as a sequence of n decisions: Decision 1: Place a queen in the first column. Decision 2: Place a queen in the second column. ...Decision n: Place a queen in the n-th column.

39. Backtracking in Decision Trees • Q • Q • Q • Q • Q • Q • Q • Q • Q • Q • Q • Q • Q • Q • Q • Q • Q • Q empty board place 1st queen place 2nd queen place 3rd queen place 4th queen

42. Neural Network Many inputs and a single output Trained on signal and background sample Well understood and mostly accepted in HEP Decision Tree Many inputs and a single output Trained on signal and background sample Used mostly in life sciences & business

46. Decision treeBasic Algorithm • Initialize top node to all examples • While impure leaves available • select next impure leave L • find splitting attribute A with maximal information gain • for each value of A add child to L

47. gain: 0.25 bits outlook gain: 0.16 bits humidity gain: 0.03 bits temperature gain: 0.14 bits windy Decision treeFind good split • Sufficient statistics to compute info gain: count matrix

48. Decision trees • Simple depth-first construction • Needs entire data to fit in memory • Unsuitable for large data sets • Need to “scale up”

49. Decision Trees

50. Planning Tool