Multi-Variate Data Fusion Technique for Reducing Sensor Errors in Intelligent Transportation Systems
Bibliographic record
Abstract
Connected vehicles in intelligent transportation system (ITS) scenario rely on environmental data for supporting user-centric applications along the driving time. Sensors equipped in the vehicles are responsible for accumulating data from the environment, followed by the fusion process. Such fusion process provides accurate and stable data required for the applications in a recurrent manner. In order to enhance the data fusion of connected vehicles, this article introduces multi-variate data fusion (MVDF) technique. This technique is competent in handling asynchronous and discrete data from the environment and streamlining them into continuous and delay-less inputs for the applications. The process of data fusion is aided through least square regression learning to determine the errors in different time instances. The indefinite and definite data fusion instances are differentiated using this regression model to identify the errors in fore-hand. Besides, the differentiation relies on the application run-time interval to progress data fusion within the same or extended time instance and data slots. In this manner the differentiation along with the error identification is regular until the application required data is met. The performance of this technique is verified using network simulator experiments for the metrics error, data utilization ratio, and computation time. The results show that this technique improves data utilization under controlled time and fewer errors.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| 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.001 | 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".