Deep-Learning-Based SDN Model for Internet of Things: An Incremental Tensor Train Approach
Bibliographic record
Abstract
The Internet of Things (IoT) has emerged as a revolution for the design of smart applications like intelligent transportation systems, smart grid, healthcare 4.0, Industry 4.0, and many more. These smart applications are dependent on the faster delivery of data which can be used to extract their inherent patterns for further decision making. However, the enormous data generated by IoT devices are sufficient to choke the entire underlying network infrastructure. Most of the data attributes present little or no relevance to the prospective relationships and associations with the projected benefits foreseen. Therefore, order-based generalization mechanisms, known as tensors, can be used to represent these multidimensional data, thereby minimizing the flow table (FT) lookup time and reducing the storage occupancy. So, a novel IoT-train-deep approach for intelligent software-defined networking is designed in this article. The proposed approach works in four phases: 1) tensor representation; 2) deep Boltzmann machine-based classification; 3) subtensor-based flow matching process; and 4) incremental tensor train network for FT synchronization. The proposed model has been extensively tested, and it illustrates significant improvements with respect to delay, throughput, storage space, and accuracy.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".