Skip to main content

Rule based Classification

 A rule-based classifier uses a set of If - Then rules for classification. An If - Then rule is an expression of the form

If condition Then conclusion.

The If part is known as rule antecedent or precondition and Then part is known as rule consequent. The rule antecedent contains attribute test condition and rule consequent contains class prediction.

If rule antecedents are satisfied, then the rule covers the data in the dataset.

The coverage and accuracy of a rule is assessed by

coverage = ncovers/|D|

accuracy = ncorrect/ncovers

where

ncovers - no of data covered by rule

ncorrect - no of data classified correctly by rule

D - no of data in the dataset.

If a rule is satisfied by a data in the dataset, then the rule is said to be triggered. IF only one rule is triggered, then the rule classifies the data, which referred as rule firing. If more than one rule is triggered, then conflict resolution strategy to be applied to classify the data. 

The size ordering and rule ordering are the conflict resolution strategies.

The size ordering strategy assigns the highest priority to the triggering rule with more attribute tests.

The rule ordering may be class based or rule based. The classes are sorted in decreasing order of prevalence.

The rules are organized into one long priority list, according to some measure of rule quality, such as accuracy, coverage, or size or based on advice from domain experts in the rule based ordering. When rule ordering is used, the rule set is known as a decision list.

Most rule-based classification systems use a class-based rule-ordering strategy.


Popular posts from this blog

Exercise 2 - Amdahl's Law

A programmer has parallelized 99% of a program, but there is no value in increasing the problem size, i.e., the program will always be run with the same problem size regardless of the number of processors or cores used. What is the expected speedup on 20 processors? Solution As per Amdahl's law, the speedup,  N - No of processors = 20 f - % of parallel operation = 99% = 1 / (1 - 0.99) + (0.99 / 20) = 1 / 0.01 + (0.99 / 20) = 16.807 The expected speedup on 20 processors is 16.807

Gaussian Elimination - Row reduction Algorithm

 Gaussian elimination is a method for solving matrix equations of the form, Ax=b.  This method is also known as the row reduction algorithm. Back  Substitution Solving the last equation for the variable and then work backward into the first equation to solve it.  The fundamental idea is to add multiples of one equation to the others in order to eliminate a variable and to continue this process until only one variable is left. Pivot row The row that is used to perform elimination of a variable from other rows is called the pivot row. Example: Solving a linear equation The augmented matrix for the above equation shall be The equation shall be solved using back substitution. The eliminating the first variable (x1) in the first row (Pivot row) by carrying out the row operation. As the second row become zero, the row will be shifted to bottom by carrying out partial pivoting. Now, the second variable (x2)  shall be eliminated by carrying out the row operation again. ...

Decision Tree Scalability Methods

 The scalable decision tree induction methods are RainForest and BOAT. RainForest method maintains an AVC set for each attribute at each node. AVC stands for Attribute Value Classlabel. BOAT , stands for Bootstrapped Optimistic Algorithm for Tree construction, uses a statistical technique known as bootstrapping., by which several smaller subsets are created. The several trees are created using the subsets and finally the full tree is generated using the trees created by smaller subsets. BOAT was found to be two to three times faster than RainForest.