Jingping Bi

Jingping Bi

Auto-generated profile, based on publicly available information

Jingping Bi

State Key Laboratory of AI Safety, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 February 2018 in Expert Systems
Verified
Journal Article
Closed access
PDF file
DYDi Yao
Di Yao
CZChao Zhang
Chao Zhang
ZZZhihua Zhu
Zhihua Zhu
QHQin Hu
Qin Hu
ZWZheng Wang
Zheng Wang
JBJingping Bi
Jingping Bi

4 August 2023
Verified
Conference Paper
Open access
CGChang Gong
Chang Gong
DYDi Di Yao
Di Di Yao
CZChuzhe Zhang
Chuzhe Zhang
WLWenbin Li
Wenbin Li
JBJingping Bi
Jingping Bi
JWJin Wang
Jin Wang
Temporal data representing chronological observations of complex systems can be ubiquitously collected in smart industry, medicine, finance and etc. In the last decade, many tasks have been studied for mining temporal data and offered significant value for various applications. Among these tasks, causal discovery aims to understand the underlying generation mechanism of temporal data and has attracted much research attention. According to whether the data is calibrated, existing causal discovery approaches can be divided into two subtasks, i.e., multivariate time-series causal discovery, and event sequence causal discovery. Previous tutorials or surveys have primarily focused on causal discovery from time-series data and disregarded the second ones. In this tutorial, we elucidate the correlation between the two subtasks and provide a comprehensive review of the existing solutions. Moreover, we offer some potential applications and summarize new perspectives for discovering causal relations from temporal data. We hope the audiences can obtain a systematic overview of this topic and inspire some new ideas for their own research.

24 December 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
DYDi Di Yao
Di Di Yao
GCGao Cong
Gao Cong
CZChao Zhang
Chao Zhang
XMXuying Meng
Xuying Meng
RDRongchang Duan
Rongchang Duan
JBJingping Bi
Jingping Bi
Time series similarity computation is a fundamental primitive that underpins many time series data analysis tasks. However, many existing time series similarity measures have a high computation cost. While there has been much research effort for reducing the computational cost, such effort is usually specific to one similarity measure. We propose NEUTS (Neural metric learning for Time Series) to accelerate time series similarity computation in a generic fashion. NEUTS computes the similarity of a given time series pair in linear time and generic to handle any existing similarity measures. NEUTS samples a number of seed time series from the given database, and then uses their pair-wise similarities as guidance to approximate the similarity function with a neural metric learning framework. NEUTS features two novel modules to achieve accurate approximation of the similarity function: (1) a local attention memory module that augments existing recurrent neural networks for time series encoding; and (2) a distance-weighted ranking loss that effectively transcribes information from the seed-based guidance. With these two modules, NEUTS can yield high accuracies and fast convergence rates even if the training data is small. Our experiments with five real-life datasets and four similarity measures (Fréchet, Hausdorff, ERP and DTW) show that NEUTS outperforms baselines consistently and significantly. Specifically, it achieves over 80% accuracies in most settings, while obtaining 50x-1000x speedup over bruteforce methods and 3x-350x speedup over approximate algorithms for top-k similarity search.

14 August 2022
Verified
Conference Paper
Open access
DYDi Di Yao
Di Di Yao
CGChang Gong
Chang Gong
LZLei Zhang
Lei Zhang
SCSheng Chen
Sheng Chen
JBJingping Bi
Jingping Bi
Multi-touch attribution (MTA), aiming to estimate the contribution of each advertisement touchpoint in conversion journeys, is essential for budget allocation and automatically advertising. Existing methods first train a model to predict the conversion probability of the advertisement journeys with historical data and calculate the attribution of each touchpoint by using the results counterfactual predictions. An assumption of these works is the conversion prediction model is unbiased. It can give accurate predictions on any randomly assigned journey, including both the factual and counterfactual ones. Nevertheless, this assumption does not always hold as the user preferences act as the common cause for both ad generation and user conversion, involving the confounding bias and leading to an out-of-distribution (OOD) problem in the counterfactual prediction. In this paper, we define the causal MTA task and propose CausalMTA to solve this problem. It systemically eliminates the confounding bias from both static and dynamic perspectives and learn an unbiased conversion prediction model using historical data. We also provide a theoretical analysis to prove the effectiveness of CausalMTA with sufficient ad journeys. Extensive experiments on both synthetic and real data in Alibaba advertising platform show that CausalMTA can not only achieve better prediction performance than the state-of-the-art method but also generate meaningful attribution credits across different advertising channels.

4 March 2024
Verified
Conference Paper
Open access
CGChang Gong
Chang Gong
DYDi Di Yao
Di Di Yao
LZLei Zhang
Lei Zhang
SCSheng Chen
Sheng Chen
WLWenbin Li
Wenbin Li
JBJingping Bi
Jingping Bi

18 July 2023
Verified
Conference Paper
Open access
YSYueyang Su
Yueyang Su
DYDi Di Yao
Di Di Yao
XZXiaolei Zhou
Xiaolei Zhou
YZYuxuan Zhang
Yuxuan Zhang
YFYunxia Fan
Yunxia Fan
JBJingping Bi
Jingping Bi