GROUND RESISTANCE ESTIMATION USING INDUCTIVE MACHINE LEARNING

Size: px
Start display at page:

Download "GROUND RESISTANCE ESTIMATION USING INDUCTIVE MACHINE LEARNING"

Transcription

1 The 19 th International Symposium on High Voltage Engineering, Pilsen, Czech Republic, August, 23 28, 215 GROUND RESISTANCE ESTIMATION USING INDUCTIVE MACHINE LEARNING V. P. Androvitsaneas *1, I. F. Gonos 1, G. D. Dounias 2 and I. A. Stathopulos 1 1 High Voltage Laboratory, School of Electrical and Computer Engineering, National Technical University of Athens, 9 Iroon Politechniou Street, Zografou Campus, Athens 1578, Greece 2 Department of Financial and Management Engineering, University of the Aegean, 41 Kountouriotou Street, 82 Chios, Greece * <v.andro@mail.ntua.gr> Abstract: This work demonstrates the application of entropy information based inductive learning techniques for the estimation of the ground resistance of grounding systems, used for the safe operation of electrical installations, substations and power transmission lines. Ground resistance value must be kept in low levels, so that grounding systems are able to provide the lowest impede path for fault currents to be dispersed into the earth, in the shortest possible time. The key concern of the present work is the evaluation of grounding systems performance and the possible estimation of future formed values of ground resistance, since soil resistivity and rainfall data are available. For this purpose, measurements of soil resistivity in various depths of the ground and of rainfall height have been carried out over a period of four years or so, in a particular field inside the university campus. At the same time, the ground resistance values of few grounding rods, encased in ground enhancing compounds, are recorded as a function of time. The computational method generalizes over numerical data corresponding to these ground resistance measurements. For the modeling of the data, classes are represented by discrete intervals of measurements. Decision trees are constructed for approximating the discretevalued target function of ground resistance and then they are represented by production rules in order to improve the model comprehensibility. The error rates and the performance of the model on unseen cases are determined by a v-fold cross validation approach. Results seem promising for further development of the method. Inductive machine learning is used not primarily as a classifier aiming at obtaining high accuracy, but more as a knowledge discovery tool, finding interesting rules and decision patterns of high quality, to be checked further with statistical techniques. 1 INTRODUCTION Grounding systems constitute a quite essential part of the protection system of electrical installations, substations, and transmission or distribution lines against lightning and fault currents. These systems are designed primarily for power frequency earth fault conditions and they are used to divert high currents to the earth. Thus, a grounding system designed and constructed in a right way and complied with the robust requirements of the relevant international standards, is capable of dissipating high fault currents safely to the earth, providing protection and safety to humans and equipment from harm and damage respectively. In practice, all the parts of the grounding system are interconnected and may play a role in the dissipation of both power frequency faults and lightning impulse currents [1-2]. A grounding system, in order to be effective, has to keep its ground resistance in low levels during its lifecycle. International standards point out the influence of some factors like moisture, temperature and soil compaction on the soil resistivity and they recommend the periodic measurement of the ground resistance for the control of its values [1 2]. Nevertheless, most of the cases of electrical installations are characterized either by lack of space for the installation of the grounding systems, or the huge cost which often may be prohibitive for the construction. Furthermore, soil resistivity of the upper layer is subjected to seasonal variation due to weather conditions such as rainfall, ice and air temperature, which mainly effect on soil humidity, whereas the dissolved salts percentage and the soil consistency play a major role in soil resistivity value [3 5]. In the last decades the usage of ground enhancing compounds for soil alleviation, resulting in the diminishing of ground resistance, becomes more and more popular in engineering field. Ground enhancing compounds are usually used in high resistivity soil types and must be in full compliance with EN :212 [6]. Therefore, great deals of research works have been occupied with the study and observation of the performance of these materials and their effect on ground resistance of several forms of grounding systems [7].

2 The periodic measurement of ground resistance is very often impeded by the residence and building infrastructure. In addition, many times it is essential for engineers to have an estimation of the behavior of constructed or in design phase grounding systems over time. For sidestepping this impediment, the present work aims to develop a novel tool for classifying, estimating and perhaps forecasting the ground resistance values of several grounding systems. Extending and amplifying the application of artificial intelligence techniques on grounding systems [8 9], this study is based on soil resistivity measurements at the location of interest and on local rainfall data, using inductive machine learning (IML) techniques and particularly decision trees with the respective production rules. Decision tree learning is one of the most widely used and practical methods for inductive inference. It is a method for approximating discrete-valued target functions that is robust to noisy data, in which the learned function is represented by a decision tree and capable of learning disjunctive expressions [1]. A decision tree is a simple representation for classifying examples, so it is one of the most successful techniques for supervised classification learning. It is also a method commonly used in data mining. The goal is to create a model that predicts the value of a target variable based on several input variables. A tree can be "learned" by splitting the training set into subsets based on an attribute value test. This process is repeated on each derived subset in a recursive manner called recursive partitioning [11]. The successive division of the set of training cases proceeds until all the subsets consist of cases belonging to a single class or when splitting no longer adds value to the predictions. This process of top-down induction of decision trees (TDIDT) is an example of a greedy algorithm and it is by far the most common strategy for learning decision trees from data [12]. A simple example of a decision tree for the concept e.g. Football training is illustrated in Figure 1 [1]. An example is classified by sorting it through the tree to the appropriate leaf node, then returning the classification associated with this leaf (in this case, Yes or No). This tree classifies Saturday mornings according to whether or not they are suitable for playing football. In data mining, decision trees can be described also as the combination of mathematical and computational techniques to aid the description, categorization and generalization of a given set of data. Data come in records of the form: (x,y) = (x 1, x 2, x 3,, x k, Y) (1) The dependent variable Y is the target variable that is to be understood, classified or generalized. The vector x is composed of the input variables x 1, x 2, x 3 etc., that are used for that task. No High Humidity Outlook Sunny Overcast Normal Yes Yes Rain Strong No Wind Weak Yes Figure 1: A decision tree for the concept Football training [1]. In general, decision trees represent a disjunction of conjunctions of constraints on the attribute values of instances. Each path from the tree root to a leaf corresponds to a conjunction of attribute tests, and the tree itself to a disjunction of these conjunctions. For example, the decision tree shown in Figure 1 corresponds to the expression [1]: (Outlook = Sunny Λ Humidity = Normal) V (Outlook = Overcast) V (Outlook = Rain Λ Wind = Weak) 2 DESCRIPTION OF THE EXPERIMENT AND DATA ACQUISITION This paper presents a part of an extended study on ground enhancing compounds performance, started in February 211 and is still carried on. The data acquired from the measurements in a period of four years are used for developing a model for the ground resistance estimation and forecasting. Thus, in this work three vertical grounding rods presently denoted as G 1, G 2 and G 3, St/e-Cu type A, dimensioned 17x15mm, with a minimum copper thickness of 254μm, have been evaluated in field conditions [7]. The rod G 1 has been driven into natural soil, while G 2 has been immersed in slurry bentonite and G 3 in a trade chemical enhancing compound. The experimental layout is illustrated in Figure 2. In this figure, P i are the probes used for the measurement of soil resistivity and ground resistance, where the subscript i denotes the distance (in meters) from the rod G 1 and the probe G 3,cp is the current probe for the ground resistance measurement of the rod G 3. The measurements performed at the experimental field, for a period of four years, concern soil resistivity (ρ) in some depths of the ground (1m, 2m, 4m, 6m, 8m), ground resistance of the grounding rods (R g1, R g2, R g3 ) and rainfall height (r) at the tested site. All the measurements have been performed according to the specifications indicated by the IEEE Std 81 [1], which provides complete

