An incremental rare association rule mining approach with a life cycle tree structure considering time-sensitive data

Hu, Kerui; Qiu, Lemiao; Zhang, Shuyou; Wang, Zili; Fang, Naiyu

doi:10.1007/s10489-022-03978-3

Cited by 5 publications

(1 citation statement)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where concat funcð⋅Þ means to connect the dense embedding p f i of different attributes f . On the other hand, inspired by association rules [34], we learn the item dependency embeddings from the global dependency of user history. Item dependencies not only reflect the similarity of users in their selection but also reflect the complementarity and cooccurrence relationship between items.…”

Section: Item Embedding Based On Item Similarity Andmentioning

confidence: 99%

Toward Sequential Recommendation Model for Long-Term Interest Memory and Nearest Neighbor Influence

Cai

Meng

Ren

et al. 2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Sequential recommendation can make predictions by fitting users’ changing interests based on the users’ continuous historical behavior sequences. Currently, many existing sequential recommendation methods put more emphasis upon users’ recent preference (i.e., short-term interests), but simplify or even ignore the influence of users’ long-term interests, resulting in important interest features of users not being effectively mined. Moreover, users’ real intentions may not be fully captured by only focusing on their behavior histories, because users’ interests are diverse and dynamic. To solve the above problems, we propose a novel sequential recommendation model for long-term interest memory and nearest neighbor influence. Firstly, item embeddings based on item similarity and dependency are constructed to alleviate the problem of data sparsity in users’ recent interest history. Secondly, in order to effectively capture long-term interests, the long sequence is divided into multiple nonoverlapping subsequences. For these subsequences, the graph attention network with node importance factor is designed to fully extract the main interests of subsequences, and LSTM is introduced to learn the dynamic changes of interest among subsequences. Long-term interests of users are modeled through complex structure within subsequences and sequential dependencies among subsequences. Finally, the user’s neighbor representation is introduced, and a gating module is designed to integrate the user’s neighbor information and self-interests. The influence of users’ short-term and long-term interests on prediction is dynamically controlled by considering nearby features in the gating network. The experimental results on two public datasets show that the proposed sequential recommendation model can outperform the baseline methods in hit rate (HR@K) and normalized discounted cumulative gain (NDCG@K).

show abstract

Section: Item Embedding Based On Item Similarity Andmentioning

confidence: 99%