Unsupervised Two-Stage Learning Framework for Cooperative Spectrum Sensing
Bibliographic record
Abstract
A cognitive radio (CR) network consists of wireless devices that opportunistically borrow vacant licensed bands. Cognitive users adaptively employ a perception-action decision cycle. Learning-based CR networks use past acquired knowledge of the radio environment to make smarter decisions. CR systems that use supervised learning for spectrum sensing require labeled data for training purposes. Having readily available labeled data is a complex task for CR networks, as it requires cooperation between the primary and secondary users. Such cooperation is not possible in interweave CR networks and imposes a cooperation overhead. Motivated by the above, we tackle the problem of labeled data scarcity in practical learning-based CR networks. We propose an unsupervised two-stage learning framework for cooperative spectrum sensing. The system combines the superior performance of the Support Vector Machine (SVM) and low cost training data of the Gaussian Mixture Model (GMM). A system model is proposed, and the system’s performance is evaluated based on the Receiver Operating Characteristics (ROC) and Area Under the ROC Curve (AUC). We obtain an upper and a lower performance bounds in terms of the AUC. The detection performance is compared for the SVM, GMM, and the proposed two-stage system based on the ROC. Additionally, we evaluate the detection performance of the CR network under different primary network sizes. Our results show that the two-stage learning approach attains a higher detection performance than the GMM algorithm, and achieves the same or comparable performance to the SVM algorithm.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".