3 description of the methods for measuring ground resistance, instrumentation and safety precautions. Therefore, the well-known Wenner method and the fall of potential method have been used for the measurement of soil resistivity and ground resistance respectively. Soil resistivity presents a remarkable seasonal variance as a function of rainfall height. Ground enhancing compounds performance, in turn, is affected by the chemical composition of the material, the time and the soil conditions. As far as the ground resistance is concerned, it is affected both by the soil resistivity and by the used ground enhancing compounds. The graphs of Figures 3 and 4 give a depiction of the variance, the soil resistivity and the ground resistance present, as a function of time and rainfall. G 3 2m 1m 4m P 48 P 4 P 36 P 32 P 24 P 2 P 18 P 16 P 14 P 12 P 8 G 1 Figure 2: Experimental layout. Soil resistivity (Ωm) m G 3,cp Figure 3: Soil resistivity as a function of time and rainfall. G 2 1m 2m 4m 6m 8m Rainfall Rainfall height (mm) Ground resistance (Ω) Rg1 Rg2 Rg3 Rainfall Figure 4: Ground resistance as a function of time and rainfall. 3 PROPOSED IML METHODOLOGY FOR THE ESTIMATION OF GROUND RESISTANCE 3.1 Inductive machine learning concept Although a variety of decision tree learning methods have developed with somewhat differing capabilities and requirements, decision tree learning is generally best suited to problems with the following characteristics: Instances are represented by attribute-value pairs, The target function has discrete output values, Disjunctive descriptions may be required, The training data may contain errors, The training data may contain missing attribute values. The particular problem of the ground resistance estimation has been found to fit the above characteristics. Most algorithms, developed for learning decision trees, are variations on a core algorithm that employs a top-down, greedy search through the space of possible decision trees. This approach is exemplified by the ID3 algorithm [11] and its successor C4.5 [12]. The algorithm C4.5 learns decision trees by constructing them top-down, beginning with the question which attribute should be tested at the root of the tree. To answer this question, each instance attribute is evaluated using a statistical test to determine how well it alone classifies the training cases. The best attribute is selected and used as the test at the root node of the tree. A descendant of the root node is then created for each possible value of this attribute and the training cases are sorted to the appropriate descendant node (i.e. down the branch corresponding to the case s value for this attribute). The entire process is then repeated using the training cases associated with each descendant node to select the best attribute to test at that point Rainfall height (mm)

4 in the tree. This forms a greedy search for an acceptable decision tree, in which the algorithm never backtracks to reconsider earlier choices. In order to define information gain precisely, a measure commonly used in information theory, called entropy, is defined. This characterizes the purity of an arbitrary collection of cases. Selecting one case at random from a set S of cases and announcing that it belongs to some class C j, this message has a probability [1, 12]: ( j, ) freq C S p = (2) j S where S is any set of cases, freq(c j, S) stands for the number of cases in S that belong to class C j and ISI denotes the number of cases in set S. So, the information it conveys is [1, 12]: log 2 ( j, ) freq C S S bits (3) To find the expected information from such a message pertaining to class membership, all the classes are summed over in proportion to their frequencies in S, giving [1-12]: ( ) Entropy S ( j, ) freq( C j, S ) k freq C S log S 2 S (4) j= 1 = One interpretation of entropy from information theory is that it specifies the minimum number of bits of information needed to encode the classification of an arbitrary member of S (i.e. a member of S drawn at random with uniform probability). Given entropy as a measure of the impurity in a set of training cases, a measure of the effectiveness of an attribute in classifying the training data can now be defined. This measure, called information gain, is simply the expected reduction in entropy caused by partitioning the cases according to this attribute. More precisely, the information gain, Gain(S, A) of an attribute A, relative to a set of training cases S, is defined as: Si Gain ( S, A) = Entropy ( S ) Entropy ( Si ) (5) S n i= 1 where n is the number of values of the attribute A and S i is the subset of S for which attribute A has value i. Note that the first term in (5) is just the entropy of the original training set S and the second term is the expected value of the entropy after S is partitioned using attribute A. The expected entropy described by this second term is simply the sum of the entropies of each subset S i, weighted by the fraction of cases that belong to S. 3.2 Application and results of inductive machine learning For the particular problem of ground resistance estimation a decision tree has been constructed, classifying the available ground resistance values of the training set, resulted from the field measurements, in predefined classes C j. The algorithm C5., a newer version of C4.5, was used for the decision trees construction and their produced rules. The thirteen attributes (parameters) that determine the classified values of ground resistance, used in the particular developed tree, are the daily value of soil resistivity at the depth of 1m, 2m, 4m, 6m and 8m on the day of measurement (ρ id ), the mean weekly value of soil resistivity at the same depths (ρ iw ), the mean monthly value of soil resistivity at depths of 1m and 2m (ρ im ) and the total rainfall height during the antecedent week (r w ) of the measurement day. It is noted that i = 1, 2, 4, 6, 8m in depth. For more convenience, the attributes are concisely presented in Table 1. The variable to be classified is the ground resistance of each tested grounding rod. The training set consists of 365 cases (covering a 4 years period) for the training and the validation of the decision tree. The categories (classes) to which cases are to be assigned have been established beforehand. More particularly, three different scenarios have been established for the class discrimination assigned to each rod, denoted with the letters a, b, c, as shown in tables 2, 4 and 6, considering both the uniformity of intervals and the uniform distribution of the cases among the classes. The column cases contains the cases assigned to the corresponding class during the evaluation of the model. Certainly, although the same letters are used to represent the various scenarios of each rod, the class discrimination (i.e. segmentation intervals) denoted by the same letter differs from one rod to another. Thus, a decision tree has been constructed for each individual hypothesis considering all the 13 attributes each time. Afterwards, a 1-fold cross validation (cv) run has been performed for each individual tree, as a more robust estimation of accuracy on unseen cases. The results of the developed IML model for each grounding rod are tabulated in the concentrating and concise Tables 3, 5 and 7 respectively. The extended cv error is the cv error considering each time an extended class, the default with the neighbouring classes. Table 1: Attributes Time interval Attribute Soil resistivity Rainfall height (total) Daily value ρ 1d, ρ 2d, ρ 4d, ρ 6d, ρ 8d Mean weekly value ρ 1w, ρ 2w, ρ 4w, ρ 6w, ρ 8w r w Mean monthly value ρ 1m, ρ 2m

