TriSeRec: A Tri-view Representation Learning Framework for Sequential/Session-based Recommendation
Bibliographic record
Abstract
Sequential/session-based recommendation models aim to learn evolving user preferences from historical user behaviors. State-of-the-art sequential/session-based recommendation models often use graph neural networks or self-attention as their building blocks. Graph neural networks excel at learning local patterns encoded in graph-structured data and have therefore shown great performance on session-based recommendation datasets, where user interactions are usually relatively short. Self-attentive models, on the other hand, are much more powerful in capturing long-range dependencies and are able to outperform graph neural network-based approaches on sequential recommendation, where longer user interactions are more frequent. As such, the recommender systems community has noted a lack of a unified framework that can simultaneously achieve great performance on both sequential and session-based recommendation. In an effort to fill this gap, this paper presents TriSeRec, a Tri-view representation learning framework for Sequential/session-based Recommendation. By converting interaction sequences into two graphical views and one sequential view, three view-specific user representations are learned by TriSeRec using graph neural networks and self-attention. The tri-view representation learning module, which is built upon the recently proposed generalized Cauchy-Schwarz divergence, disentangles and then fuses consistent and complementary information in all three views to form the final user representations for next-item predictions. Experiments on popular large-scale, real-world benchmark datasets show that TriSeRec achieves state-of-the-art performance on both sequential recommendation and session-based recommendation.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.004 | 0.002 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.005 | 0.002 |
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".