EDBT 2026 Demo / reviewers in the wild / expert
Jianfeng Chi
dblp:231/6028
· DBLP profile ↗
10ranked-venue papers in the field
1as first author
8since 2021 · last 2025
—ORCID · conflict
Domains — venue-derived; a paper can count in several
Data Mining & Knowledge Discovery · 5 (1 first)Information Retrieval & Web Search · 3Database Systems & Data Management · 2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Edge-Variational Graph Neural Networks: Harnessing Weak Ties for Enhanced Default Risk PredictionabstractDefault risk prediction (DRP) leveraging financial relational networks (FRNs) has seen extensive application in recent years. Connection confidence within an FRN is pivotal in ensuring the efficacy of FRN-based DRP, with strong connections offering a more substantial predictive impact and weak connections providing supplementary predictive insights. However, in practical DRP implementations, the confidence in both strong and weak connections may be compromised due to fraudulent activities and misinformation caused by data collection biases, necessitating a novel method to effectively assess and calibrate low-confidence connections within the FRN to enhance DRP. To address this challenge, we propose a novel method named Edge-Variational Graph Neural Networks (EVGNN). During the graph encoding phase, EVGNN employs variational inference to assess connection confidence within the FRN, eliminating low-confidence connections and reinforcing weak connections with significant predictive value. In the decoding phase, EVGNN recodes network nodes based on the calibrated FRN structure, yielding refined node representations that bolster DRP. Empirical evaluation based on public datesets and a large-scale FRN dataset from a real-world DRP scenario validates the effectiveness of the proposed method in identifying connection confidence and affirms the validity of utilizing calibrated FRN to enhance DRP. Feng Zhang 0043, Jianfeng Chi, Rongqi Chen |
CIKM | 2 |
| 2024 | Where Have You Been? A Study of Privacy Risk for Point-of-Interest RecommendationabstractAs location-based services (LBS) have grown in popularity, more human mobility data has been collected. The collected data can be used to build machine learning (ML) models for LBS to enhance their performance and improve overall experience for users. However, the convenience comes with the risk of privacy leakage since this type of data might contain sensitive information related to user identities, such as home/work locations. Prior work focuses on protecting mobility data privacy during transmission or prior to release, lacking the privacy risk evaluation of mobility data-based ML models. To better understand and quantify the privacy leakage in mobility data-based ML models, we design a privacy attack suite containing data extraction and membership inference attacks tailored for point-of-interest (POI) recommendation models, one of the most widely used mobility data-based ML models. These attacks in our attack suite assume different adversary knowledge and aim to extract different types of sensitive information from mobility data, providing a holistic privacy risk assessment for POI recommendation models. Our experimental evaluation using two real-world mobility datasets demonstrates that current POI recommendation models are vulnerable to our attacks. We also present unique findings to understand what types of mobility data are more susceptible to privacy attacks. Finally, we evaluate defenses against these attacks and highlight future directions and challenges. Kunlin Cai, Jinghuai Zhang, Zhiqing Hong, William Shand, Guang Wang 0001, Desheng Zhang 0002, Jianfeng Chi, Yuan Tian 0001 |
KDD | 7 |
| 2022 | Bi-Level Selection via Meta Gradient for Graph-Based Fraud Detection
Linfeng Dong, Yang Liu 0200, Xiang Ao 0001, Jianfeng Chi, Jinghua Feng, Hao Yang 0037, Qing He 0003 |
DASFAA (1) | 4 |
| 2022 | ADAPT: Adversarial Domain Adaptation with Purifier Training for Cross-Domain Credit Risk Forecasting
Guanxiong Zeng, Jianfeng Chi, Jinghua Feng, Xiang Ao 0001, Hao Yang 0037 |
DASFAA (1) | 2 |
| 2022 | Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNNabstractBenefiting from the message passing mechanism, Graph Neural Networks (GNNs) have been successful on flourish tasks over graph data. However, recent studies have shown that attackers can catastrophically degrade the performance of GNNs by maliciously modifying the graph structure. A straightforward solution to remedy this issue is to model the edge weights by learning a metric function between pairwise representations of two end nodes, which attempts to assign low weights to adversarial edges. The existing methods use either raw features or representations learned by supervised GNNs to model the edge weights. However, both strategies are faced with some immediate problems: raw features cannot represent various properties of nodes (e.g., structure information), and representations learned by supervised GNN may suffer from the poor performance of the classifier on the poisoned graph. We need representations that carry both feature information and as mush correct structure information as possible and are insensitive to structural perturbations. To this end, we propose an unsupervised pipeline, named STABLE, to optimize the graph structure. Finally, we input the well-refined graph into a downstream classifier. For this part, we design an advanced GCN that significantly enhances the robustness of vanilla GCN [24] without increasing the time complexity. Extensive experiments on four real-world graph benchmarks demonstrate that STABLE outperforms the state-of-the-art methods and successfully defends against various attacks. Kuan Li, Yang Liu 0200, Xiang Ao 0001, Jianfeng Chi, Jinghua Feng, Hao Yang 0037, Qing He 0003 |
KDD | 4 |
| 2022 | AUC-oriented Graph Neural Network for Fraud DetectionabstractThough Graph Neural Networks (GNNs) have been successful for fraud detection tasks, they suffer from imbalanced labels due to limited fraud compared to the overall userbase. This paper attempts to resolve this label-imbalance problem for GNNs by maximizing the AUC (Area Under ROC Curve) metric since it is unbiased with label distribution. However, maximizing AUC on GNN for fraud detection tasks is intractable due to the potential polluted topological structure caused by intentional noisy edges generated by fraudsters. To alleviate this problem, we propose to decouple the AUC maximization process on GNN into a classifier parameter searching and an edge pruning policy searching, respectively. We propose a model named AO-GNN (Short for AUC-oriented GNN), to achieve AUC maximization on GNN under the aforementioned framework. In the proposed model, an AUC-oriented stochastic gradient is applied for classifier parameter searching, and an AUC-oriented reinforcement learning module supervised by a surrogate reward of AUC is devised for edge pruning policy searching. Experiments on three real-world datasets demonstrate that the proposed AO-GNN patently outperforms state-of-the-art baselines in not only AUC but also other general metrics, e.g. F1-macro, G-means. Mengda Huang, Yang Liu 0200, Xiang Ao 0001, Kuan Li, Jianfeng Chi, Jinghua Feng, Hao Yang 0037, Qing He 0003 |
WWW | 5 |
| 2021 | Credit Risk and Limits Forecasting in E-Commerce Consumer Lending Service via Multi-view-aware Mixture-of-experts NetsabstractConsumer lending service is escalating in E-Commerce platforms due to its capability in enhancing buyers' purchasing power, improving average order value, and increasing revenue of the platforms. Credit risk forecasting and credit limits setting are two fundamental problems in E-Commerce/online consumer lending services. Currently, the majority of institutes rely on two-separate-step methods to resolve. First, build a rating model to evaluate credit risk, and then design heuristic strategies to set credit limits, which requires a large amount of prior knowledge and lacks theoretical justifications. In this paper, we propose an end-to-end multi-view and multi-task learning based approach named MvMoE (Multi-view-aware Mixture-of-Experts network) to solve these two problems simultaneously. First, a multi-view network with a hierarchical attention mechanism is constructed to distill users' heterogeneous financial information into shared hidden representations. Then, we jointly train these two tasks with a view-aware multi-gate mixture-of-experts network and a subsequent progressive network to improve their performances. With the real-world dataset contained 5.44 million users, we investigate the effectiveness of MvMoE. Experimental results exhibit that the proposed model is able to improve AP over 5.60% on credit risk forecasting and MAE over 9.52% on credit limits setting compared with conventional methods. Meanwhile, MvMoE has good interpretability, which better underpins the imperative demands in financial industries. Ting Liang, Guanxiong Zeng, Qiwei Zhong, Jianfeng Chi, Jinghua Feng, Xiang Ao 0001, Jiayu Tang |
WSDM | 4 |
| 2021 | Pick and Choose: A GNN-based Imbalanced Learning Approach for Fraud DetectionabstractGraph-based fraud detection approaches have escalated lots of attention recently due to the abundant relational information of graph-structured data, which may be beneficial for the detection of fraudsters. However, the GNN-based algorithms could fare poorly when the label distribution of nodes is heavily skewed, and it is common in sensitive areas such as financial fraud, etc. To remedy the class imbalance problem of graph-based fraud detection, we propose a Pick and Choose Graph Neural Network (PC-GNN for short) for imbalanced supervised learning on graphs. First, nodes and edges are picked with a devised label-balanced sampler to construct sub-graphs for mini-batch training. Next, for each node in the sub-graph, the neighbor candidates are chosen by a proposed neighborhood sampler. Finally, information from the selected neighbors and different relations are aggregated to obtain the final representation of a target node. Experiments on both benchmark and real-world graph-based fraud detection tasks demonstrate that PC-GNN apparently outperforms state-of-the-art baselines. Yang Liu 0200, Xiang Ao 0001, Zidi Qin, Jianfeng Chi, Jinghua Feng, Hao Yang 0037, Qing He 0003 |
WWW | 4 |
| 2020 | Learning to Undersampling for Class Imbalanced Credit Risk ForecastingabstractCredit risk forecasting generally aims to evaluate the default probability of users in financial service. It is usually regarded as a binary classification problem, which suffers from the severe class-imbalance problem due to the extremely limited throngs and the concept drift problem brought by the delayed verification. In this paper, we investigate these problems in credit risk forecasting and propose a semi-supervised meta-learning based approach called TRUST (TRainable Undersampling with Self Training) to resolve. First, it decides whether to sample the data through meta-learning based reinforcement learning. Secondly, it learns the distribution of the data that have not yet shown financial performance via self-training and updates the model trained in the first step. Finally, the updated model is evaluated on the validation dataset, the result of which will be fed back through the evaluator. These three steps will be iterated until the model converges. With the real-world industrial dataset containing 1.75 million users, we investigate the effectiveness of our method. Experimental results exhibit that the proposed method is able to improve AP over 5.94% on credit risk forecasting task compared with the recent methods. Jianfeng Chi, Guanxiong Zeng, Qiwei Zhong, Ting Liang, Jinghua Feng, Xiang Ao 0001, Jiayu Tang |
ICDM | 1 |
| 2019 | Inquiry Spam Detection via Jointly Exploiting Temporal-Categorical Behavior and LinguisticsabstractInquiry performs one of the backbones in current E-commerce websites. Detecting spams in inquiries is essential for these platforms but is surprisingly underexplored by current research. In this paper, we propose a system coined ISTBEL to detect spam inquiries. Motivated by the observations on both behavioral and linguistic differences between spammers and benign users, ISTBEL jointly utilizes the temporal-categorical behavioral sequence and text sequence to accomplish its purpose. At its heart, a variant of LSTM equipped interactive attentions is devised to strengthen the coherence between the categorical and temporal behaviors. A character-level CNN is adopted to capture the capricious linguistic patterns. These two modules are integrated and collaboratively contribute to the final predictions. Our system is trained through an end-to-end manner and can directly utilize raw data as input without tedious feature engineering. We have applied the system to inquiry spam detection on Alibaba.com, and results show ISTBEL is promising in detection spammers and outperforms baselines by a large margin. Meanwhile, ISTBEL can be easily applied to other applications which contain both behavioral and linguistic information. Qiwei Zhong, Jiayu Tang, Jinghua Feng, Jianfeng Chi |
ICDM | 4 |