5 Table 2: The three scenarios and the respective classes for the grounding rod G 1. Table 5: Results of the IML methodology for the grounding rod G 2. # R G1a R G1b R G1c [Ω] Cases [Ω] Cases [Ω] Cases Table 3: Results of the IML methodology for the grounding rod G 1. R G1a R G1b R G1c Nodes Trees Error [%] Rules Rules Error [%] CV Error [%] Extended CV Error [%] Table 4: The three scenarios and the respective classes for the grounding rod G 2. # R G2a R G2b R G2c [Ω] Cases [Ω] Cases [Ω] Cases R G2a R G2b R G2c Nodes Trees Error [%] Rules Rules Error [%] CV Error [%] Extended CV Error [%] Table 6: The three scenarios and the respective classes for the grounding rod G 3. # R G3a R G3b R G3c [Ω] Cases [Ω] Cases [Ω] Cases Table 7: Results of the IML methodology for the grounding rod G 3. R G3a R G3b R G3c Nodes Trees Error [%] Rules Rules Error [%] CV Error [%] Extended CV Error [%]

6 3.3 Discussion The results for the rod G 1 show that despite the remarkably low misclassification errors of decision trees and production rules, the cross validation error on unseen cases is quite high in all the scenarios. In addition to this, the cross validation error increases as the range (in Ohms) of the class becomes smaller, e.g. in scenarios (b) and (c) with 38.3% and 37.8% respectively, against the scenario (a) with 35.4%. It is obvious that these errors are higher in the case of the rod G 1 than the respective errors for the rods G 2 and G 3. This could be attributed to the large variance of values that the ground resistance of G 1 presents, as the Figure 4 indeed points out. On the contrary, considering the default class and the class next to it as an extended class, the cv error significantly decreases to approximately 1/3 of the original. The rods G 2 and G 3, on the other hand, present some proposed scenarios, as R G2a, R G3a and R G3b, with satisfactory results. The error in the scenario (a) of G 2 reaches the value of 19.5%, while the corresponding values for scenarios (a) and (b) of G 3 are just 15.1% and 14%. It seems that the soil alleviation, the ground enhancing compounds achieve and the consequent consistence in the ground resistance values (Figure 4), result in a classification task with compensative results on unseen data. This means that the ground resistance forecast, given soil resistivity and rainfall data, is a most promising task. The main cause of the great difference in cross validation errors, among the various scenarios of each individual rod, is probably the nonuniform range of the classes in each scenario. This could be a field for further investigation on the best class establishment. 4 CONCLUSIONS A classification and forecast model based on inductive machine learning algorithms has developed for predicting the time variation of ground resistance. The present work is an attempt to apply another method of artificial intelligence in the service of grounding and particularly, in the field of ground resistance estimation, a field of great importance for the design of grounding systems and the unhindered protection they provide to people and to installations. The results are encouraging enough to keep on the work on constructing similar models for the estimation of grounding systems performance. The great difference in cross validation errors points out the need for better and more focused establishment of the necessary classes. Furthermore, a probable application of a suitable attribute selection algorithm could result in much lower errors on classified unseen cases. In conclusion, the results confirm the successful application of learning decision trees in the field of grounding and, after the necessary modifications of the algorithm, it is expected to be a powerful and reliable tool. REFERENCES [1] ANSI/IEEE Std : IEEE guide for measuring earth resistivity, ground impedance, and earth surface potentials of a grounding system, Dec. 28 th, 212. [2] ANSI/IEEE Std 8-213: IΕΕΕ Guide for safety in AC substation grounding, 213. [3] I. F. Gonos, A. X. Moronis, I. A. Stathopulos: Variation of soil resistivity and ground resistance during the year, Proc. 28 th Int. Conf. on Lightning Protection (ICLP 26), Kanazawa, Japan, September 18 th 22 nd, 26, pp [4] O. Banton, M. A. Cimon, M. K. Seguin: Mapping field-scale physical properties of soil with electrical resistivity, Soil Science Society of America Journal, vol. 61, no. 4, pp , [5] K. Shudha, M. Israil, S. Mittal, J. Rai: Soil characterization using electrical resistivity tomography and geotechnical investigations, Journal of Applied Geophysics, vol. 67, no. 1, pp , 29. [6] EN :212, Lightning Protection System Components (LPSC) Part 7: Requirements for earthing enhancing compounds, Jan [7] V. P. Androvitsaneas, I. F. Gonos, I. A. Stathopulos: Performance of ground enhancing compounds during the year, Proc. 31 st Int. Conf. on Lightning Protection (ICLP 212), Vienna, Austria, September 2 nd 7 th, 212, pp [8] V. P. Androvitsaneas, A. K. Alexandridis, I. F. Gonos, G. Dounias, I. A. Stathopulos: Wavelet neural network for ground resistance estimation, Proc. of 5 th Int. Conf. High Voltage Eng. & Appl. (ICHVE), Poznan, Poland, September 8 th 11 th, 214, paper A-7-5. [9] V. P. Androvitsaneas, I. F. Gonos, I. A. Stathopulos: Artificial neural network methodology for the estimation of ground enhancing compounds resistance, IET Sci. Meas. Technol., vol. 8, no. 6, pp , Nov [1] T. M. Mitchell: Machine Learning, McGraw- Hill Science/Engineering/Math, [11] J. R. Quinlan: Induction of Decision Trees. Machine Learning 1, pp , Kluwer Academic Publishers, [12] J. R. Quinlan: C4.5: programs for machine learning, San Mateo, California, USA, Morgan Kaufmann Publishers, 1993.

Decision Trees / NLP Introduction

Decision Trees / NLP Introduction Decision Trees / NLP Introduction Dr. Kevin Koidl School of Computer Science and Statistic Trinity College Dublin ADAPT Research Centre The ADAPT Centre is funded under the SFI Research Centres Programme

More information

Decision Tree Learning

