Modeling Long- and Short-Term Service Recommendations with a Deep Multi-Interest Network for Edge Computing
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Edge computing platforms enable application developers and content providers to provide context-aware services (such as service recommendations) using real-time wireless access network information. How to recommend the most suitable candidate from these numerous available services is an urgent task. Click-through rate (CTR) prediction is a core task of traditional service recommendation. However, many existing service recommender systems do not exploit user mobility for prediction, particularly in an edge computing environment. In this paper, we propose a model named long and short-term user preferences modeling with a multi-interest network based on user behavior. It uses a logarithmic network to capture multiple interests in different fields, enriching the representations of user short-term preferences. In terms of long-term preferences, users' comprehensive preferences are extracted in different periods and are fused using a nonlocal network. Extensive experiments on three datasets demonstrate that our model relying on user mobility can substantially improve the accuracy of service recommendation in edge computing compared with the state-of-the-art models.
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.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.004 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 0.001 |
| 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 it