Jian Xu - Citegraph

Author Info

Name	Affiliation	Papers
JIAN XU	SAP Res Ctr China, Shanghai 201203, Peoples R China	32
Collaborators	Citations	PageRank
151	301	20.18
Referers	Referees	References
706	507	181

Search Limit

100706

Publications (32 rows)

Collaborators (100 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Multi-CPR: A Multi Domain Chinese Dataset for Passage Retrieval	0	0.34	2022
EXTR: Click-Through Rate Prediction with Externalities in E-Commerce Sponsored Search	0	0.34	2022
Pretraining Representations of Multi-modal Multi-query E-commerce Search	0	0.34	2022
Transform Cold-Start Users into Warm via Fused Behaviors in Large-Scale Recommendation	0	0.34	2022
Asymptotically Unbiased Estimation for Delayed Feedback Modeling via Label Correction	0	0.34	2022
Hierarchically Constrained Adaptive Ad Exposure in Feeds	0	0.34	2022
A Cooperative-Competitive Multi-Agent Framework for Auto-bidding in Online Advertising	0	0.34	2022
Joint Optimization of Ad Ranking and Creative Selection	0	0.34	2022
Impression Allocation and Policy Search in Display Advertising	0	0.34	2021
Towards a Better Tradeoff between Effectiveness and Efficiency in Pre-Ranking: A Learnable Feature Selection based Approach	1	0.38	2021
Binary Code based Hash Embedding for Web-scale Applications	0	0.34	2021
Multi-Agent Cooperative Bidding Games for Multi-Objective Optimization in e-Commercial Sponsored Search	0	0.34	2021
Learning Effective and Efficient Embedding via an Adaptively-Masked Twins-based Layer	0	0.34	2021
A Unified Solution to Constrained Bidding in Online Display Advertising	1	0.36	2021
Exploration in Online Advertising Systems with Deep Uncertainty-Aware Learning	1	0.37	2021
Neural Auction: End-to-End Learning of Auction Mechanisms for E-Commerce Advertising	0	0.34	2021
Explicit Semantic Cross Feature Learning via Pre-trained Graph Neural Networks for CTR Prediction	1	0.36	2021
Optimizing Multiple Performance Metrics with Deep GSP Auctions for E-commerce Advertising	0	0.34	2021
Learning Optimal Tree Models under Beam Search	0	0.34	2020
A Deep Recurrent Survival Model for Unbiased Ranking	3	0.38	2020
Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising	0	0.34	2020
Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising	0	0.34	2020
Bid Optimization by Multivariable Control in Display Advertising.	4	0.46	2019
A Multi-Agent Reinforcement Learning Method for Impression Allocation in Online Display Advertising.	0	0.34	2018
Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertising.	17	0.65	2018
Smart Pacing for Effective Online Ad Campaign Optimization	15	0.70	2015
Privacy protection in personalized web search: a peer group-based approach	0	0.34	2013
Information Value-Driven Near Real-Time Decision Support Systems	2	0.37	2009
Maintaining K-Anonymity against Incremental Updates	39	1.48	2007
Utility-based anonymization for privacy preservation with less information loss	31	1.09	2006
Utility-based anonymization using local recoding	186	6.82	2006
ADenTS: an adaptive density-based tree structure for approximating aggregate queries over real attributes	0	0.34	2005