Explain RULE BASE CLASSIFIER with example./Properties of rule-based classifiers

 RULE BASE CLASSIFIER

  • Rule-based classifiers are just another type of classifier that makes the class decision depending by using various "if-else" rules. These rules are easily interpretable and thus these classifiers are generally used to generate descriptive models. The condition used with "if" is called the antecedent and the predicted class of each rule is called the consequent. An IF-THEN rule is an expression of the form IF condition THEN conclusion.
  •  For example, IF((Refund=No)^ (Marital Status = {Married})) THEN No. Alternatively, if then rule can be expressed as, (Refund=No)^ (Marital Status= = (Married))→ No. The "IF" part (or left side) of a rule is known as the rule antecedent or precondition. The "THEN" part (or right side) is the rule consequent. In the rule antecedent, the condition consists of one or more attribute tests that are logically ANDed. The rule's consequence contains a class prediction. 
  • Rule-based classifiers predict the class label of a given data tuple X, the class label present in the consequence of a rule if that rule condition is satisfied by the attribute value of X.


Properties of rule-based classifiers

  • Coverage: The percentage of records that satisfy the antecedent conditions of a particular rule.
  • The rules generated by the rule-based classifiers are generally not mutually exclusive, i.e. many rules can cover the same record.
  • The rules generated by the rule-based classifiers may not be exhaustive, i.e. there may be some records that are not covered by any of the rules. 
  • The decision boundaries created by them are linear, but these can be much more complex than the decision tree because many rules are triggered for the same record.
Example of  RULE BASE CLASSIFIER


Comments

Popular posts from this blog

Short note on E-Government Architecture

Discuss classification or taxonomy of virtualization at different levels.

Suppose that a data warehouse for Big-University consists of the following four dimensions: student, course, semester, and instructor, and two measures count and avg_grade. When at the lowest conceptual level (e.g., for a given student, course, semester, and instructor combination), the avg_grade measure stores the actual course grade of the student. At higher conceptual levels, avg_grade stores the average grade for the given combination. a) Draw a snowflake schema diagram for the data warehouse. b) Starting with the base cuboid [student, course, semester, instructor], what specific OLAP operations (e.g., roll-up from semester to year) should one perform in order to list the average grade of CS courses for each BigUniversity student. c) If each dimension has five levels (including all), such as “student < major < status < university < all”, how many cuboids will this cube contain (including the base and apex cuboids)?