Decision Tree Learning Decision Tree Learning Berlin Chen Department of Computer Science & Information Engineering National Taiwan Normal University References: 1. Machine Learning, Chapter 3 2. Data Mining: Concepts, Models,

More information

Decision Tree Learning and Inductive Inference

Decision Tree Learning and Inductive Inference Decision Tree Learning and Inductive Inference 1 Widely used method for inductive inference Inductive Inference Hypothesis: Any hypothesis found to approximate the target function well over a sufficiently

More information

Lecture 3: Decision Trees

Lecture 3: Decision Trees Lecture 3: Decision Trees Cognitive Systems II - Machine Learning SS 2005 Part I: Basic Approaches of Concept Learning ID3, Information Gain, Overfitting, Pruning Lecture 3: Decision Trees p. Decision

More information

ML techniques. symbolic techniques different types of representation value attribute representation representation of the first order

ML techniques. symbolic techniques different types of representation value attribute representation representation of the first order MACHINE LEARNING Definition 1: Learning is constructing or modifying representations of what is being experienced [Michalski 1986], p. 10 Definition 2: Learning denotes changes in the system That are adaptive

More information

EECS 349:Machine Learning Bryan Pardo

EECS 349:Machine Learning Bryan Pardo EECS 349:Machine Learning Bryan Pardo Topic 2: Decision Trees (Includes content provided by: Russel & Norvig, D. Downie, P. Domingos) 1 General Learning Task There is a set of possible examples Each example

More information

Learning Classification Trees. Sargur Srihari

Learning Classification Trees. Sargur Srihari Learning Classification Trees Sargur srihari@cedar.buffalo.edu 1 Topics in CART CART as an adaptive basis function model Classification and Regression Tree Basics Growing a Tree 2 A Classification Tree

More information

Decision Tree Learning Mitchell, Chapter 3. CptS 570 Machine Learning School of EECS Washington State University

Decision Tree Learning Mitchell, Chapter 3. CptS 570 Machine Learning School of EECS Washington State University Decision Tree Learning Mitchell, Chapter 3 CptS 570 Machine Learning School of EECS Washington State University Outline Decision tree representation ID3 learning algorithm Entropy and information gain

More information

Learning Decision Trees

Learning Decision Trees Learning Decision Trees Machine Learning Fall 2018 Some slides from Tom Mitchell, Dan Roth and others 1 Key issues in machine learning Modeling How to formulate your problem as a machine learning problem?

More information

CS6375: Machine Learning Gautam Kunapuli. Decision Trees

CS6375: Machine Learning Gautam Kunapuli. Decision Trees Gautam Kunapuli Example: Restaurant Recommendation Example: Develop a model to recommend restaurants to users depending on their past dining experiences. Here, the features are cost (x ) and the user s

More information

Lecture 3: Decision Trees

