paper-with-me

홈 › Papers

Graph Spring Network and Informative Anchor Selection for Session-based Recommendation

2022-02-19 · Zizhuo Zhang, Bang Wang

Session-based recommendation (SBR) aims at predicting the next item for an ongoing anonymous session. The major challenge of SBR is how to capture richer relations in between items and learn ID-based item embeddings to capture such relations. Recent studies propose to first construct an item graph from sessions and employ a Graph Neural Network (GNN) to encode item embedding from the graph. Although such graph-based approaches have achieved performance improvements, their GNNs are not suitable for ID-based embedding learning for the SBR task. In this paper, we argue that the objective of such ID-based embedding learning is to capture a kind of \textit{neighborhood affinity} in that the embedding of a node is similar to that of its neighbors' in the embedding space. We propose a new graph neural network, called Graph Spring Network (GSN), for learning ID-based item embedding on an item graph to optimize neighborhood affinity in the embedding space. Furthermore, we argue that even stacking multiple GNN layers may not be enough to encode potential relations for two item nodes far-apart in a graph. In this paper, we propose a strategy that first selects some informative item anchors and then encode items' potential relations to such anchors. In summary, we propose a GSN-IAS model (Graph Spring Network and Informative Anchor Selection) for the SBR task. We first construct an item graph to describe items' co-occurrences in all sessions. We design the GSN for ID-based item embedding learning and propose an \textit{item entropy} measure to select informative anchors. We then design an unsupervised learning mechanism to encode items' relations to anchors. We next employ a shared gated recurrent unit (GRU) network to learn two session representations and make two next item predictions. Finally, we design an adaptive decision fusion strategy to fuse two predictions to make the final recommendation.

📄 PDF Abstract BibTeX arXiv:2202.09502

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Neural NetworkSession-Based Recommendations

Methods 이 논문이 사용한 방법론

Graph Neural Network 설명 없음

Similar Papers 제목 키워드 기반

Marker-Constrained Pose-Graph Correction for Cross-Platform Georeferencing in GNSS-Denied Environments

2026-08-17 · Marco Giberna, Jose Luis Sanchez Lopez, Holger Voos arxiv

Autonomous operation in GNSS-denied environments requires heterogeneous mapping pipelines to maintain a consistent spatial reference. This paper presents a framework using camouflage-matched fiducial markers fabricated f…

MyoFlow: Anchor-Tied Rectified Flow for HD-sEMG Gesture Recognition Across Sessions and Subjects

2026-09-15 · Chenhao Wu, Dingjie Peng, Satoshi Funabashi, Satoshi Konishi 외 arxiv

High-density surface electromyography (HD-sEMG) gesture recognition supports prosthetic control, assistive robotics, and rehabilitation, but electrode re-donning and physiological variability cause distribution shifts th…

Representation LearningGesture Recognition

Mining Possessions: Existence, Type and Temporal Anchors

2018-06-01 · NAACL 2018 6 · Dhivya Chinnappa, Eduardo Blanco

This paper presents a corpus and experiments to mine possession relations from text. Specifically, we target alienable and control possessions, and assign temporal anchors indicating when the possession holds between pos…

Vocal Bursts Type Prediction

Mediocrity is the key for LLM as a Judge Anchor Selection

2026-03-17 · Shachar Don-Yehiya, Asaf Yehudai, Leshem Choshen, Omri Abend arxiv

The ``LLM-as-a-judge'' paradigm has become a standard method for evaluating open-ended generation. To address the quadratic scalability costs of pairwise comparisons, popular benchmarks like Arena-Hard and AlpacaEval com…

Evolutionary games on cycles with strong selection

2017-01-23

Evolutionary games on graphs describe how strategic interactions and population structure determine evolutionary success, quantified by the probability that a single mutant takes over a population. Graph structures, comp…