Classification Algorithms Decision trees Rule-based induction Neural networks Memory(Case) based reasoning Genetic algorithms Bayesian networks Basic Principle (Inductive Learning Hypothesis): Any hypothesis found to approximate the target function well over a sufficiently large set of training examples will also approximate the target function well over other unobserved examples. Typical Algorithms:

Decision Tree Learning General idea: Recursively partition data into sub-groups Select an attribute and formulate a logical test on attribute Branch on each outcome of test, move subset of examples (training data) satisfying that outcome to the corresponding child node. Run recursively on each child node. Termination rule specifies when to declare a leaf node. Decision tree learning is a heuristic, one-step lookahead (hill climbing), non-backtracking search through the space of all possible decision trees.

Day OutlookTemperature HumidityWindPlay Tennis 1 SunnyHotHighWeakNo 2SunnyHotHighStrongNo 3OvercastHotHighWeakYes 4RainMildHighWeakYes 5RainCoolNormalWeakYes 6RainCoolNormalStrongNo 7OvercastCoolNormalStrongYes 8SunnyMildHighWeakNo 9SunnyCoolNormalWeakYes 10RainMildNormalWeakYes 11SunnyMild NormalStrongYes 12OvercastMildHighStrongYes 13OvercastHotNormalWeakYes 14RainMildHighStrongNo Outlook SunnyOvercastRain Humidity Yes Wind HighNormal NoYesNo Yes Strong Weak Decision Tree: Example

DecisionTree(examples) = Prune (Tree_Generation(examples)) Tree_Generation (examples) = IF termination_condition (examples) THEN leaf ( majority_class (examples) ) ELSE LET Best_test = selection_function (examples) IN FOR EACH value v OF Best_test Let subtree_v = Tree_Generation ({ e  example| e.Best_test = v ) IN Node (Best_test, subtree_v ) Definition : selection: used to partition training data termination condition: determines when to stop partitioning pruning algorithm: attempts to prevent overfitting Decision Tree : Training

The basic approach to select a attribute is to examine each attribute and evaluate its likelihood for improving the overall decision performance of the tree. The most widely used node-splitting evaluation functions work by reducing the degree of randomness or ‘impurity” in the current node : Entropy function (C4.5): Information gain : ID3 and C4.5 branch on every value and use an entropy minimisation heuristic to select best attribute. CART branches on all values or one value only, uses entropy minimisation or gini function. GIDDY formulates a test by branching on a subset of attribute values (selection by entropy minimisation) Selection Measure : the Critical Step

Outlook SunnyOvercastRain Yes ? ? {1, 2,8,9,11 }{4,5,6,10,14}  (Sunny, Humidity) = /5*0 - 2/5*0 = 0.97  (Sunny,Temperature) = /5*0 - 2/5*1 - 1/5*0.0 = 0.57  (Sunny,Wind)= = 2/5* /5*0.918 = The algorithm searches through the space of possible decision trees from simplest to increasingly complex, guided by the information gain heuristic. Tree Induction :

Overfitting Consider error of hypothesis H over –training data : error_training (h) –entire distribution D of data : error_D (h) Hypothesis h overfits training data if there is an alternative hypothesis h’ such that error_training (h) < error_training (h’) error_D (h) > error (h’)

Preventing Overfitting Problem: We don’t want algorithms to fit to ``noise’’ Reduced-error pruning : –breaks the samples into a training set and a test set. The tree is induced completely on the training set. –Working backwards from the bottom of the tree, the subtree starting at each nonterminal node is examined. If the error rate on the test cases improves by pruning it, the subtree is removed. The process continues until no improvement can be made by pruning a subtree, The error rate of the final tree on the test cases is used as an estimate of the true error rate.

Decision Tree Pruning : physician fee freeze = n: | adoption of the budget resolution = y: democrat (151.0) | adoption of the budget resolution = u: democrat (1.0) | adoption of the budget resolution = n: | | education spending = n: democrat (6.0) | | education spending = y: democrat (9.0) | | education spending = u: republican (1.0) physician fee freeze = y: | synfuels corporation cutback = n: republican (97.0/3.0) | synfuels corporation cutback = u: republican (4.0) | synfuels corporation cutback = y: | | duty free exports = y: democrat (2.0) | | duty free exports = u: republican (1.0) | | duty free exports = n: | | | education spending = n: democrat (5.0/2.0) | | | education spending = y: republican (13.0/2.0) | | | education spending = u: democrat (1.0) physician fee freeze = u: | water project cost sharing = n: democrat (0.0) | water project cost sharing = y: democrat (4.0) | water project cost sharing = u: | | mx missile = n: republican (0.0) | | mx missile = y: democrat (3.0/1.0) | | mx missile = u: republican (2.0) Simplified Decision Tree: physician fee freeze = n: democrat (168.0/2.6) physician fee freeze = y: republican (123.0/13.9) physician fee freeze = u: | mx missile = n: democrat (3.0/1.1) | mx missile = y: democrat (4.0/2.2) | mx missile = u: republican (2.0/1.0) Evaluation on training data (300 items): Before Pruning After Pruning Size Errors Size Errors Estimate 25 8( 2.7%) 7 13( 4.3%) ( 6.9%) <

False Positives True Positives False Negatives Actual Predicted Evaluation of Classification Systems Training Set: examples with class values for learning. Test Set: examples with class values for evaluating. Evaluation: Hypotheses are used to infer classification of examples in the test set; inferred classification is compared to known classification. Accuracy: percentage of examples in the test set that are classified correctly.