Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yalin Yu

dblp:354/0790 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 87% Representation and self-supervised learning · 13%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › hypergraph learning
hypergraph convolution
0.712023
Basket Representation Learning by Hypergraph Convolution on Repeated Items for Next-basket Recommendation · IJCAI 2023
Machine learning › Graph learning › hypergraph learning
hypergraph neural network
0.712023
Basket Representation Learning by Hypergraph Convolution on Repeated Items for Next-basket Recommendation · IJCAI 2023
Recommender systems › session-based recommendation
next-basket recommendation
0.712023
Basket Representation Learning by Hypergraph Convolution on Repeated Items for Next-basket Recommendation · IJCAI 2023
Machine learning › Representation and self-supervised learning
contrastive learning
0.212023
Basket Representation Learning by Hypergraph Convolution on Repeated Items for Next-basket Recommendation · IJCAI 2023

Methods — techniques the papers use, named apart from their topics

hypergraph convolution · 1.3data augmentation · 1.3contrastive learning · 1.3
YearPublicationVenuePosition
2023 Basket Representation Learning by Hypergraph Convolution on Repeated Items for Next-basket Recommendation
abstract
Basket representation plays an important role in the task of next-basket recommendation. However, existing methods generally adopts pooling operations to learn a basket's representation, from which two critical issues can be identified. First, they treat a basket as a set of items independent and identically distributed. We find that items occurring in the same basket have much higher correlations than those randomly selected by conducting data analysis on a real dataset. Second, although some works have recognized the importance of items repeatedly purchased in multiple baskets, they ignore the correlations among the repeated items in a same basket, whose importance is shown by our data analysis. In this paper, we propose a novel Basket Representation Learning (BRL) model by leveraging the correlations among intra-basket items. Specifically, we first connect all the items (in a basket) as a hyperedge, where the correlations among different items can be well exploited by hypergraph convolution operations. Meanwhile, we also connect all the repeated items in the same basket as a hyperedge, whereby their correlations can be further strengthened. We generate a negative (positive) view of the basket by data augmentation on repeated (non-repeated) items, and apply contrastive learning to force more agreements on repeated items. Finally, experimental results on three real datasets show that our approach performs better than eight baselines in ranking accuracy.
Yalin Yu, Enneng Yang, Guibing Guo, Linying Jiang, Xingwei Wang 0001
IJCAI1