GraphFAS for Graph Feature Selection
GraphFAS: A Distributed System for Automated Graph Feature Generation and Selection in Industrial Transaction Networks
GraphFAS enables fraud detection systems to work with tabular models and TreeSHAP-based explanations, making it practical for financial institutions in ASEAN.
GraphFAS is a distributed system for automated graph feature generation and selection in industrial transaction networks. It uses a non-parametric module to create interpretable structural features via multi-hop subgraph extraction and multi-scale aggregation. The system extends Boruta with median-based aggregation across partitions to identify informative features with minimal domain expertise. Deployed in Alipay, GraphFAS shows order-of-magnitude improvements in engineering efficiency compared to expert-driven and graph-learning baselines.
GraphFAS: A Distributed System for Automated Graph Feature Generation and Selection in Industrial Transaction Networks
Industrial fraud detection often relies on costly expert-crafted features that overlook graph-structured relational signals, while GNNs often do not meet the interpretability and deployment requirements of financial risk control. We propose GraphFAS (Graph Feature Automated Selection), a distributed feature selection procedure based on Boruta that bridges this gap through: (1) a non-parametric graph feature generation module that constructs explicit, interpretable structural features via multi-hop subgraph extraction and multi-scale aggregation without learned parameters; and (2) an automated distributed feature selection algorithm extending Boruta with median-based aggregation across partitions to robustly identify informative features at scale with minimal domain expertise. Compared with end-to-end GNN pipelines, GraphFAS decouples feature aggregation from model training, enabling direct integration with tabular models and direct compatibility with TreeSHAPbased explanations. Deployed in Alipay, GraphFAS delivers orderof-magnitude improvements in engineering efficiency while showing strong performance against expert-driven and graph-learning baselines on large-scale graphs.