Improved waveform‐feature‐based vehicle classification using a single‐point magnetic sensor
Bibliographic record
Abstract
Summary Vehicle classification systems have important roles in applications related to real‐time traffic management. They also provide essential data and necessary information for traffic planning, pavement design, and maintenance. Among various classification techniques, the length‐based classification technique is widely used at present. However, the undesirable speed estimates provided by conventional data aggregation make it impossible to collect reliable length data from a single‐point sensor during real‐time operations. In this paper, an innovative approach of vehicle classification will be proposed, which achieved very satisfactory results on a single‐point sensor. This method has two essential parts. The first concerns with the procedure of smart feature extraction and selection according to the proposed filter–filter–wrapper model. The model of filter–filter–wrapper is adopted to make an evaluation on the extracted feature subsets. Meanwhile, the model will determine a nonredundant feature subset, which can make a complete reflection on the differences of various types of vehicles. In the second part, an algorithm for vehicle classification according to the theoretical basis of clustering support vector machines (C‐SVMs) was established with the selected optimal feature subset. The paper also uses particle swarm optimization (PSO), with the purpose of searching for an optimal kernel parameter and the slack penalty parameter in C‐SVMs. A total of 460 samples were tested through cross validation, and the result turned out that the classification accuracy was over 99%. In summary, the test results demonstrated that our vehicle classification method could enhance the efficiency of machine‐learning‐based data mining and the accuracy of vehicle classification. Copyright © 2014 John Wiley & Sons, Ltd.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".