Demo Data from VLDB 2026 / reviewers in the wild / expert
Gaofei Wang
dblp:51/5167
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · unresolved
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 |
Web and social media mining · 50% Data mining · 50% | |
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining
network analysis |
0.4 | 1 | 2020 | Trust Relationship Prediction in Alibaba E-Commerce Platform · IEEE Trans. Knowl. Data Eng. 2020 |
Web and social media mining › social network analysis
trust prediction |
0.4 | 1 | 2020 | Trust Relationship Prediction in Alibaba E-Commerce Platform · IEEE Trans. Knowl. Data Eng. 2020 |
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models |
0.1 | 1 | 2020 | Trust Relationship Prediction in Alibaba E-Commerce Platform · IEEE Trans. Knowl. Data Eng. 2020 |
Methods — techniques the papers use, named apart from their topics
graphical model · 0.9fast learning algorithm · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Trust Relationship Prediction in Alibaba E-Commerce PlatformabstractThis paper introduces how to infer trust relationships from billion-scale networked data to benefit Alibaba E-Commerce business. To effectively leverage the network correlations between labeled and unlabeled relationships to predict trust relationships, we formalize trust into multiple types and propose a graphical model to incorporate type-based dyadic and triadic correlations, namely eTrust. We also present a fast learning algorithm in order to handle billion-scale networks. Systematically, we evaluate the proposed methods on four different genres of datasets with labeled trust relationships: Alibaba, Epinions, Ciao, and Advogato. Experimental results show that the proposed methods achieve significantly better performance than several comparison methods (+1.7-32.3% by accuracy; p <; <; 0:01, with t-test). Most importantly, when handling the real large networked data with over 1,200,000,000 edges (Ali-large), our method achieves 2,000× speedup to infer trust relationships, comparing with the traditional graph learning algorithms. Finally, we have applied the inferred trust relationships to Alibaba E-commerce platform: Taobao, and achieved 2.75 percent improvement on gross merchandise volume (GMV). Yukuo Cen, Jing Zhang 0001, Gaofei Wang, Yujie Qian, Chuizheng Meng, Zonghong Dai, Hongxia Yang, Jie Tang 0001 |
IEEE Trans. Knowl. Data Eng. | 3 |