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

Bokang Fu

dblp:422/6921 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0006-9195-6228ORCID · reported

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

Databases, data management, data science and information retrieval · 1 · 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.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 50% Information retrieval · 50%

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

TopicWeightPapersLastEvidence papers
Information retrieval › ranking
ranking optimization
1.012026
SSRec: Structured Ranking Optimization Criterion for Sequential Recommendation · ACM Trans. Inf. Syst. 2026
Recommender systems
sequential recommendation
1.012026
SSRec: Structured Ranking Optimization Criterion for Sequential Recommendation · ACM Trans. Inf. Syst. 2026

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

probabilistic model · 1.0determinantal point process · 1.0
YearPublicationVenuePosition
2026 SSRec: Structured Ranking Optimization Criterion for Sequential Recommendation
abstract
Existing S equential R ecommendation (SR) methods have conventionally viewed historical interactions as one-dimensional sequences, often overlooking the fact that user behaviors can be multi-faceted and uncertain. Such a straightforward perspective fails to account for varied behavior patterns embedded in the historical sequences. Moving beyond adhering to singular historical sequences, we treat augmented sequences as meaningful behavior patterns and jointly optimize all sequences (augmented and original sequences) to capture diverse patterns, intricate dependencies, and uncertainties. To acknowledge and distinguish new patterns derived from the original sequence, we develop a sequential order-enhanced method to calculate the edge weight, highlighting the unique dependency relationships inherent in each individual sequence. To prevent recommendations from becoming monotonous due to similarities in augmented sequences, we apply a repulsive mechanism to sequences with similar topics/categories, ensuring a broader spectrum of suggestions. Considering the potent expressive capability of the probabilistic model, Structured Determinantal Point Processes (SDPP), in representing structures, we perceive original and augmented sequences as such structures, leading to our generic learning framework S tructured S equential Rec ommendation (SSRec), which is theoretically proved to be a structured ranking optimization criterion . Comprehensive experiments on real-world datasets demonstrate SSRec’s distinct advantages over state-of-the-art models in terms of both diversity and accuracy.
Yuli Liu, Bokang Fu, Yachao Cui, Zheng-Jun Du
ACM Trans. Inf. Syst.3