Lecture 3: Decision Trees Lecture 3: Decision Trees Cognitive Systems - Machine Learning Part I: Basic Approaches of Concept Learning ID3, Information Gain, Overfitting, Pruning last change November 26, 2014 Ute Schmid (CogSys,

More information

Induction of Decision Trees

Induction of Decision Trees Induction of Decision Trees Peter Waiganjo Wagacha This notes are for ICS320 Foundations of Learning and Adaptive Systems Institute of Computer Science University of Nairobi PO Box 30197, 00200 Nairobi.

More information

Decision-Tree Learning. Chapter 3: Decision Tree Learning. Classification Learning. Decision Tree for PlayTennis

Decision-Tree Learning. Chapter 3: Decision Tree Learning. Classification Learning. Decision Tree for PlayTennis Decision-Tree Learning Chapter 3: Decision Tree Learning CS 536: Machine Learning Littman (Wu, TA) [read Chapter 3] [some of Chapter 2 might help ] [recommended exercises 3.1, 3.2] Decision tree representation

More information

Decision Tree. Decision Tree Learning. c4.5. Example

Decision Tree. Decision Tree Learning. c4.5. Example Decision ree Decision ree Learning s of systems that learn decision trees: c4., CLS, IDR, ASSISA, ID, CAR, ID. Suitable problems: Instances are described by attribute-value couples he target function has

More information

Learning Decision Trees

Learning Decision Trees Learning Decision Trees Machine Learning Spring 2018 1 This lecture: Learning Decision Trees 1. Representation: What are decision trees? 2. Algorithm: Learning decision trees The ID3 algorithm: A greedy

More information

Decision Tree Learning

Decision Tree Learning 0. Decision Tree Learning Based on Machine Learning, T. Mitchell, McGRAW Hill, 1997, ch. 3 Acknowledgement: The present slides are an adaptation of slides drawn by T. Mitchell PLAN 1. Concept learning:

More information

Notes on Machine Learning for and

Notes on Machine Learning for and Notes on Machine Learning for 16.410 and 16.413 (Notes adapted from Tom Mitchell and Andrew Moore.) Learning = improving with experience Improve over task T (e.g, Classification, control tasks) with respect

More information

CS 6375 Machine Learning

CS 6375 Machine Learning CS 6375 Machine Learning Decision Trees Instructor: Yang Liu 1 Supervised Classifier X 1 X 2. X M Ref class label 2 1 Three variables: Attribute 1: Hair = {blond, dark} Attribute 2: Height = {tall, short}

More information

Supervised Learning! Algorithm Implementations! Inferring Rudimentary Rules and Decision Trees!

Supervised Learning! Algorithm Implementations! Inferring Rudimentary Rules and Decision Trees! Supervised Learning! Algorithm Implementations! Inferring Rudimentary Rules and Decision Trees! Summary! Input Knowledge representation! Preparing data for learning! Input: Concept, Instances, Attributes"

More information

Decision trees. Special Course in Computer and Information Science II. Adam Gyenge Helsinki University of Technology

Decision trees. Special Course in Computer and Information Science II. Adam Gyenge Helsinki University of Technology Decision trees Special Course in Computer and Information Science II Adam Gyenge Helsinki University of Technology 6.2.2008 Introduction Outline: Definition of decision trees ID3 Pruning methods Bibliography:

More information

Chapter 3: Decision Tree Learning

Chapter 3: Decision Tree Learning Chapter 3: Decision Tree Learning CS 536: Machine Learning Littman (Wu, TA) Administration Books? New web page: http://www.cs.rutgers.edu/~mlittman/courses/ml03/ schedule lecture notes assignment info.

More information

Introduction. Decision Tree Learning. Outline. Decision Tree 9/7/2017. Decision Tree Definition

Introduction. Decision Tree Learning. Outline. Decision Tree 9/7/2017. Decision Tree Definition Introduction Decision Tree Learning Practical methods for inductive inference Approximating discrete-valued functions Robust to noisy data and capable of learning disjunctive expression ID3 earch a completely

More information

Introduction to ML. Two examples of Learners: Naïve Bayesian Classifiers Decision Trees

Introduction to ML. Two examples of Learners: Naïve Bayesian Classifiers Decision Trees Introduction to ML Two examples of Learners: Naïve Bayesian Classifiers Decision Trees Why Bayesian learning? Probabilistic learning: Calculate explicit probabilities for hypothesis, among the most practical

More information

Question of the Day. Machine Learning 2D1431. Decision Tree for PlayTennis. Outline. Lecture 4: Decision Tree Learning

Question of the Day. Machine Learning 2D1431. Decision Tree for PlayTennis. Outline. Lecture 4: Decision Tree Learning Question of the Day Machine Learning 2D1431 How can you make the following equation true by drawing only one straight line? 5 + 5 + 5 = 550 Lecture 4: Decision Tree Learning Outline Decision Tree for PlayTennis

More information

Machine Learning 2nd Edi7on

Machine Learning 2nd Edi7on Lecture Slides for INTRODUCTION TO Machine Learning 2nd Edi7on CHAPTER 9: Decision Trees ETHEM ALPAYDIN The MIT Press, 2010 Edited and expanded for CS 4641 by Chris Simpkins alpaydin@boun.edu.tr h1p://www.cmpe.boun.edu.tr/~ethem/i2ml2e

More information

Decision Tree Learning

Decision Tree Learning Topics Decision Tree Learning Sattiraju Prabhakar CS898O: DTL Wichita State University What are decision trees? How do we use them? New Learning Task ID3 Algorithm Weka Demo C4.5 Algorithm Weka Demo Implementation

More information

CHAPTER-17. Decision Tree Induction

CHAPTER-17. Decision Tree Induction CHAPTER-17 Decision Tree Induction 17.1 Introduction 17.2 Attribute selection measure 17.3 Tree Pruning 17.4 Extracting Classification Rules from Decision Trees 17.5 Bayesian Classification 17.6 Bayes

More information

Classification: Decision Trees

Classification: Decision Trees Classification: Decision Trees Outline Top-Down Decision Tree Construction Choosing the Splitting Attribute Information Gain and Gain Ratio 2 DECISION TREE An internal node is a test on an attribute. A

More information

Classification and Prediction

Classification and Prediction Classification Classification and Prediction Classification: predict categorical class labels Build a model for a set of classes/concepts Classify loan applications (approve/decline) Prediction: model

More information

Outline. Training Examples for EnjoySport. 2 lecture slides for textbook Machine Learning, c Tom M. Mitchell, McGraw Hill, 1997

Outline. Training Examples for EnjoySport. 2 lecture slides for textbook Machine Learning, c Tom M. Mitchell, McGraw Hill, 1997 Outline Training Examples for EnjoySport Learning from examples General-to-specific ordering over hypotheses [read Chapter 2] [suggested exercises 2.2, 2.3, 2.4, 2.6] Version spaces and candidate elimination

More information

Administration. Chapter 3: Decision Tree Learning (part 2) Measuring Entropy. Entropy Function

Administration. Chapter 3: Decision Tree Learning (part 2) Measuring Entropy. Entropy Function Administration Chapter 3: Decision Tree Learning (part 2) Book on reserve in the math library. Questions? CS 536: Machine Learning Littman (Wu, TA) Measuring Entropy Entropy Function S is a sample of training

More information

Machine Learning & Data Mining

Machine Learning & Data Mining Group M L D Machine Learning M & Data Mining Chapter 7 Decision Trees Xin-Shun Xu @ SDU School of Computer Science and Technology, Shandong University Top 10 Algorithm in DM #1: C4.5 #2: K-Means #3: SVM

More information

the tree till a class assignment is reached

the tree till a class assignment is reached Decision Trees Decision Tree for Playing Tennis Prediction is done by sending the example down Prediction is done by sending the example down the tree till a class assignment is reached Definitions Internal

More information

Classification Using Decision Trees

Classification Using Decision Trees Classification Using Decision Trees 1. Introduction Data mining term is mainly used for the specific set of six activities namely Classification, Estimation, Prediction, Affinity grouping or Association

More information

DECISION TREE LEARNING. [read Chapter 3] [recommended exercises 3.1, 3.4]

DECISION TREE LEARNING. [read Chapter 3] [recommended exercises 3.1, 3.4] 1 DECISION TREE LEARNING [read Chapter 3] [recommended exercises 3.1, 3.4] Decision tree representation ID3 learning algorithm Entropy, Information gain Overfitting Decision Tree 2 Representation: Tree-structured

More information

Decision Tree Learning

Decision Tree Learning Topics Decision Tree Learning Sattiraju Prabhakar CS898O: DTL Wichita State University What are decision trees? How do we use them? New Learning Task ID3 Algorithm Weka Demo C4.5 Algorithm Weka Demo Implementation

More information

Machine Learning Alternatives to Manual Knowledge Acquisition

Machine Learning Alternatives to Manual Knowledge Acquisition Machine Learning Alternatives to Manual Knowledge Acquisition Interactive programs which elicit knowledge from the expert during the course of a conversation at the terminal. Programs which learn by scanning

More information

Decision Trees.

Decision Trees. . Machine Learning Decision Trees Prof. Dr. Martin Riedmiller AG Maschinelles Lernen und Natürlichsprachliche Systeme Institut für Informatik Technische Fakultät Albert-Ludwigs-Universität Freiburg riedmiller@informatik.uni-freiburg.de

More information

Decision Trees. Data Science: Jordan Boyd-Graber University of Maryland MARCH 11, Data Science: Jordan Boyd-Graber UMD Decision Trees 1 / 1

Decision Trees. Data Science: Jordan Boyd-Graber University of Maryland MARCH 11, Data Science: Jordan Boyd-Graber UMD Decision Trees 1 / 1 Decision Trees Data Science: Jordan Boyd-Graber University of Maryland MARCH 11, 2018 Data Science: Jordan Boyd-Graber UMD Decision Trees 1 / 1 Roadmap Classification: machines labeling data for us Last

More information

Dan Roth 461C, 3401 Walnut

Dan Roth   461C, 3401 Walnut CIS 519/419 Applied Machine Learning www.seas.upenn.edu/~cis519 Dan Roth danroth@seas.upenn.edu http://www.cis.upenn.edu/~danroth/ 461C, 3401 Walnut Slides were created by Dan Roth (for CIS519/419 at Penn

More information

Decision Tree Analysis for Classification Problems. Entscheidungsunterstützungssysteme SS 18

Decision Tree Analysis for Classification Problems. Entscheidungsunterstützungssysteme SS 18 Decision Tree Analysis for Classification Problems Entscheidungsunterstützungssysteme SS 18 Supervised segmentation An intuitive way of thinking about extracting patterns from data in a supervised manner

More information

Data Mining Classification: Basic Concepts and Techniques. Lecture Notes for Chapter 3. Introduction to Data Mining, 2nd Edition

Data Mining Classification: Basic Concepts and Techniques. Lecture Notes for Chapter 3. Introduction to Data Mining, 2nd Edition Data Mining Classification: Basic Concepts and Techniques Lecture Notes for Chapter 3 by Tan, Steinbach, Karpatne, Kumar 1 Classification: Definition Given a collection of records (training set ) Each

More information

Artificial Intelligence. Topic

Artificial Intelligence. Topic Artificial Intelligence Topic What is decision tree? A tree where each branching node represents a choice between two or more alternatives, with every branching node being part of a path to a leaf node

More information

Decision T ree Tree Algorithm Week 4 1

Decision T ree Tree Algorithm Week 4 1 Decision Tree Algorithm Week 4 1 Team Homework Assignment #5 Read pp. 105 117 of the text book. Do Examples 3.1, 3.2, 3.3 and Exercise 3.4 (a). Prepare for the results of the homework assignment. Due date

More information

M chi h n i e n L e L arni n n i g Decision Trees Mac a h c i h n i e n e L e L a e r a ni n ng

M chi h n i e n L e L arni n n i g Decision Trees Mac a h c i h n i e n e L e L a e r a ni n ng 1 Decision Trees 2 Instances Describable by Attribute-Value Pairs Target Function Is Discrete Valued Disjunctive Hypothesis May Be Required Possibly Noisy Training Data Examples Equipment or medical diagnosis

More information

Decision Trees.

Decision Trees. . Machine Learning Decision Trees Prof. Dr. Martin Riedmiller AG Maschinelles Lernen und Natürlichsprachliche Systeme Institut für Informatik Technische Fakultät Albert-Ludwigs-Universität Freiburg riedmiller@informatik.uni-freiburg.de

More information

Decision Tree Learning - ID3

Decision Tree Learning - ID3 Decision Tree Learning - ID3 n Decision tree examples n ID3 algorithm n Occam Razor n Top-Down Induction in Decision Trees n Information Theory n gain from property 1 Training Examples Day Outlook Temp.

More information

Data Mining. CS57300 Purdue University. Bruno Ribeiro. February 8, 2018

Data Mining. CS57300 Purdue University. Bruno Ribeiro. February 8, 2018 Data Mining CS57300 Purdue University Bruno Ribeiro February 8, 2018 Decision trees Why Trees? interpretable/intuitive, popular in medical applications because they mimic the way a doctor thinks model

More information

Decision Trees. Common applications: Health diagnosis systems Bank credit analysis

Decision Trees. Common applications: Health diagnosis systems Bank credit analysis Decision Trees Rodrigo Fernandes de Mello Invited Professor at Télécom ParisTech Associate Professor at Universidade de São Paulo, ICMC, Brazil http://www.icmc.usp.br/~mello mello@icmc.usp.br Decision

More information

CS145: INTRODUCTION TO DATA MINING

CS145: INTRODUCTION TO DATA MINING CS145: INTRODUCTION TO DATA MINING 4: Vector Data: Decision Tree Instructor: Yizhou Sun yzsun@cs.ucla.edu October 10, 2017 Methods to Learn Vector Data Set Data Sequence Data Text Data Classification Clustering

More information

Chapter 6: Classification

Chapter 6: Classification Chapter 6: Classification 1) Introduction Classification problem, evaluation of classifiers, prediction 2) Bayesian Classifiers Bayes classifier, naive Bayes classifier, applications 3) Linear discriminant

