You are using a browser not supported by the Wolfram Cloud
Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.
I understand and wish to continue anyway »
WOLFRAM NOTEBOOK
Approximating a Judge
Approximating a Judge
A judge's decision rule can be thought of as a mapping from facts to outcomes. And often, it is possible to approximate the facts as a set of binary values and the outcome as a binary value such as "affirmed" or "reversed", or a set of binary values. This Demonstration shows how an investigator can take a set of cases seen by a judge along with the associated outcomes and approximate the rule the judge must be applying.
You select the number of facts the judge considers and select from a large number of possibilities the actual binary rule the judge applies. You select the number of cases the judge decides. You then select the set of facts that the investigator is able to perceive. Thus, while the judge may be deciding a case based on facts 1 through 7, the investigator may only be able to perceive facts 4, 6, and 7.
The Demonstration produces a decision tree showing the algorithm that best predicts the decisions of the judge in the decided cases. You also see associated statistics such as the rule number the judge appears to be using, the number of cases the algorithm correctly predicts, and the percentage of cases the algorithm correctly predicts. You can choose the form in which this decision tree will be presented, such as "BDT" ("Binary Decision Tree") or "IF" ("if-then form"). A key at the top right of the output explains the abbreviations used in the decision tree.
It is interesting to explore the extent to which changing: (a) the cardinality of the set of facts actually used; and (b) the set of perceived facts affects the number of cases the algorithm correctly predicts.