MétaCan
Menu
Back to cohort

Long- and Short- Term Sequential Recommendation with Temporal Interval

2022· article· en· W4385301256 on OpenAlexaff
Kun He, Qiyan Liu, Qianmu Li, Shunmei Meng

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRecommender Systems and Techniques
Canadian institutionsUniversity of Toronto
FundersState Key Laboratory of Novel Software TechnologyNational Natural Science Foundation of China
KeywordsComputer scienceTerm (time)PreferenceSequence (biology)TransformerEncoderRecommender systemArtificial intelligenceMachine learningInformation retrievalHuman–computer interactionEngineering

Abstract

fetched live from OpenAlex

Sequential recommendation aims to learn the changes of users’ interests according to their historical behaviors and predict the most likely next item. Since user’s historical behavior are sequential actions, user’s interest in different time periods has different emphases. For predicting a user’s next item, not only the recent behavior is important, but also long-term preference with all historical behaviors could not be ignored. Recently, self-attention based user preference modeling has drawn much attention for its advantages of fewer parameters and parallelism. However, most of the existing self-attention based model do not make a good distinction between the long-term and short-term preferences of users. Based on the observations, we design a sequential recommendation model based on a combination of long-term and short-term preference. On the one hand, considering the changes of users’ interests in different periods, we divide the sequence of users’ behaviors into different temporal windows. Then, we use GRU to capture users’ interests in different temporal window. On the other hand, to better combine the global and local information of user’s, we adopt a locally constrained multi-head attention mechanism based on Transformer encoder. On three real-world public datasets, we finally validate the efficacy of our 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 distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.933
Threshold uncertainty score0.273

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.032
GPT teacher head0.273
Teacher spread0.240 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designOther design
Domainnot available
GenreEmpirical

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".

Quick stats

Citations2
Published2022
Admission routes1
Has abstractyes

Explore more

Same topicRecommender Systems and TechniquesFrench-language works237,207