Bibliographic record
Abstract
Multi-class classification is an important and on-going research subject in machine learning. In this paper, we propose an algorithm model for k-class multi-class classification problem based on p-class (2≤ p ≤ k) support vector ordinal regression machine (SVORM). A series of algorithms can be generated by selecting the different parameters p, L and the code matrix. When p = 2, they reduce to the popular algorithms based on 2-class SVMs. When p = 3, they improve K-SVCR in [1] and ν-K-SVCR in [19]. The algorithms based on p- class SVORM in this algorithm model are more interesting because our preliminary numerical experiments show that then are promising. At last, some problems for further study are suggested. Key words: Multi-class classification problem; decomposition-reconstruction; support vector ordinal regression machine; error-correcting output code This work is supported by the Key Project of National Natural Science Foundation of China (No.10631070), the National Natural Science Foundation of China (No.10801112,No.70601033) and the China Postdoctoral Science Foundation funded project(No.20080430573)
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 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.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.006 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.000 | 0.020 |
| Open science | 0.004 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".