Partitioning trees: A global multiclass classification technique for SVMs
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Presented in this paper is a novel technique for multiclass classification in SVMs through combination of binary classifiers,namely that of Partitioning Trees (P-Trees). The technique aims at improving the Directed Acyclic Graphs (DAGs) both interms of training as well as testing performance. It works by progressively constructing a decision graph, where each node is abinary classifier. Each trained node defines a dichotomy over the instance space which, in turn, is used to train subsequent nodes.In this way, every node trains against only a subset of the samples of its classes; namely the samples that reach the node throughthe decision graph in addition to a subsampled version of the ones that fail to reach it. Training sets reduce in size and decisionsurfaces become more compact, thus improving training and testing performance. Extensive experimental results demonstratethe effectiveness of the proposed technique in reducing the training and testing time in SVMs, while maintaining comparablegeneralization performance to the 1vs1 and DAGs techniques.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it