More information

Typical Supervised Learning Problem Setting

Typical Supervised Learning Problem Setting Typical Supervised Learning Problem Setting Given a set (database) of observations Each observation (x1,, xn, y) Xi are input variables Y is a particular output Build a model to predict y = f(x1,, xn)

More information

Rule Generation using Decision Trees

Rule Generation using Decision Trees Rule Generation using Decision Trees Dr. Rajni Jain 1. Introduction A DT is a classification scheme which generates a tree and a set of rules, representing the model of different classes, from a given

More information

Classification and regression trees

Classification and regression trees Classification and regression trees Pierre Geurts p.geurts@ulg.ac.be Last update: 23/09/2015 1 Outline Supervised learning Decision tree representation Decision tree learning Extensions Regression trees

More information

Decision Trees. Tirgul 5

Decision Trees. Tirgul 5 Decision Trees Tirgul 5 Using Decision Trees It could be difficult to decide which pet is right for you. We ll find a nice algorithm to help us decide what to choose without having to think about it. 2

More information

Universität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen. Intelligent Data Analysis. Decision Trees

Universität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen. Intelligent Data Analysis. Decision Trees Universität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen Intelligent Data Analysis Decision Trees Paul Prasse, Niels Landwehr, Tobias Scheffer Decision Trees One of many applications:

More information

Lecture 24: Other (Non-linear) Classifiers: Decision Tree Learning, Boosting, and Support Vector Classification Instructor: Prof. Ganesh Ramakrishnan

Lecture 24: Other (Non-linear) Classifiers: Decision Tree Learning, Boosting, and Support Vector Classification Instructor: Prof. Ganesh Ramakrishnan Lecture 24: Other (Non-linear) Classifiers: Decision Tree Learning, Boosting, and Support Vector Classification Instructor: Prof Ganesh Ramakrishnan October 20, 2016 1 / 25 Decision Trees: Cascade of step

More information

http://xkcd.com/1570/ Strategy: Top Down Recursive divide-and-conquer fashion First: Select attribute for root node Create branch for each possible attribute value Then: Split

More information

CS 380: ARTIFICIAL INTELLIGENCE MACHINE LEARNING. Santiago Ontañón

CS 380: ARTIFICIAL INTELLIGENCE MACHINE LEARNING. Santiago Ontañón CS 380: ARTIFICIAL INTELLIGENCE MACHINE LEARNING Santiago Ontañón so367@drexel.edu Summary so far: Rational Agents Problem Solving Systematic Search: Uninformed Informed Local Search Adversarial Search

More information

Induction on Decision Trees

Induction on Decision Trees Séance «IDT» de l'ue «apprentissage automatique» Bruno Bouzy bruno.bouzy@parisdescartes.fr www.mi.parisdescartes.fr/~bouzy Outline Induction task ID3 Entropy (disorder) minimization Noise Unknown attribute

More information

Decision Trees Entropy, Information Gain, Gain Ratio

