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

Itetsu Taru

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

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, 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.

Artificial intelligence
1 paper
Graph learning · 100%
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 › graph neural network › attention-based graph neural network
graph attention network
0.812024
Transitivity-Encoded Graph Attention Networks for Complementary Item Recommendations · ICDM 2024
Machine learning › Graph learning
graph neural network
0.812024
Transitivity-Encoded Graph Attention Networks for Complementary Item Recommendations · ICDM 2024
Recommender systems › e-commerce recommendation
complementary recommendation
0.812024
Transitivity-Encoded Graph Attention Networks for Complementary Item Recommendations · ICDM 2024
Recommender systems › e-commerce recommendation
substitute recommendation
0.212024
Transitivity-Encoded Graph Attention Networks for Complementary Item Recommendations · ICDM 2024

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

self-supervised data augmentation · 1.5graph attention · 1.5
YearPublicationVenuePosition
2024 Transitivity-Encoded Graph Attention Networks for Complementary Item Recommendations
abstract
In e-commerce recommender systems, providing product suggestions to customers that are often bought together, which is called “complementary recommendation,” not only improves customer experience but also boosts business impact. However, in practice, it is highly challenging to efficiently extract the complementary relations between the items due to noisy and low coverage of the co-purchased records in transaction datasets. To address these challenges, graph neural networks (GNN) have been increasingly adopted in complementary item recommendations thanks to their capabilities in integrating side-information and topological structures to extract these complex item relationships. However, most existing GNN-based methods fall short in learning better product complementary representation since they often utilize a simple one-to-one product-to-vector mapping strategy, which fails to describe the transitive logic of complementary items. To overcome this challenge, we propose a new GNN model called transitivity-encoded graph attention networks (TransGAT). To our knowledge, TransGAT is the first method that extends representation space by encoding the behavioral direction into embedding space in GNN and enabling mutual relationship extraction between complementary items. In order to better extract customer's intrinsic behavioral information, we further adopt the substitute information as the guidance by jointly learning complements and substitutes graphs and coupling them together. Moreover, several self-supervised data augmentation strategies are incorporated in our approach. Through evaluations on three real-world datasets, TransGAT consistently surpasses contemporary benchmarks, showcasing its prowess in complementary item recommendations.
Chenghuan Guo, Minghao Sun, Yan Gao 0029, Jia Liu 0002, Michinari Momma, Itetsu Taru
ICDM8