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

Minshi Tan

dblp:266/1426 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

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

Databases, data management, data science and information retrieval · 1

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 · 88% Web and social media mining · 12%

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

TopicWeightPapersLastEvidence papers
Recommender systems
click-through rate prediction
0.412020
Deep Interest with Hierarchical Attention Network for Click-Through Rate Prediction · SIGIR 2020
Recommender systems
hierarchical attention
0.412020
Deep Interest with Hierarchical Attention Network for Click-Through Rate Prediction · SIGIR 2020
Web and social media mining › user behavior analysis
user behavior modeling
0.112020
Deep Interest with Hierarchical Attention Network for Click-Through Rate Prediction · SIGIR 2020
Recommender systems › user interest modeling
user interest representation
0.112020
Deep Interest with Hierarchical Attention Network for Click-Through Rate Prediction · SIGIR 2020

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

deep interest network · 0.4attention mechanism · 0.4
YearPublicationVenuePosition
2020 Deep Interest with Hierarchical Attention Network for Click-Through Rate Prediction
abstract
Deep Interest Network (DIN) is a state-of-the-art model which uses attention mechanism to capture user interests from historical behaviors. User interests intuitively follow a hierarchical pattern such that users generally show interests from a higher-level then to a lower-level abstraction. Modelling such interest hierarchy in an attention network can fundamentally improve the representation of user behaviors. We therefore propose an improvement over DIN to model arbitrary interest hierarchy: Deep Interest with Hierarchical Attention Network (DHAN). In this model, a multi-dimensional hierarchical structure is introduced on the first attention layer which attends to individual item, and the subsequent attention layers in the same dimension attend to higher-level hierarchy built on top of the lower corresponding layers. To enable modelling of multiple dimensional hierarchy, an expanding mechanism is introduced to capture one to many hierarchies. This design enables DHAN to attend different importance to different hierarchical abstractions thus can fully capture a user's interests at different dimensions (e.g. category, price or brand). To validate our model, a simplified DHAN is applied to Click-Through Rate (CTR) prediction and our experimental results on three public datasets with two levels of one-dimensional hierarchy only by category. It shows DHAN's superiority with significant AUC uplift from 12% to 21% over DIN. DHAN is also compared with another state-of-the-art model Deep Interest Evolution Network (DIEN), which models temporal interest. The simplified DHAN also gets slight AUC uplift from 1.0% to 1.7% over DIEN. A potential future work can be combination of DHAN and DIEN to model both temporal and hierarchical interests.
Hengxu He, Minshi Tan, Yunming Li, Jun Lang 0001, Dongbai Guo
SIGIR3