Ordinal Value Decision Tree

A Ordinal Value Decision Tree is a prediction tree (with nodes and edges) that is a rank prediction function.

• AKA: Ranking Tree.
• Context:
  • It can be produced by a Ranking Tree Learning System (that implements a ranking tree training algorithm).
  • It can range from being a Heuristic Rank Prediction Tree to being a Trained Rank Prediction Tree.
  • It can be pruned by a Ranking Tree Post-Pruning Algorithm.
  • It can (often) be a Human-Readable Ranking Model.
• Example(s):
  • …
• Counter-Example(s):
  • a Point-Estimation Tree.
  • a Classification Tree.
  • a Concept Hierarchy.
  • a Classification Tree Ensemble.
• See: Linear Classifier, Mixed-Attribute Type Classification Function.

---

---