Decision Trees Entropy, Information Gain, Gain Ratio Changelog: 14 Oct, 30 Oct Decision Trees Entropy, Information Gain, Gain Ratio Lecture 3: Part 2 Outline Entropy Information gain Gain ratio Marina Santini Acknowledgements Slides borrowed and adapted

More information

Bayesian Classification. Bayesian Classification: Why?

Bayesian Classification. Bayesian Classification: Why? Bayesian Classification http://css.engineering.uiowa.edu/~comp/ Bayesian Classification: Why? Probabilistic learning: Computation of explicit probabilities for hypothesis, among the most practical approaches

More information

Data Mining Classification: Basic Concepts, Decision Trees, and Model Evaluation

Data Mining Classification: Basic Concepts, Decision Trees, and Model Evaluation Data Mining Classification: Basic Concepts, Decision Trees, and Model Evaluation Lecture Notes for Chapter 4 Part I Introduction to Data Mining by Tan, Steinbach, Kumar Adapted by Qiang Yang (2010) Tan,Steinbach,

More information

Data classification (II)

Data classification (II) Lecture 4: Data classification (II) Data Mining - Lecture 4 (2016) 1 Outline Decision trees Choice of the splitting attribute ID3 C4.5 Classification rules Covering algorithms Naïve Bayes Classification

More information

Decision Trees. CS57300 Data Mining Fall Instructor: Bruno Ribeiro

Decision Trees. CS57300 Data Mining Fall Instructor: Bruno Ribeiro Decision Trees CS57300 Data Mining Fall 2016 Instructor: Bruno Ribeiro Goal } Classification without Models Well, partially without a model } Today: Decision Trees 2015 Bruno Ribeiro 2 3 Why Trees? } interpretable/intuitive,

More information

Decision Tree Learning Lecture 2

Decision Tree Learning Lecture 2 Machine Learning Coms-4771 Decision Tree Learning Lecture 2 January 28, 2008 Two Types of Supervised Learning Problems (recap) Feature (input) space X, label (output) space Y. Unknown distribution D over

More information

Decision Tree And Random Forest

Decision Tree And Random Forest Decision Tree And Random Forest Dr. Ammar Mohammed Associate Professor of Computer Science ISSR, Cairo University PhD of CS ( Uni. Koblenz-Landau, Germany) Spring 2019 Contact: mailto: Ammar@cu.edu.eg

More information

Machine Learning 3. week

Machine Learning 3. week Machine Learning 3. week Entropy Decision Trees ID3 C4.5 Classification and Regression Trees (CART) 1 What is Decision Tree As a short description, decision tree is a data classification procedure which

More information

Imagine we ve got a set of data containing several types, or classes. E.g. information about customers, and class=whether or not they buy anything.

Imagine we ve got a set of data containing several types, or classes. E.g. information about customers, and class=whether or not they buy anything. Decision Trees Defining the Task Imagine we ve got a set of data containing several types, or classes. E.g. information about customers, and class=whether or not they buy anything. Can we predict, i.e

More information

Machine Learning 2010

Machine Learning 2010 Machine Learning 2010 Decision Trees Email: mrichter@ucalgary.ca -- 1 - Part 1 General -- 2 - Representation with Decision Trees (1) Examples are attribute-value vectors Representation of concepts by labeled

More information

Decision Trees Part 1. Rao Vemuri University of California, Davis

Decision Trees Part 1. Rao Vemuri University of California, Davis Decision Trees Part 1 Rao Vemuri University of California, Davis Overview What is a Decision Tree Sample Decision Trees How to Construct a Decision Tree Problems with Decision Trees Classification Vs Regression

More information

Tutorial 6. By:Aashmeet Kalra

Tutorial 6. By:Aashmeet Kalra Tutorial 6 By:Aashmeet Kalra AGENDA Candidate Elimination Algorithm Example Demo of Candidate Elimination Algorithm Decision Trees Example Demo of Decision Trees Concept and Concept Learning A Concept

More information

Transient analysis of the behaviour of grounding systems consisted by driven rods

Transient analysis of the behaviour of grounding systems consisted by driven rods Transient analysis of the behaviour of grounding systems consisted by driven rods I.F. GONOS M.K. ANTONIOU I.A. STATHOPULOS F.V. TOPALIS Department of Electrical and Computer Engineering, High Voltage

More information

Comparison of Shannon, Renyi and Tsallis Entropy used in Decision Trees

Comparison of Shannon, Renyi and Tsallis Entropy used in Decision Trees Comparison of Shannon, Renyi and Tsallis Entropy used in Decision Trees Tomasz Maszczyk and W lodzis law Duch Department of Informatics, Nicolaus Copernicus University Grudzi adzka 5, 87-100 Toruń, Poland

More information

Symbolic methods in TC: Decision Trees

Symbolic methods in TC: Decision Trees Symbolic methods in TC: Decision Trees ML for NLP Lecturer: Kevin Koidl Assist. Lecturer Alfredo Maldonado https://www.cs.tcd.ie/kevin.koidl/cs4062/ kevin.koidl@scss.tcd.ie, maldonaa@tcd.ie 2016-2017 2

More information

Decision Trees. Gavin Brown

Decision Trees. Gavin Brown Decision Trees Gavin Brown Every Learning Method has Limitations Linear model? KNN? SVM? Explain your decisions Sometimes we need interpretable results from our techniques. How do you explain the above

More information

Lecture 7 Decision Tree Classifier

Lecture 7 Decision Tree Classifier Machine Learning Dr.Ammar Mohammed Lecture 7 Decision Tree Classifier Decision Tree A decision tree is a simple classifier in the form of a hierarchical tree structure, which performs supervised classification

More information

Classification and Regression Trees

Classification and Regression Trees Classification and Regression Trees Ryan P Adams So far, we have primarily examined linear classifiers and regressors, and considered several different ways to train them When we ve found the linearity

More information

Machine Learning Recitation 8 Oct 21, Oznur Tastan

Machine Learning Recitation 8 Oct 21, Oznur Tastan Machine Learning 10601 Recitation 8 Oct 21, 2009 Oznur Tastan Outline Tree representation Brief information theory Learning decision trees Bagging Random forests Decision trees Non linear classifier Easy

More information

The Quadratic Entropy Approach to Implement the Id3 Decision Tree Algorithm

The Quadratic Entropy Approach to Implement the Id3 Decision Tree Algorithm Journal of Computer Science and Information Technology December 2018, Vol. 6, No. 2, pp. 23-29 ISSN: 2334-2366 (Print), 2334-2374 (Online) Copyright The Author(s). All Rights Reserved. Published by American

More information

Informal Definition: Telling things apart

