Decision Trees: Modeling with fast intuition and slow, deliberate analysis
Bibliographic record
Abstract
The Dual Nature of Decision Trees Decision trees demonstrate a fascinating duality between human intuition and mathematical optimization. Psychologists like Kahneman and Tversky revealed how people rely on mental shortcuts and biased, heuristic-based thinking. This mirrors how decision trees use simple, hierarchical branching based on key features - just like our minds categorize objects using decisive traits. Yet decision trees are also rigorously constructed by calculating metrics like information gain that maximize analytical power. This parallels the structured analysis of rational thinking, optimizing the tree mathematically. Supported by various works by D. Kahneman, Busemeyer et al., and researchers at the university of Ottawa, this duality gives decision trees their interpretability and versatility. The visual tree structure appeals to intuitive pattern recognition, while optimized construction exploits powerful analytical techniques. Understanding this fusion between intuitive shortcuts and calculated reasoning is key to advancing decision tree capabilities and addressing their ethical and regulated use in AI applications.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.024 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.005 |
| Scholarly communication | 0.006 | 0.008 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".