A QoS Classifier Based on Machine Learning for Next-Generation Optical Communication
Bibliographic record
Abstract
Code classification is essential nowadays, as determining the transmission code at the receiver side is a challenge. A novel algorithm for fixed right shift (FRS) code may be employed in embedded next-generation optical fiber communication (OFC) systems. The code aims to provide various quality of services (QoS): audio, video, and data. The Q-factor, bit error rate (BER), and signal-to-noise ratio (SNR) are studied to be used as predictors for machine learning (ML) and used in the design of an embedded QoS classifier. The hypothesis test is used to prove the ML input data robustness. Pearson’s correlation and variance-inflation factor (VIF) are revealed, as they are typical detectors of a data multicollinearity problem. The hypothesis testing shows that the statistical properties for the samples of Q-factor, BER, and SNR are similar to the population dataset, with p-values of 0.98, 0.99, and 0.97, respectively. Pearson’s correlation matrix shows a highly positive correlation between Q-factor and SNR, with 0.9. The highest VIF value is 4.5, resulting in the Q-factor. In the end, the ML evaluation shows promising results as the decision tree (DT) and the random forest (RF) classifiers achieve 94% and 99% accuracy, respectively. Each case’s receiver operating characteristic (ROC) curves are revealed, showing that the RF outperforms the DT classification performance.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".