k-Hop Ego-Subgraph
A local transaction graph constructed around a target edge up to radius k = 2 hops using breadth-first search.
Source: DL-RL: Dual-Layer Graph Neural Networks with Curriculum Reinforcement Learning for Financial Fraud Detection (Academic research) · p.2
Have a question about k-Hop Ego-Subgraph? Ask the AI, answers cite the source.