Demo Data from VLDB 2026 / reviewers in the wild / expert
Pengyun Yan
dblp:272/8772
· DBLP profile ↗
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
Graphics, computer vision, multimedia, augmented reality and games · 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 · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems › fashion recommendation
fashion compatibility modeling |
0.4 | 1 | 2020 | Learning Tuple Compatibility for Conditional Outfit Recommendation · ACM Multimedia 2020 |
Recommender systems › fashion recommendation
outfit recommendation |
0.4 | 1 | 2020 | Learning Tuple Compatibility for Conditional Outfit Recommendation · ACM Multimedia 2020 |
Methods — techniques the papers use, named apart from their topics
tuple compatibility learning · 0.4mixed category attention network · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Learning Tuple Compatibility for Conditional Outfit RecommendationabstractOutfit recommendation requires the answers of some challenging outfit compatibility questions such as 'Which pair of boots and school bag go well with my jeans and sweater?'. It is more complicated than conventional similarity search, and needs to consider not only visual aesthetics but also the intrinsic fine-grained and multi-category nature of fashion items. Some existing approaches solve the problem through sequential models or learning pair-wise distances between items. However, most of them only consider coarse category information in defining fashion compatibility while neglecting the fine-grained category information often desired in practical applications. To better define the fashion compatibility and more flexibly meet different needs, we propose a novel problem of learning compatibility among multiple tuples (each consisting of an item and category pair), and recommending fashion items following the category choices from customers. Our contributions include: 1) Designing a Mixed Category Attention Net (MCAN) which integrates both fine-grained and coarse category information into recommendation and learns the compatibility among fashion tuples. MCAN can explicitly and effectively generate diverse and controllable recommendations based on need. 2) Contributing a new dataset IQON, which follows eastern culture and can be used to test the generalization of recommendation systems. Our extensive experiments on a reference dataset Polyvore and our dataset IQON demonstrate that our method significantly outperforms state-of-the-art recommendation methods. Dongliang Xie, Xin Wang 0001, Jiangbo Yuan, Wanying Ding, Pengyun Yan |
ACM Multimedia | 6 |