Optimal Classification

From Wikibooks, open books for an open world
Jump to: navigation, search

Optimal classification refers to any method of classification[1], which inexclusively minimizes the number of queries necessary to identify a particular element within a bounded class[2].

Table of Contents

Optimal Order Processing

Rypka's Method

  1. Truth Table Size-Related Equations
  2. Separatory Equations
    1. Element-Related equations
    2. Characteristic-related equations
      1. Theoretical separation
      2. Empirical separation
        1. Target Set Truth Table Values
        2. Separation Stages
  3. Computational Example
  4. Application Example

Notes

  1. Although classification elements and attributes and decision actions and conditions may employ tables and trees there are important differences in how each is defined. A classification table or tree is defined by having an element with at least one attribute with at least one value and may have more than one element, attribute or attribute value but may not have more than one element per rule. On the other hand, a decision table or tree may have more than one condition per rule, more than one state per condition and more than one action per rule.
  2. A bounded class is a collection of elements defined by the same finite group of attributes.

Specific applications

  • Classification of closed legal cases to help identify new ones
  • Artificial Neural Networks
    • Compute minimum number of hidden nodes
    • Minimize training time
  • Dynamic classification of publications
  • Soil taxonomy

See also

External links