Demo Data from EDBT 2026 / reviewers in the wild / expert
Weipeng P. Yan
dblp:39/6631
· DBLP profile ↗
5ranked-venue papers
2as 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 · 4 · 2 first-authorArtificial intelligence and machine learning · 2Graphics, 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
3 papers |
Recommender systems · 89% Query processing and optimization · 11% | |
| Artificial intelligence
1 paper |
Image recognition and object detection · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems
e-commerce recommendation |
0.3 | 1 | 2018 | Telepath: Understanding Users from a Human Vision Perspective in Large-Scale Recommender Systems · AAAI 2018 |
Query processing and optimization
aggregation |
0.0 | 1 | 1995 | Eager Aggregation and Lazy Aggregation · VLDB 1995 |
Query processing and optimization › aggregate query processing
eager aggregation |
0.0 | 1 | 1995 | Eager Aggregation and Lazy Aggregation · VLDB 1995 |
Query processing and optimization
query optimization |
0.0 | 1 | 1994 | Performing Group-By before Join · ICDE 1994 |
Query processing and optimization
join processing |
0.0 | 1 | 1994 | Performing Group-By before Join · ICDE 1994 |
Methods — techniques the papers use, named apart from their topics
multi-task learning · 0.7deep neural network · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | A Joint Dynamic Ranking System with DNN and Vector-based Clustering BanditabstractThe ad-ranking module is the core of the advertising recommender system. Existing ad-ranking modules are mainly based on the deep neural network click-through rate prediction model. Recently an innovative ad-ranking paradigm called DNN-MAB has been introduced to address DNN-only paradigms’ weakness in perceiving highly dynamic user intent over time. We introduce the DNN-MAB paradigm into our ad-ranking system to alleviate the Matthew effect that harms the user experience. Due to data sparsity, however, the actual performance of DNN-MAB is lower than expected. In this paper, we propose an innovative ad-ranking paradigm called DNN-VMAB to solve these problems. Based on vectorization and clustering, it utilizes latent collaborative information in user behavior data to find a set of ads with higher relativity and diversity. As an integration of the essences of classical collaborative filtering, deep click-through rate prediction model, and contextual multi-armed bandit, it can improve platform revenue and user experience. Both offline and online experiments show the advantage of our new algorithm over DNN-MAB and some other existing algorithms. Yong Li 0034, Changping Peng, Yongjun Bao, Weipeng P. Yan |
RecSys | 7 |
| 2018 | Telepath: Understanding Users from a Human Vision Perspective in Large-Scale Recommender SystemsabstractDesigning an e-commerce recommender system that serves hundreds of millions of active users is a daunting challenge. To our best knowledge, the complex brain activity mechanism behind human shopping activities is never considered in existing recommender systems. From a human vision perspective, we found two key factors that affect users’ behaviors: items’ attractiveness and their matching degrees with users’ interests. This paper proposes Telepath, a vision-based bionic recommender system model, which simulates human brain activities in decision making of shopping, thus understanding users from such perspective. The core of Telepath is a complex deep neural network with multiple subnetworks. In practice, the Telepath model has been launched to JD’s recommender system and advertising system and outperformed the former state-of-the-art method. For one of the major item recommendation blocks on the JD app, click-through rate (CTR), gross merchandise value (GMV) and orders have been increased 1.59%, 8.16% and 8.71% respectively by Telepath. For several major ad publishers of JD demand-side platform, CTR, GMV and return on investment have been increased 6.58%, 61.72% and 65.57% respectively by the first launch of Telepath, and further increased 2.95%, 41.75% and 41.37% respectively by the second launch. Jixing Xu, Aohan Wu, Mantian Li, Jinghe Hu, Weipeng P. Yan |
AAAI | 7 |
| 2018 | A Practical Deep Online Ranking System in E-commerce Recommendation
Yan Yan 0024, Zitao Liu 0001, Wentao Guo 0008, Weipeng P. Yan, Yongjun Bao |
ECML/PKDD (3) | 5 |
| 1995 | Eager Aggregation and Lazy Aggregation
Weipeng P. Yan, Per-Åke Larson |
VLDB | 1 |
| 1994 | Performing Group-By before JoinabstractAssume that we have an SQL query containing joins and a group-by. The standard way of evaluating this type of query is to first perform all the joins and then the group-by operation. However, it may be possible to perform the group-by early, that is, to push the group-by operation past one or more joins. Early grouping may reduce the query processing cost by reducing the amount of data participating in joins. We formally define the problem, adhering strictly to the semantics of NULL and duplicate elimination in SQL2, and prove necessary and sufficient conditions for deciding when this transformation is valid. In practice, it may be expensive or even impossible to test whether the conditions are satisfied. Therefore, we also present a more practical algorithm that tests a simpler, sufficient condition. This algorithm is fast and detects a large subclass of transformable queries.> Weipeng P. Yan, Per-Åke Larson |
ICDE | 1 |