Decision Trees and Association Rules

Dec 03, 2012

550 likes | 1.32k Views

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

Share Presentation

Embed Code

Link

zareh

Download Presentation

Decision Trees and Association Rules

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

Decision Trees

Decision Trees. Prof. A.L. Yuille. Stat 231. Fall 2004. Duda, Hart & Stork. Chp 81-8.3 . Decision Trees. Decision Trees. Binary Classification Trees. Data can be non-metric, list of binary attributes. 2. Classification Decision Trees. Nonmetric. Data is list of binary attributes.

830 views • 15 slides

Decision Trees

Diagram. Decision nodes

387 views • 9 slides

Decision Trees

Decision Trees. Example: Conducted survey to see what customers were interested in new model car Want to select customers for advertising campaign. training set. Basic Information Gain Computations. Result: I_Gain_Ratio: city>age>car. Result: I_Gain: age > car=city.

203 views • 3 slides

Decision Trees

Decision Trees. Daisy Guevara Gilberto Jiménez Orlando Ruiz Jan Salomón. What is a rooted tree?. It is a tree in which one vertex has been designated as the root and every edge is directed away from the root. What are decision trees?.

381 views • 20 slides

Decision Trees and Decision Tables

Decision Trees and Decision Tables. Decision Trees and Decision Tables. Often our problem solutions require decisions to be made according to two or more conditions or combinations of conditions Decision trees represent such decision as a sequence of steps

1.71k views • 39 slides

Decision Trees

Decision Trees. Highly used and successful Iteratively split the Data Set into subsets one attribute at a time, using most informative attributes first Continue until you can label each leaf node with a class Attribute Features – discrete/nominal (can extend to continuous features)

365 views • 26 slides

From Decision Trees To Rules

From Decision Trees To Rules. Rules are mutually exclusive and exhaustive Rule set contains as much information as the tree. Rules Can Be Simplified. Initial Rule: (Refund=No)  (Status=Married)  No Simplified Rule: (Status=Married)  No. Derive rules from J48.

543 views • 25 slides

Decision Trees

Decision Trees. Example. Example 2. Examples, which one is better?. Good when. Samples are attribute-value pairs Target function has discrete output values Disjunctions required Missing, noisy training data. Construction. Top down construction

439 views • 29 slides

Decision Trees

Decision Trees. Shalev Ben-David. Definition. Given a function and oracle access to , determine f(x) with minimum number of queries E.g. f is OR on the bits of x – Grover search D(f) is the deterministic query complexity R(f) is the randomized query complexity

218 views • 6 slides

Classification with Decision Trees and Rules

Classification with Decision Trees and Rules. Evgueni Smirnov. Overview. Classification Problem Decision Trees for Classification Decision Rules for Classification. Classification Task. Given:

1.11k views • 80 slides

Decision Trees

Decision Trees. Many classes of problems can be formalized as search problems in decision trees . We are going to look at two different applications of search trees: First, we will solve the n-queens problem using backtracking search.

328 views • 16 slides

Decision Trees

Decision Trees. Decision tree representation ID3 learning algorithm Entropy, Information gain Overfitting. Another Example Problem. A Decision Tree. Type. Car. SUV. Minivan. -. Doors. Tires. 2. 4. Blackwall. Whitewall. +. -. -. +. Decision Trees. Decision tree representation

1.41k views • 31 slides

Decision Trees and Association Rules

Lecture 8 CS157B. Decision Trees and Association Rules. Prof. Sin-Min Lee Department of Computer Science. Data Mining: A KDD Process. Knowledge. Pattern Evaluation. Data mining: the core of knowledge discovery process. Data Mining. Task-relevant Data. Selection. Data Warehouse.

737 views • 55 slides

Decision Trees

Decision Trees. Prof. A.L. Yuille. Stat 231. Fall 2004. Duda, Hart & Stork. Chp 81-8.3. Decision Trees. Decision Trees. Binary Classification Trees. Data can be non-metric, list of binary attributes. 2. Classification Decision Trees. Nonmetric. Data is list of binary attributes.

381 views • 15 slides

Decision Trees

Decision Trees. Greg Grudic (Notes borrowed from Thomas G. Dietterich and Tom Mitchell) Modified by Longin Jan Latecki Some slides by Piyush Rai. Outline. Decision Tree Representations ID3 and C4.5 learning algorithms (Quinlan 1986) CART learning algorithm (Breiman et al. 1985)

302 views • 26 slides

DECISION TREES

DECISION TREES. An internal node represents a test on an attribute. A branch represents an outcome of the test, e.g., Color=red. A leaf node represents a class label or class label distribution.

219 views • 17 slides

Decision Trees

Decision Trees. The “No Free Lunch” Theorem. Is there any representation that is compact (ie, sub-exponential in n) for all functions? Function = truth table n attributes  2^n rows in table Classification/target column is 2^n long

372 views • 34 slides

Decision Trees

Decision Trees. Greg Grudic (Notes borrowed from Thomas G. Dietterich and Tom Mitchell) [Edited by J. Wiebe]. Outline. Decision Tree Representations ID3 and C4.5 learning algorithms (Quinlan 1986) CART learning algorithm (Breiman et al. 1985) Entropy, Information Gain Overfitting.

294 views • 28 slides

Decision trees

Decision trees. Decision trees. Originally invented for concept learning (two-class classification) over discrete features But later it was extended to more classes And also to continuous features (here: “attributes”) Also closely related to the learning of logical formulas

410 views • 34 slides

Decision Trees

Decision Trees. Jianping Fan Dept of Computer Science UNC-Charlotte. The problem of Classification. Given a set of training samples and their attribute values (x) and labels (y), try to determine the labels y of new examples. Classifier Training y = f(x) Prediction y given x.

1.06k views • 94 slides

Decision Trees

Decision Trees. categorical. categorical. continuous. class. Example of a Decision Tree. Splitting Attributes. Refund. Yes. No. NO. MarSt. Married. Single, Divorced. TaxInc. NO. < 80K. > 80K. YES. NO. Model: Decision Tree. Training Data. NO. Another Example of Decision Tree.

450 views • 38 slides

More Related