WXGCB: A Clustering Prior Weighting Semi-Supervised Learning Method Based on Space Level Constraint and Mixed Variable Metrics
Bibliographic record
Abstract
A clustering prior weighted semi-supervised learning method called WXGCB has been proposed, which combines the characteristics of the cluster-then-label semi-supervised method and space-level constraint semi-supervised method. WXGCB can use mixed variable information, data prior information, and clustering prior information based on different clustering algorithms to adjust the distance matrix, thereby transforming different supervised learning algorithms into semi-supervised learning algorithms for improving their prediction accuracy. Due to the fact that WXGCB does not require internal adjustments to the clustering algorithms and supervised learning algorithms used, this method can flexibly combine different clustering algorithms and supervised learning algorithms to find combinations that can better compensate for each other's shortcomings, and can easily convert various supervised learning algorithms into semi-supervised learning algorithms. To verify the effectiveness of WXGCB, WXGCB transformed two supervised learning algorithms KSNN and DBGLM into semi-supervised mixed variable learning algorithms SMKSNN and SMGLM, and conducted performance comparison experiments with the other two semi-supervised learning algorithms on six benchmark datasets.
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.003 | 0.006 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.004 | 0.002 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.002 | 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".