Demo Data from EDBT 2026 / reviewers in the wild / expert
Rongxiao Huang
dblp:383/6696
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0000-7140-5601ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational social science and digital humanities · 50% Computational finance and economics · 50% | |
| Databases, data mining, and information retrieval
1 paper |
Machine learning and data management · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational finance and economics › online advertising
budget allocation |
0.8 | 1 | 2024 | Decision Focused Causal Learning for Direct Counterfactual Marketing Optimization · KDD 2024 |
Computational social science and digital humanities › marketing
marketing optimization |
0.8 | 1 | 2024 | Decision Focused Causal Learning for Direct Counterfactual Marketing Optimization · KDD 2024 |
Methods — techniques the papers use, named apart from their topics
operations research · 1.5causal learning · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Conflicts and optimization of multiple promotions combinations for merchantsabstractMarketing strategies developed by merchants on e-commerce platforms are essential tools to increase sales. To attract consumers, merchants often design multiple promotions for their products and allow them to be stacked. However, combining multiple promotions is not always rational, as some may conflict with each other. In these cases, merchants may suffer unnecessary losses, i.e., the combinations of promotions may have loopholes, which need to be urgently addressed. Thus, this paper discusses the risk assessment and optimal design of promotional combinations. A risk assessment model is established by designing heuristic rules and using machine learning. Using this model, we analyze collected marketing data to identify and categorize various types of promotional loopholes. We then construct corresponding mixed-integer linear programming (MILP) optimization models that aim to maximize merchant profits while minimizing risk. Simulation experiments demonstrate the effectiveness of our predictive model in detecting promotional loopholes. Moreover, our optimization framework provides optimal promotional combination strategies that account for both profitability and risk. Compared to optimizing single promotions in isolation, our approach significantly reduces the likelihood of unreasonable promotional strategies. This provides a practical and effective tool for merchants to assess the risks of their marketing strategies and to optimize promotion parameters before implementation. Rongxiao Huang, Bing Lv, Hongke Zhao |
Expert Syst. Appl. | 1 |
| 2024 | Decision Focused Causal Learning for Direct Counterfactual Marketing OptimizationabstractMarketing optimization plays an important role to enhance user engagement in online Internet platforms. Existing studies usually formulate this problem as a budget allocation problem and solve it by utilizing two fully decoupled stages, i.e., machine learning (ML) and operation research (OR). However, the learning objective in ML does not take account of the downstream optimization task in OR, which causes that the prediction accuracy in ML may be not positively related to the decision quality. Hao Zhou 0016, Rongxiao Huang, Guibin Jiang, Jiaqi Zheng 0001, Wei Lin 0022 |
KDD | 2 |