GraphRPM: Risk Pattern Mining on Industrial Large Attributed Graphs
Sheng Tian, Xintan Zeng, Yifei Hu, Baokun Wang, Yongchao Liu, Yue Jin,, Changhua Meng, Chuntao Hong, Tianyi Zhang, Weiqiang Wang

TL;DR
GraphRPM is a parallel and distributed framework designed to efficiently mine risk-related graph patterns in large-scale industrial attributed graphs, addressing scalability and complexity challenges.
Contribution
The paper introduces GraphRPM, a novel framework with a graph isomorphism network and optimized parallel operations for large-scale risk pattern mining in industrial graphs.
Findings
Effective in handling graphs with millions of nodes
Reduces computational complexity and resource use
Validated on real-world datasets
Abstract
Graph-based patterns are extensively employed and favored by practitioners within industrial companies due to their capacity to represent the behavioral attributes and topological relationships among users, thereby offering enhanced interpretability in comparison to black-box models commonly utilized for classification and recognition tasks. For instance, within the scenario of transaction risk management, a graph pattern that is characteristic of a particular risk category can be readily employed to discern transactions fraught with risk, delineate networks of criminal activity, or investigate the methodologies employed by fraudsters. Nonetheless, graph data in industrial settings is often characterized by its massive scale, encompassing data sets with millions or even billions of nodes, making the manual extraction of graph patterns not only labor-intensive but also necessitating…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