Informal Definition: Telling things apart 9. Decision Trees Informal Definition: Telling things apart 2 Nominal data No numeric feature vector Just a list or properties: Banana: longish, yellow Apple: round, medium sized, different colors like

More information

Algorithms for Classification: The Basic Methods

Algorithms for Classification: The Basic Methods Algorithms for Classification: The Basic Methods Outline Simplicity first: 1R Naïve Bayes 2 Classification Task: Given a set of pre-classified examples, build a model or classifier to classify new cases.

More information

Empirical Risk Minimization, Model Selection, and Model Assessment

Empirical Risk Minimization, Model Selection, and Model Assessment Empirical Risk Minimization, Model Selection, and Model Assessment CS6780 Advanced Machine Learning Spring 2015 Thorsten Joachims Cornell University Reading: Murphy 5.7-5.7.2.4, 6.5-6.5.3.1 Dietterich,

More information

Selected Algorithms of Machine Learning from Examples

Selected Algorithms of Machine Learning from Examples Fundamenta Informaticae 18 (1993), 193 207 Selected Algorithms of Machine Learning from Examples Jerzy W. GRZYMALA-BUSSE Department of Computer Science, University of Kansas Lawrence, KS 66045, U. S. A.

More information

Einführung in Web- und Data-Science

Einführung in Web- und Data-Science Einführung in Web- und Data-Science Prof. Dr. Ralf Möller Universität zu Lübeck Institut für Informationssysteme Tanya Braun (Übungen) Inductive Learning Chapter 18/19 Chapters 3 and 4 Material adopted

More information

Distributed Clustering and Local Regression for Knowledge Discovery in Multiple Spatial Databases

Distributed Clustering and Local Regression for Knowledge Discovery in Multiple Spatial Databases Distributed Clustering and Local Regression for Knowledge Discovery in Multiple Spatial Databases Aleksandar Lazarevic, Dragoljub Pokrajac, Zoran Obradovic School of Electrical Engineering and Computer

More information

Chapter 3: Decision Tree Learning (part 2)

Chapter 3: Decision Tree Learning (part 2) Chapter 3: Decision Tree Learning (part 2) CS 536: Machine Learning Littman (Wu, TA) Administration Books? Two on reserve in the math library. icml-03: instructional Conference on Machine Learning mailing

More information

Decision Support. Dr. Johan Hagelbäck.

Decision Support. Dr. Johan Hagelbäck. Decision Support Dr. Johan Hagelbäck johan.hagelback@lnu.se http://aiguy.org Decision Support One of the earliest AI problems was decision support The first solution to this problem was expert systems

More information

Generalization Error on Pruning Decision Trees

Generalization Error on Pruning Decision Trees Generalization Error on Pruning Decision Trees Ryan R. Rosario Computer Science 269 Fall 2010 A decision tree is a predictive model that can be used for either classification or regression [3]. Decision

More information

USE OF FUZZY LOGIC TO INVESTIGATE WEATHER PARAMETER IMPACT ON ELECTRICAL LOAD BASED ON SHORT TERM FORECASTING

USE OF FUZZY LOGIC TO INVESTIGATE WEATHER PARAMETER IMPACT ON ELECTRICAL LOAD BASED ON SHORT TERM FORECASTING Nigerian Journal of Technology (NIJOTECH) Vol. 35, No. 3, July 2016, pp. 562 567 Copyright Faculty of Engineering, University of Nigeria, Nsukka, Print ISSN: 0331-8443, Electronic ISSN: 2467-8821 www.nijotech.com

More information

Decision Trees. Each internal node : an attribute Branch: Outcome of the test Leaf node or terminal node: class label.

Decision Trees. Each internal node : an attribute Branch: Outcome of the test Leaf node or terminal node: class label. Decision Trees Supervised approach Used for Classification (Categorical values) or regression (continuous values). The learning of decision trees is from class-labeled training tuples. Flowchart like structure.

More information

Lecture 7: DecisionTrees

Lecture 7: DecisionTrees Lecture 7: DecisionTrees What are decision trees? Brief interlude on information theory Decision tree construction Overfitting avoidance Regression trees COMP-652, Lecture 7 - September 28, 2009 1 Recall:

More information

Symbolic methods in TC: Decision Trees

Symbolic methods in TC: Decision Trees Symbolic methods in TC: Decision Trees ML for NLP Lecturer: Kevin Koidl Assist. Lecturer Alfredo Maldonado https://www.cs.tcd.ie/kevin.koidl/cs0/ kevin.koidl@scss.tcd.ie, maldonaa@tcd.ie 01-017 A symbolic

More information

Information Theory & Decision Trees

Information Theory & Decision Trees Information Theory & Decision Trees Jihoon ang Sogang University Email: yangjh@sogang.ac.kr Decision tree classifiers Decision tree representation for modeling dependencies among input variables using

More information

Introduction to Machine Learning CMU-10701

Introduction to Machine Learning CMU-10701 Introduction to Machine Learning CMU-10701 23. Decision Trees Barnabás Póczos Contents Decision Trees: Definition + Motivation Algorithm for Learning Decision Trees Entropy, Mutual Information, Information

More information

Will it rain tomorrow?

Will it rain tomorrow? Will it rain tomorrow? Bilal Ahmed - 561539 Department of Computing and Information Systems, The University of Melbourne, Victoria, Australia bahmad@student.unimelb.edu.au Abstract With the availability

More information

Administrative notes. Computational Thinking ct.cs.ubc.ca

Administrative notes. Computational Thinking ct.cs.ubc.ca Administrative notes Labs this week: project time. Remember, you need to pass the project in order to pass the course! (See course syllabus.) Clicker grades should be on-line now Administrative notes March

More information

A Support Vector Regression Model for Forecasting Rainfall

A Support Vector Regression Model for Forecasting Rainfall A Support Vector Regression for Forecasting Nasimul Hasan 1, Nayan Chandra Nath 1, Risul Islam Rasel 2 Department of Computer Science and Engineering, International Islamic University Chittagong, Bangladesh

More information

Predictive Analytics on Accident Data Using Rule Based and Discriminative Classifiers

Predictive Analytics on Accident Data Using Rule Based and Discriminative Classifiers Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 10, Number 3 (2017) pp. 461-469 Research India Publications http://www.ripublication.com Predictive Analytics on Accident Data Using

More information

Introduction Association Rule Mining Decision Trees Summary. SMLO12: Data Mining. Statistical Machine Learning Overview.

Introduction Association Rule Mining Decision Trees Summary. SMLO12: Data Mining. Statistical Machine Learning Overview. SMLO12: Data Mining Statistical Machine Learning Overview Douglas Aberdeen Canberra Node, RSISE Building Australian National University 4th November 2004 Outline 1 Introduction 2 Association Rule Mining

More information