Papers › Information Extraction from Visually Rich Documents Using Directed Weighted Graph...
Information Extraction from Visually Rich Documents Using Directed Weighted Graph Neural Network
Hamza Gbada, Karim Kalti, Mohamed Ali Mahjoub
This paper presents a novel approach to information extraction (IE) from visually rich documents (VRD) by employing a directed weighted graph representation to capture relationships among various VRD components. In contrast to conventional methods relying on spatial proximity through Euclidean distance, our approach aims to enhance performance by introducing a novel representation of relationships using directed weighted graphs. The information extraction task from VRD is treated as a node classification problem, leveraging graph convolutional networks that process the VRD graphs. We conducted evaluations on five real-world datasets, showcasing notable results and performances that align with established norms.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections