A Study of Missing Collaborative Data Imputation Models based on Same-City Delivery
Bibliographic record
Abstract
With advent of the postepidemic era, the development of digital logistics operations management is imminent. Among the various logistics delivery methods, same-city delivery is chosen by the vast majority of customers for its timeliness and safety. Online ordering and delivery methods for same-city delivery are also gaining increasing attention from enterprises which need to know the inventory balance of all same-city warehouses in time for early deployment and response. However, in practice, the inventory balance of each warehouse can be affected by other warehouses in the same city, and there is often a lack of data in the inventory management system due to equipment and other issues resulting in a poor response from the company to handle emergencies. To address these issues, an improved matrix decomposition model was designed to interpolate the missing data by taking into account the spatiotemporal correlation between warehouses. The L-curve criterion was used to select hyperparameter values, the spatiotemporal regularize was used to capture the time dependence of the time series, and the model performance was evaluated using root mean square error and mean absolute percentage error. Comparisons with classical interpolation techniques were made to validate the improved performance of the proposed method.
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.023 | 0.039 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.003 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.005 | 0.002 |
| Research integrity | 0.003 | 0.003 |
| 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".